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:
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Quasi-quoting library for agda☆18Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 4 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- Mechanizing Types and Programming Languages using Beluga☆21Updated 5 years ago
- ☆18Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- ☆13Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Constructive Galois connections☆36Updated 7 years ago