A test suite for strong beta-reduction of the pure, untyped lambda calculus with ~1200 handwritten tests
☆16Jun 8, 2026Updated 2 months ago
Alternatives and similar repositories for strong-reduction-tests
Users that are interested in strong-reduction-tests are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- effects, but optimal☆16Jan 9, 2026Updated 7 months ago
- Interaction net resources☆58Mar 25, 2026Updated 5 months ago
- operating system but in effekt (poc)☆16Mar 14, 2026Updated 5 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Apr 15, 2021Updated 5 years ago
- Minith Primus☆26Jan 7, 2026Updated 7 months ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- CIS 6700, Spring 2023☆19Feb 15, 2023Updated 3 years ago
- Unusable but free and open-source window manager for Linux and *BSD (<500LOC)☆14Jul 6, 2019Updated 7 years ago
- # A simple variable binding library based on well-scoped indices and environments☆38Updated this week
- Notes written while consulting for the Higher Order Company☆17Sep 27, 2025Updated 11 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆32Sep 21, 2022Updated 3 years ago
- ☆12May 9, 2015Updated 11 years ago
- The Stroscot Programming Language☆12Aug 22, 2026Updated last week
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Jan 3, 2022Updated 4 years ago
- ☆23Mar 24, 2026Updated 5 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Benchmarks for capture-avoiding substitution☆126May 30, 2025Updated last year
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Apr 22, 2025Updated 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…☆40Jun 30, 2026Updated 2 months ago
- fuck off ai music☆35Aug 9, 2026Updated 3 weeks ago
- Formal specification of the Haskell Language Report☆33Mar 2, 2026Updated 5 months ago
- ☆15Mar 17, 2016Updated 10 years ago
- A language with dependent data and codata types☆140Aug 23, 2026Updated last week
- Formalization of CBPV extended with effect and coeffect tracking☆17Aug 30, 2024Updated 2 years ago
- Experiments using a bidirectional typesystem☆17Jan 30, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 9 years ago
- Programming with pure lambda calculus☆144Jul 16, 2026Updated last month
- Code for the submitted TyDe '16 extended abstract and C∘mp∘se '17 talk "`choose` Your Own Derivative"☆19May 18, 2017Updated 9 years ago
- Denotational semantics based on graph and filter models☆22Dec 16, 2024Updated last year
- ☆16May 10, 2017Updated 9 years ago
- Haskell geometry library☆17Aug 9, 2026Updated 3 weeks ago
- A browser for sliced Haskell fragments☆15Sep 23, 2015Updated 10 years ago
- use an LLM to translate purpose-statements into code to evaluate their quality☆11Apr 3, 2024Updated 2 years ago
- 📚 A collection of resources about normalization-by-evaluation☆30Jul 29, 2025Updated last year
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Coq formalization accompanying the paper: Micro-Policies: A Framework for Verified, Tag-Based Security Monitors☆20Sep 23, 2019Updated 6 years ago
- First-order automated theorem prover based on the tableau method☆19Jul 8, 2026Updated last month
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated 2 years ago
- Tic Tac Toe, formalized in Agda☆25Oct 19, 2021Updated 4 years ago
- Martin-Löf type theory + W-types implemented in C (WIP)☆28Feb 16, 2026Updated 6 months ago
- A modified version of Brent Yorgey's CIS 194 Haskell course☆17Jun 15, 2020Updated 6 years ago
- pyndl implements a Naive discriminative learning which is a learning and classification models based on the Rescorla-Wagner equations in …☆13Dec 8, 2025Updated 8 months ago