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:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆45Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- A TACtic library for Agda☆49Updated 11 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 2 weeks ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- ☆19Updated last year
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Simplified Observational Type Theory☆84Updated 2 years ago
- Agda programming with holes☆27Updated 4 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 10 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago