bkomuves / nanohsLinks
a self-hosting lambda calculus compiler
☆37Updated 8 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☆20Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Linearizability Hoare Logic☆14Updated 8 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- A nano "theorem prover".☆62Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆39Updated 3 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A simple functional programming language.☆22Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Specification of the Cedille Core language☆34Updated 5 years ago
- ☆17Updated last year
- Pretty-print error messages of the ATS Compiler☆37Updated 6 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year