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 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- 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☆81Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- Paper and talk☆55Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Miller/pattern unification in Agda☆65Updated 11 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 version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- ☆36Updated 3 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 6 months ago
- Two-Level Type Theory☆28Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- ☆26Updated 8 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year