pi8027 / lambda-calculusLinks
A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
☆86Updated 5 years ago
Alternatives and similar repositories for lambda-calculus
Users that are interested in lambda-calculus are comparing it to the libraries listed below
Sorting:
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Monadic effects and equational reasoning in Rocq☆73Updated 3 weeks ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆85Updated 8 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆84Updated last year
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago