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
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- ☆45Updated 5 years ago
- Where my everyday research happens☆52Updated this week
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- ☆84Updated 7 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Agda programming with holes☆27Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆99Updated 2 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- A TACtic library for Agda☆48Updated 6 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago