VictorTaelin / optimul
Multiplication on optimal λ-calculus reducers
☆22Updated 4 years ago
Alternatives and similar repositories for optimul:
Users that are interested in optimul are comparing it to the libraries listed below
- A simple implementation of linear type theory☆38Updated 7 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Standard library for the Formality language☆18Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- Formalism and proofs for esverify☆20Updated 6 years ago
- ☆29Updated 6 years ago
- Classical Logic in Haskell☆24Updated last week
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A nano "theorem prover".☆61Updated 6 years ago
- An extended typed Lambda Calculus☆21Updated 6 months ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- Collection of Idris snippets☆21Updated 11 months ago
- Recursion schemes in ATS☆9Updated 2 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- ☆35Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago