pis147879 / PELCRLinks
Parallel Environment for optimal Lambda Calculus Reduction
☆28Updated 3 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 4 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 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
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 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
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Specification of the Cedille Core language☆33Updated 5 years ago
- Paper and talk☆55Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- A simple implementation of linear type theory☆38Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A nano "theorem prover".☆62Updated 6 years ago