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
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Idris, but it's C☆24Updated 7 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆36Updated last year
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Quantitative Type Theory implementation☆54Updated 4 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 6 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Classical Logic in Haskell☆24Updated last month
- Dependently typed elimination functions using singletons☆28Updated last year
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- System F implemented in Haskell☆24Updated 13 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
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Zippers for cofree types☆13Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago