sstucki / system-f-agda
A formalization of the polymorphic lambda calculus extended with iso-recursive types
☆70Updated 5 years ago
Alternatives and similar repositories for system-f-agda:
Users that are interested in system-f-agda are comparing it to the libraries listed below
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 9 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 5 months ago
- ☆45Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Where my everyday research happens☆52Updated last week
- Library of categories, with categorical constructions on them☆54Updated last year
- The Evolution of a Typechecker☆54Updated 5 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆96Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Unification and type inference algorithms☆124Updated 9 years ago
- A TACtic library for Agda☆48Updated 4 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 2 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Agda programming with holes☆27Updated 3 years ago
- ☆84Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- being the materials for Summer 2013's course☆112Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago