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☆29Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Quasi-quoting library for agda☆18Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆48Updated 6 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- ☆18Updated 3 years ago
- Mechanizing Types and Programming Languages using Beluga☆21Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ☆26Updated 8 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- ☆11Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 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
- my phd thesis☆26Updated last year