ia0 / lafont
Animation of Yves Lafont's Interaction Combinators
☆16Updated 3 years ago
Alternatives and similar repositories for lafont:
Users that are interested in lafont are comparing it to the libraries listed below
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A compiler for a little statically-typed language implemented in Haskell.☆13Updated 5 years ago
- Dependent hash maps☆14Updated 10 months ago
- a self-hosting lambda calculus compiler☆35Updated 4 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- dependently-typed lisp with flexible compiler backends☆28Updated 5 years ago
- An extended typed Lambda Calculus☆21Updated 7 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated 9 months ago
- A general purpose relational language☆20Updated 5 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- Reference counting with linear types☆31Updated 8 months ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Tools for MIL, a Monadic Intermediate Language☆21Updated 6 months ago
- Type-Level Programming in Rust☆27Updated 3 years ago
- Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support☆16Updated 4 years ago
- Backtracking monad in Haskell☆14Updated 3 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- A framework for managing daemons from Haskell and libraries for use with postgresql and nix☆20Updated last month
- The Pulse separation logic DSL for F*☆14Updated this week
- A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera☆20Updated 2 years ago
- A partial implementation of Protocol Buffers in Idris☆31Updated 7 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 6 years ago
- Recursion schemes in ATS☆9Updated 2 years ago
- dependent type theory experiment☆25Updated last year
- Simple implementation of call-by-need lazy lambda calculus in Rust.☆15Updated 11 months ago
- ☆12Updated last year