sstucki / system-f-agdaLinks
A formalization of the polymorphic lambda calculus extended with iso-recursive types
☆72Updated 6 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
Sorting:
- The Evolution of a Typechecker☆54Updated 6 years ago
- Where my everyday research happens☆55Updated 3 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆45Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- A TACtic library for Agda☆49Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Category theory and algebra☆27Updated 9 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 11 months ago
- Implementing grep in Agda☆33Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- ☆48Updated last month