Elsa is a lambda calculus evaluator
☆194Oct 5, 2025Updated 5 months ago
Alternatives and similar repositories for elsa
Users that are interested in elsa are comparing it to the libraries listed below
Sorting:
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Tools for functors from Hask^k to Hask☆23Aug 25, 2019Updated 6 years ago
- Inspection Testing for Haskell☆190Jan 17, 2026Updated last month
- ☆17Oct 16, 2018Updated 7 years ago
- A package exposing a function for generating catamorphisms.☆29Apr 15, 2018Updated 7 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Authenticated Data Structures☆16Jul 5, 2015Updated 10 years ago
- An alternate definition of Haskell's Functor typeclass☆42Jun 18, 2019Updated 6 years ago
- Let GHC prove program equations for you☆146Nov 4, 2018Updated 7 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- This project is dead. See https://gitlab.com/k0001/moto for its reincarnation.☆17Apr 19, 2019Updated 6 years ago
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago
- A bad XML parser☆22Sep 2, 2024Updated last year
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Jun 22, 2021Updated 4 years ago
- Hopefully verifiable code generation in GHC☆94May 10, 2017Updated 8 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Fast Haskell XML parser☆124Jul 16, 2023Updated 2 years ago
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Sep 1, 2025Updated 6 months ago
- Some tools for provability logic☆37Apr 16, 2018Updated 7 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Mar 8, 2021Updated 5 years ago
- Generate Haskell code from a type☆146Feb 21, 2025Updated last year
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆21Dec 13, 2017Updated 8 years ago
- Reasonable Haskell default import☆27Sep 12, 2022Updated 3 years ago
- Type-level assertion operators☆16Mar 20, 2018Updated 7 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Jan 11, 2018Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Jan 23, 2026Updated last month
- Decision procedures for Presburger arithmetic in Haskell☆30Mar 29, 2025Updated 11 months ago
- Kleene algebra, regular expressions☆33Nov 18, 2023Updated 2 years ago