david-christiansen / pie-hsView external linksLinks
An implementation of Pie in Haskell
☆211Nov 8, 2019Updated 6 years ago
Alternatives and similar repositories for pie-hs
Users that are interested in pie-hs are comparing it to the libraries listed below
Sorting:
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- The Pie language, which accompanies The Little Typer by Friedman and Christiansen☆738Jul 7, 2021Updated 4 years ago
- Demo for high-performance type theory elaboration☆580Feb 2, 2026Updated 2 weeks ago
- A dependently typed programming language, a successor to Idris☆900Aug 11, 2020Updated 5 years ago
- A demo implementation of a simple dependently-typed language☆617Nov 18, 2024Updated last year
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,059Jun 13, 2025Updated 8 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- A reference library for constraint-solving with propagators and CDCL.☆308Jul 2, 2024Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- Functional programming with fewer indirections☆778Aug 20, 2020Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- Examples of Dependently-typed programs in Haskell☆308Oct 18, 2022Updated 3 years ago
- An introductory course to Homotopy Type Theory☆376Jul 24, 2020Updated 5 years ago
- A TACtic library for Agda☆51Sep 14, 2024Updated last year
- Dependent type checker using normalisation by evaluation☆273Sep 5, 2024Updated last year
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Normalization by Evaluation for Embedded Domain-specific Languages☆31Oct 31, 2024Updated last year
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆389Oct 23, 2023Updated 2 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Feb 22, 2022Updated 3 years ago
- Higher-kinded data via generics☆170Aug 20, 2024Updated last year
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- UI experiments for coda☆66Sep 23, 2021Updated 4 years ago
- A prototype successor to Idris☆541Jul 8, 2019Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Jul 23, 2013Updated 12 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Mar 8, 2021Updated 4 years ago
- mirror of A simple type-theoretic language: Mini-TT☆41Feb 15, 2017Updated 9 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆700Jan 14, 2026Updated last month
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- OCaml backend for Idris2☆20Oct 12, 2020Updated 5 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- Minimal implementations for dependent type checking and elaboration☆762Jan 30, 2026Updated 2 weeks ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago