mb64 / LC-interpreterLinks
A compiler and runtime for normalizing the untyped λ-calculus
☆31Updated 3 years ago
Alternatives and similar repositories for LC-interpreter
Users that are interested in LC-interpreter are comparing it to the libraries listed below
Sorting:
- A toy dependent typed language.☆30Updated 3 weeks ago
- 🪆 A Staged Type Theory☆35Updated last year
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Setoid type theory implementation☆38Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated 2 weeks ago
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- ☆36Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- high-performance cubical evaluation☆74Updated 2 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 4 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆34Updated 9 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year