sstucki / system-f-agda
A formalization of the polymorphic lambda calculus extended with iso-recursive types
☆71Updated 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
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- Where my everyday research happens☆52Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- ☆45Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- ☆84Updated 7 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 8 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- Paper and talk☆53Updated last year
- Tiny type-checker with dependent types☆77Updated 11 years ago
- A TACtic library for Agda☆48Updated 7 months ago
- A simple GUI for Agda☆31Updated 9 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Agda programming with holes☆27Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago