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 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Coq library for handling names☆19Updated 2 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 weeks ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 4 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- https://metaborg.github.io/mj.agda/☆12Updated 4 years ago
- ☆11Updated 4 years ago
- ☆12Updated 9 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- ☆18Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 8 months ago