LightAndLight / meta-lambdaLinks
Lambda Calculus with quote and unquote
☆19Updated 5 years ago
Alternatives and similar repositories for meta-lambda
Users that are interested in meta-lambda are comparing it to the libraries listed below
Sorting:
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Idris, but it's C☆24Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 11 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- Classical Logic in Haskell☆24Updated 6 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Zippers for cofree types☆13Updated 3 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆21Updated last month
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago