thma / lambda-ski
Implementing a small functional language with a combinator based graph-reduction machine
☆29Updated last year
Alternatives and similar repositories for lambda-ski:
Users that are interested in lambda-ski are comparing it to the libraries listed below
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- Session types framework with support of protocol pipelining.☆16Updated 3 weeks ago
- Existential type.☆37Updated 3 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated 2 weeks ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- ☆25Updated 2 years ago
- Session Types with Priority in Linear Haskell☆26Updated 9 months ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 2 months ago
- Reimplementation of a subset of Cabal☆26Updated 3 weeks ago
- Generic functions for single-sorted first-order structural unification☆42Updated last month
- ☆26Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 7 months ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- ☆12Updated 4 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- ☆20Updated last week
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 8 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Bidirectional Parsing. Work in Progress☆32Updated 6 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 weeks ago
- A compiler that translates a form of lambda calculus to C☆12Updated 11 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- being a particular fragment of Haskell, extended to a proof system☆30Updated last month
- ☆40Updated 5 years ago