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 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 4 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
- 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
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- ☆36Updated 3 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Interactive Theorem Proving for students☆20Updated last year
- Paper and talk☆54Updated 2 years ago
- Revised Omega-categorical Typechecker☆27Updated 9 months ago
- ☆16Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- Two-Level Type Theory☆28Updated 5 years ago