ia0 / lafont
Animation of Yves Lafont's Interaction Combinators
☆14Updated 2 years ago
Alternatives and similar repositories for lafont:
Users that are interested in lafont are comparing it to the libraries listed below
- An extended typed Lambda Calculus☆20Updated 5 months ago
- Haskell bindings to binaryen.☆13Updated 3 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- A pure Haskell implementation of a decoder-only transformer (GPT)☆18Updated 6 months ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 6 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
- Various interesting topics I'm looking at☆13Updated 15 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- 🧪 | LLVM backend for HVM☆21Updated last year
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Superposition prover☆17Updated last year
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Type-Level Programming in Rust☆27Updated 3 years ago
- A partial implementation of Protocol Buffers in Idris☆30Updated 7 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Standard library for the Formality language☆18Updated 4 years ago
- dependently-typed lisp with flexible compiler backends☆28Updated 5 years ago
- A type-safe, stack-based functional programming language☆15Updated 2 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- A functional scripting language.☆18Updated this week
- A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera☆19Updated 2 years ago
- Dependent hash maps☆14Updated 7 months ago
- Practical type inference for arbitrary-rank types☆10Updated 5 years ago
- Haskell binding for PADS☆18Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 6 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- A toy dependent typed language.☆24Updated this week