ia0 / lafontLinks
Animation of Yves Lafont's Interaction Combinators
☆19Updated 3 years ago
Alternatives and similar repositories for lafont
Users that are interested in lafont are comparing it to the libraries listed below
Sorting:
- Class of data structures that can be unfolded.☆22Updated 2 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 5 years ago
- Imagine a Dependently Typed Python☆11Updated 7 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
- A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera☆21Updated 3 years ago
- Label dependent dependent session types☆16Updated last year
- LaTeX sources for the Habit Programming Language Report☆24Updated 7 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 10 months ago
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- An extended typed Lambda Calculus☆21Updated last year
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A well typed by construction kernel language for bidirectional programming☆13Updated 10 months ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- ☆35Updated 7 years ago
- ☆16Updated 3 years ago
- A WebAssembly implementation in Lean4☆37Updated last year
- A TOML parser for Idris 2☆17Updated last year
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Type-Level Programming in Rust☆27Updated 3 years ago
- A tiny statically typed programming language☆18Updated 11 years ago
- A toy dependent typed language.☆32Updated this week
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- Liquid Types implementation for Rust☆30Updated 3 years ago