FrozenWinters / stlc
This aims to be the most pretentious implementation of stlc in existence
☆60Updated 2 years ago
Related projects: ⓘ
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 6 months ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆91Updated 2 years ago
- high-performance cubical evaluation☆67Updated 2 months ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆50Updated this week
- antifunext☆27Updated 2 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆94Updated 5 months ago
- ☆21Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆50Updated this week
- ☆35Updated 2 years ago
- Mechanizations of Type Theories☆26Updated 2 weeks ago
- ☆46Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆68Updated 5 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 3 weeks ago
- Benchmarking various normalization algorithms for the lambda calculus☆43Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- SPLV20 course notes☆106Updated last year
- being an operating system for typechecking processes☆120Updated last year
- Basics of the dependently-typed functional language Agda ^_^☆37Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆106Updated last year
- Lecture notes on realizability☆65Updated 5 months ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- H.O.T.T. using rewriting in Agda☆38Updated 2 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆60Updated 2 months ago
- A TACtic library for Agda☆48Updated this week
- The multimode presheaf proof-assistant☆35Updated last year