unbound: Generic support for programming with names and binders

[ bsd3, compilers-interpreters, generics, language, library ] [ Propose Tags ]

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]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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, 0.5.0, 0.5.1, 0.5.1.1
Change log CHANGES
Dependencies base (>=4.3 && <5), binary (>=0.7 && <0.9), containers (>=0.3 && <0.6), mtl (>=2.0 && <2.3), RepLib (>=0.5.3 && <0.6), semigroups (>=0.18 && <0.19), transformers (>=0.2.2.0 && <0.6) [details]
License BSD-3-Clause
Author Stephanie Weirich, Brent Yorgey
Maintainer Stephanie Weirich <sweirich@cis.upenn.edu>
Category Language, Generics, Compilers/Interpreters
Home page https://github.com/sweirich/replib
Source repo head: git clone https://github.com/sweirich/replib
Uploaded by sweirich at 2018-10-15T09:58:00Z
Distributions
Reverse Dependencies 3 direct, 9 indirect [details]
Downloads 16321 total (34 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-10-15 [all 1 reports]

Readme for unbound-0.5.1.1

[back to package description]
-----------------------------------------------------------------------------
-- 
-- Copyright   :  (c) 2010-2015, 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:

  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).