bkomuves / nanohsLinks
a self-hosting lambda calculus compiler
☆37Updated 6 months ago
Alternatives and similar repositories for nanohs
Users that are interested in nanohs are comparing it to the libraries listed below
Sorting:
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- 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
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A toy dependent typed language.☆32Updated last week
- A nano "theorem prover".☆62Updated 6 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Linearizability Hoare Logic☆14Updated 7 months ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- A simple functional programming language.☆22Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Specification of the Cedille Core language☆33Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- source code for the bondi programming language☆41Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago