sstucki / system-f-agda
A formalization of the polymorphic lambda calculus extended with iso-recursive types
☆71Updated 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:
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months 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
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆45Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆51Updated 9 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A TACtic library for Agda☆48Updated 8 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 7 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Agda programming with holes☆27Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago