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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Quasi-quoting library for agda☆18Updated 11 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Mechanizing Types and Programming Languages using Beluga☆21Updated 5 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- ☆84Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated 2 months ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆18Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago