jfdm / velo-langLinks
Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
☆16Updated 2 years ago
Alternatives and similar repositories for velo-lang
Users that are interested in velo-lang are comparing it to the libraries listed below
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆12Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- ☆17Updated last year
- Classical Logic in Haskell☆24Updated 4 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A formalization of System Fω in Agda☆17Updated 5 months ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A crowd-sourced list of papers using Idris☆8Updated 3 years ago
- ☆17Updated 6 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆35Updated this week
- Experimental normalisation via scheme☆12Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A TOML parser for Idris 2☆17Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- a self-hosting lambda calculus compiler☆36Updated 4 months ago
- A compiler that translates a form of lambda calculus to C☆12Updated last year