YouyouCong / type-preserving-cps
Type-preserving CPS translation for simply- and dependently-typed lambda calculi
☆19Updated 7 years ago
Alternatives and similar repositories for type-preserving-cps:
Users that are interested in type-preserving-cps are comparing it to the libraries listed below
- Mtac in Agda☆28Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- ☆13Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Coq library for handling names☆19Updated 2 years ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- yet another toy OCaml interpreter in Haskell☆12Updated 4 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- System F in coq.☆19Updated 10 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated this week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆18Updated 2 years ago
- ☆11Updated 4 years ago
- ☆21Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago