RockBrentwood / Combo
A combinator reduction engine that accepts syntax for lambda expressions and is optimal. Rebase pending. That will affect forks. Downstream will be advanced-notified.
☆10Updated last year
Alternatives and similar repositories for Combo:
Users that are interested in Combo are comparing it to the libraries listed below
- Efficient and single-steppable ULC evaluation algorithm☆15Updated 3 years ago
- ☆63Updated 2 years ago
- linear algebra done right in coq☆10Updated 3 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- A place to collect work on dialectica categories.☆26Updated 2 months ago
- A work-in-progress core language for Agda, in Agda☆48Updated 2 weeks ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 5 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 4 years ago
- Animations of lambda term reduction sequences☆125Updated 6 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆26Updated 2 years ago
- ☆25Updated 2 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆80Updated 4 years ago
- A virtual memory scanner☆10Updated last year
- Anders: Cubical Type Checker☆24Updated last year
- ☆20Updated last week
- SDL2 bindings for lean☆21Updated last year
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆35Updated this week
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- A formalization of the Rubik's cube group☆27Updated 4 years ago
- Coqtail is a library of mathematical theorems and tools proved inside the Coq proof assistant. Results range mostly from arithmetic to re…☆16Updated 8 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆30Updated last month
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 2 months ago
- A simple functional programming language.☆21Updated 3 years ago
- Turnstyle is a graphical esoteric programming language based on lambda calculus☆80Updated 5 months ago
- Я - extremely composable embeddable programming language☆49Updated this week
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated last month