FrozenWinters / stlc
This aims to be the most pretentious implementation of stlc in existence
☆61Updated 2 years ago
Alternatives and similar repositories for stlc:
Users that are interested in stlc are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 11 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 4 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- high-performance cubical evaluation☆69Updated 2 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- A work-in-progress core language for Agda, in Agda☆44Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- ☆28Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆98Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- antifunext☆31Updated 7 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 2 years ago
- ☆47Updated 2 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- The multimode presheaf proof-assistant☆36Updated last year
- ☆36Updated 3 years ago
- A tutorial on how Agda infers things☆40Updated 4 years ago
- ☆23Updated 5 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- being the materials for Summer 2013's course☆112Updated last year
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- SPLV20 course notes☆108Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago