VictorTaelin / optimulLinks
Multiplication on optimal λ-calculus reducers
☆22Updated 5 years ago
Alternatives and similar repositories for optimul
Users that are interested in optimul are comparing it to the libraries listed below
Sorting:
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- A nano "theorem prover".☆62Updated 6 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Macro Lambda Calculus☆50Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Morte IDE☆29Updated 8 months ago
- Two-Level Type Theory☆28Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Generation of abstract binding trees☆27Updated 3 months ago
- Interactive and object-oriented programming in Agda using coinductive types☆24Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆36Updated last year
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆29Updated 10 years ago