bkomuves / nanohsLinks
a self-hosting lambda calculus compiler
☆35Updated 3 months ago
Alternatives and similar repositories for nanohs
Users that are interested in nanohs are comparing it to the libraries listed below
Sorting:
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 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
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A toy dependent typed language.☆30Updated 3 weeks ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- The Alms Programming Language☆44Updated 6 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated last month
- Quantitative Type Theory implementation☆54Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Kempe is a compiled stack-based language☆58Updated 9 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A Teeny Type Theory☆26Updated 3 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 9 months ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago