Elsa is a lambda calculus evaluator
☆194Oct 5, 2025Updated last year
Alternatives and similar repositories for elsa
Users that are interested in elsa are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Jun 3, 2022Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆50Jun 22, 2021Updated 5 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 8 years ago
- A simple way to query constructors, like cases but slightly more concise☆11Mar 7, 2018Updated 8 years ago
- Dependently typed elimination functions using singletons☆27Jan 11, 2026Updated 9 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 4 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 9 years ago
- Inspection Testing for Haskell☆192Jan 17, 2026Updated 9 months ago
- Generic Programming using True Sums of Products☆167Jan 7, 2026Updated 9 months ago
- A Pandoc filter that identifies Haskell code in Markdown, executes the code in GHCI and embeds the results in the returned Markdown.☆14Jul 11, 2019Updated 7 years ago
- Tools for functors from Hask^k to Hask☆23Aug 25, 2019Updated 7 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Kleene algebra, regular expressions☆34May 12, 2026Updated 5 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 8 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Haskell implementation of the Edinburgh Logical Framework☆34Jan 12, 2026Updated 9 months ago
- A package exposing a function for generating catamorphisms.☆29Apr 15, 2018Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 6 years ago
- A small implementation of higher-order unification☆198Aug 6, 2017Updated 9 years ago
- Let GHC prove program equations for you☆145Nov 4, 2018Updated 8 years ago
- Demystifying the magic of supertactics☆13Nov 2, 2021Updated 5 years ago
- Haskell tool to generate expressions from types☆102Aug 1, 2017Updated 9 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- An alternate definition of Haskell's Functor typeclass☆42Jun 18, 2019Updated 7 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆45Nov 28, 2018Updated 7 years ago
- PostgreSQL support for the drifter schema migration tool☆12Dec 25, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 9 years ago
- Hopefully verifiable code generation in GHC☆94May 10, 2017Updated 9 years ago
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆21Dec 13, 2017Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 4 years ago
- A bad XML parser☆23Sep 2, 2024Updated 2 years ago
- a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features☆119Sep 12, 2018Updated 8 years ago
- A compiler for a strongly typed, haskell-like functional language☆22Feb 1, 2018Updated 8 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.
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Compositional type checking for Haskell☆39Apr 14, 2011Updated 15 years ago
- Diffing of (expression) trees.☆80Jun 17, 2026Updated 4 months ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Jun 9, 2024Updated 2 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- Authenticated Data Structures☆16Jul 5, 2015Updated 11 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆377May 14, 2023Updated 3 years ago