lamdu / lamdu-calculusLinks
An extended typed Lambda Calculus
☆21Updated last year
Alternatives and similar repositories for lamdu-calculus
Users that are interested in lamdu-calculus are comparing it to the libraries listed below
Sorting:
- Two-Level Type Theory☆28Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- The Alms Programming Language☆44Updated 7 years ago
- ☆16Updated 7 months ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- TPTP linear logic version☆14Updated 7 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- ☆29Updated 10 years ago
- MetaML and MetaOCaml bibliography☆93Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- source code for the bondi programming language☆41Updated 6 years ago
- ☆36Updated last year
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 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
- Generation of abstract binding trees☆27Updated 11 months ago