HerrmannM / eoleLinks
Éole, a Lévy-optimal lambda calculus evaluator without oracle
☆113Updated 5 years ago
Alternatives and similar repositories for eole
Users that are interested in eole are comparing it to the libraries listed below
Sorting:
- A small and expressive dependently typed language☆131Updated 5 years ago
- A λ-calculus grammar/interpretor written using LALRPOP and `λ!`.☆86Updated last year
- Haskell re-implementation of STOKE, the stochastic superoptimizer☆63Updated 6 years ago
- Haskell In New Clothes☆110Updated 5 years ago
- Advent of Code 2018, in Coq! (https://adventofcode.com/2018)☆140Updated 6 years ago
- A visual interpreter of the template instantiation machine to understand evaluation of lazy functional languages☆71Updated 8 years ago
- A Typed, Composable Database Query Language☆104Updated 4 years ago
- a pragmatic point-free theorem prover assistant☆142Updated last week
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 8 months ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆117Updated 6 years ago
- Fungi: Typed incremental computation with names☆70Updated 5 years ago
- Generate semi-dynamic UIs with Concur☆58Updated 4 years ago
- ☆55Updated 8 years ago
- Verified hash-based AMQ structures in Coq☆124Updated 5 years ago
- Rust to F* toolchain☆43Updated 6 years ago
- A tiny *optimising* compiler for an imperative programming language written in haskell☆158Updated 6 years ago
- The cuteness implementation of a dependently typed language.☆193Updated 2 years ago
- Fast Aho-Corasick string searching☆187Updated 7 months ago
- A simple expressions language with polymorphic extensible row types.☆303Updated 2 years ago
- A small compiler for PCF☆127Updated 4 years ago
- Proving a blocking queue deadlock free in a dozen different ways☆43Updated 11 months ago
- The compiler for Keli☆173Updated 6 years ago
- A graphical interactive proof assistant designed for education☆169Updated 10 months ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- ☆35Updated 7 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- A simulator for visualising the evolution of π-calculus terms☆42Updated 3 years ago
- implementation of Pure Type Systems (PTS) in Rust.☆51Updated 8 years ago
- functional neural networks in ocaml☆89Updated 5 years ago