slovnicki / pLamView external linksLinks
An interpreter for learning and exploring pure λ-calculus
☆467Apr 11, 2021Updated 4 years ago
Alternatives and similar repositories for pLam
Users that are interested in pLam are comparing it to the libraries listed below
Sorting:
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,059Jun 13, 2025Updated 8 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆700Jan 14, 2026Updated last month
- tools for writing better type errors☆73Sep 15, 2023Updated 2 years ago
- A small and expressive dependently typed language☆130Jun 29, 2020Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- A continuation of Stephen Diehl's Write You a Haskell☆162Nov 29, 2020Updated 5 years ago
- An introductory course to Homotopy Type Theory☆376Jul 24, 2020Updated 5 years ago
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- A dependently typed programming language, a successor to Idris☆900Aug 11, 2020Updated 5 years ago
- An introduction to programming language theory in Agda☆1,487Jan 27, 2026Updated 2 weeks ago
- Functional programming with fewer indirections☆778Aug 20, 2020Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 6 years ago
- Dynamic typing in Haskell☆190May 29, 2019Updated 6 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆389Oct 23, 2023Updated 2 years ago
- An implementation of Pie in Haskell☆211Nov 8, 2019Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Jan 18, 2020Updated 6 years ago
- higher-order, no-boilerplate monads☆1,076Mar 15, 2025Updated 11 months ago
- Fake dependent types in Haskell using singletons☆293Jan 11, 2026Updated last month
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆265Feb 8, 2026Updated last week
- Total Parser Combinators in Agda☆133Aug 5, 2025Updated 6 months ago
- Higher-kinded data via generics☆170Aug 20, 2024Updated last year
- Efficient implementation of the implicit treap data structure☆63Aug 2, 2021Updated 4 years ago
- A data-parallel functional programming language☆2,669Updated this week
- Optics as an abstract interface☆387Updated this week
- Dependent type checker using normalisation by evaluation☆273Sep 5, 2024Updated last year
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- Dynamically-typed Haskell expressions involving applications and variables.☆22Jan 30, 2025Updated last year
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Mar 21, 2021Updated 4 years ago
- Demo for high-performance type theory elaboration☆580Feb 2, 2026Updated last week
- Agda is a dependently typed programming language / interactive theorem prover.☆2,788Updated this week
- Compile PureScript into Haskell.☆68Nov 29, 2017Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Programming language agnostic type construction language based on polynomials.☆369May 29, 2024Updated last year
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Jul 11, 2021Updated 4 years ago