danaugrs / deltanetsLinks
Δ-Nets: Interaction-Based System for Optimal Parallel λ-Reduction
☆18Updated 4 months ago
Alternatives and similar repositories for deltanets
Users that are interested in deltanets are comparing it to the libraries listed below
Sorting:
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆38Updated 3 weeks ago
- An implementation of interaction nets as a forth-like language.☆36Updated 3 months ago
- Interaction net resources☆36Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Fir programming language☆80Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- A verified, modern, hardened memory allocator. [maintainer=@cmovcc]☆36Updated 3 weeks ago
- Experiment on how to bootstrap the OCaml compiler☆111Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- A toy ELF parser/validator☆14Updated 10 months ago
- File format and optimizer for programs encoded in binary lambda calculus☆16Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated 2 weeks ago
- Martin-Löf type theory + W-types implemented in C (WIP)☆25Updated 3 months ago
- Reference compiler for c0☆37Updated 5 months ago
- The Nox programming language☆30Updated 2 years ago
- types for various combinatory systems, especialy tree calculi☆23Updated 9 months ago
- Formally verified operator language and rewriting engine for high-performance computing☆29Updated last year
- Formalising the WASM spec in Lean☆27Updated last year
- Playing with type systems☆51Updated 10 months ago
- CN separation logic refinement type system for C☆39Updated this week
- A language with dependent data and codata types☆124Updated this week
- A general purpose statically-typed concatenative programming language.☆55Updated 2 years ago
- A constraint solver built from scratch in OCaml☆12Updated 3 years ago
- Programming with pure lambda calculus☆128Updated this week
- Personal research notes☆17Updated last year
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆75Updated 3 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 4 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆36Updated 6 months ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago