pis147879 / PELCRLinks
Parallel Environment for optimal Lambda Calculus Reduction
☆28Updated 2 years ago
Alternatives and similar repositories for PELCR
Users that are interested in PELCR are comparing it to the libraries listed below
Sorting:
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- ☆26Updated 8 years ago
- Formalization of type theory☆22Updated 3 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- Linear map categories in Agda☆5Updated 2 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 11 months ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- ☆36Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆30Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago