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
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- ☆18Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Mechanizing Types and Programming Languages using Beluga☆21Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- ☆13Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago