λλλλ Lennart Augustsson's λ-calculus cooked four ways
☆29Jul 22, 2021Updated 4 years ago
Alternatives and similar repositories for lennart-lambda
Users that are interested in lennart-lambda are comparing it to the libraries listed below
Sorting:
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 5 months ago
- A categorical semantics library in Agda.☆16Dec 22, 2019Updated 6 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Mar 21, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 3 months ago
- A simple functional programming language.☆22Jun 3, 2021Updated 4 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- rewrite rules for type-level equalities☆62Aug 29, 2025Updated 6 months ago
- Omit fields for instance deriving☆37Jun 5, 2020Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Prettyprinting transformers for rainbow parens, precedence, etc.☆16Feb 27, 2022Updated 4 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- A framework for implementing and certifying impure computations in Coq☆53Jan 16, 2024Updated 2 years ago
- ScopeT and ScopeH☆13Aug 3, 2024Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Cur dependently-typed language in miniKanren.☆17Jan 26, 2018Updated 8 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Feb 5, 2025Updated last year
- CS316 "Functional Programming" lecture notes☆22Jan 29, 2026Updated last month
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Generalized syntax & semantics for universe hierarchies☆32Dec 11, 2023Updated 2 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 3 months ago
- Staged Streams and other stuff☆19Jul 10, 2022Updated 3 years ago
- ☆18Mar 24, 2021Updated 4 years ago
- being a slightly rethought version of the Frank implementation☆23Feb 9, 2016Updated 10 years ago
- a self-hosting lambda calculus compiler☆37Mar 31, 2025Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago