YouyouCong / type-preserving-cps
Type-preserving CPS translation for simply- and dependently-typed lambda calculi
☆19Updated 7 years ago
Related projects: ⓘ
- Mtac in Agda☆28Updated 3 years ago
- Mechanizing Types and Programming Languages using Beluga☆17Updated 4 years ago
- ☆13Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 8 months ago
- A cost-aware logical framework, embedded in Agda.☆52Updated last month
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- Coq library for handling names☆18Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- https://metaborg.github.io/mj.agda/☆12Updated 3 years ago
- ☆18Updated 2 years ago
- ☆11Updated 4 years ago
- ☆26Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Quasi-quoting library for agda☆16Updated 3 years ago
- Logical relations proof in Agda☆24Updated 9 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- System F in coq.☆19Updated 9 years ago
- a version of the 2048 game for Coq☆22Updated 10 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆27Updated last month
- yet another toy OCaml interpreter in Haskell☆13Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆16Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 3 years ago