YouyouCong / type-preserving-cpsLinks
Type-preserving CPS translation for simply- and dependently-typed lambda calculi
☆19Updated 8 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
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 2 weeks ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- ☆13Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 weeks ago
- System F in coq.☆19Updated 10 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Coq library for handling names☆19Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago