lamdu / lamdu-calculus
An extended typed Lambda Calculus
☆21Updated 7 months ago
Alternatives and similar repositories for lamdu-calculus:
Users that are interested in lamdu-calculus are comparing it to the libraries listed below
- Two-Level Type Theory☆28Updated 5 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- a self-hosting lambda calculus compiler☆35Updated this week
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- ☆16Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆29Updated 9 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 9 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 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
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Experimentation project☆16Updated 11 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago