The unbound package

[Tags:bsd3, library]

Specify the binding structure of your data type with an expressive set of type combinators, and Unbound handles the rest! Automatically derives alpha-equivalence, free variable calculation, capture-avoiding substitution, and more. See Unbound.LocallyNameless to get started.


[Skip to Readme]

Properties

Versions 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.3, 0.3.1, 0.4, 0.4.0.1, 0.4.0.2, 0.4.1, 0.4.1.1, 0.4.2, 0.4.3, 0.4.3.1, 0.4.4
Change log CHANGES
Dependencies base (>=4.3 && <5), containers (>=0.3 && <0.5), mtl (==2.0.*), RepLib (>=0.5), transformers (>=0.2.2.0 && <0.2.3) [details]
License BSD3
Author Stephanie Weirich
Maintainer Brent Yorgey <byorgey@cis.upenn.edu> Stephanie Weirich <sweirich@cis.upenn.edu>
Stability Unknown
Category Language, Generics, Compilers/Interpreters
Home page http://code.google.com/p/replib/
Source repository head: svn checkout https://replib.googlecode.com/svn/trunk/
Uploaded Wed Aug 24 19:56:06 UTC 2011 by BrentYorgey
Distributions NixOS:0.4.4
Downloads 3725 total (42 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
All reported builds failed as of 2015-11-25 [all 4 reports]

Modules

  • Unbound
    • Unbound.LocallyNameless
      • Unbound.LocallyNameless.Alpha
      • Unbound.LocallyNameless.Fresh
      • Unbound.LocallyNameless.Name
      • Unbound.LocallyNameless.Ops
      • Unbound.LocallyNameless.Subst
      • Unbound.LocallyNameless.Types
    • Unbound.PermM
    • Unbound.Util

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for unbound

Readme for unbound-0.3

-----------------------------------------------------------------------------
-- 
-- Copyright   :  (c) 2010-2011, Unbound team (see LICENSE)
-- License     :  BSD3
-- 
-- Maintainer  :  sweirich@cis.upenn.edu, byorgey@cis.upenn.edu
-- Stability   :  experimental
-- Portability :  non-portable
--
-----------------------------------------------------------------------------

Specify the binding structure of your data type with an expressive set
of type combinators, and Unbound handles the rest!  Automatically
derives alpha-equivalence, free variable calculation, capture-avoiding
substitution, and more.

To install (requires GHC 7), just 

  cabal install unbound

To get started using the library, see the tutorial in the tutorial/
directory and the extensive Haddock documentation (start with the
Unbound.LocallyNameless module).