gergoerdi / syntactic-stlcView external linksLinks
Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
☆13Nov 19, 2017Updated 8 years ago
Alternatives and similar repositories for syntactic-stlc
Users that are interested in syntactic-stlc are comparing it to the libraries listed below
Sorting:
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Terminal based virtual piano in Haskell, with ncurses and Euterpea☆17Nov 14, 2017Updated 8 years ago
- ICFP Bingo 2017 (Idris edition)☆30Aug 22, 2019Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Folds for recursive types with GHC Generics☆28Aug 9, 2025Updated 6 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Term Rewriting Systems☆17Nov 7, 2015Updated 10 years ago
- Typesafe Off-Heap data structures for GHC Haskell☆14Nov 10, 2017Updated 8 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Dec 29, 2023Updated 2 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Church-encoding of the Freer monad☆28Oct 27, 2016Updated 9 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Haskell implementation of interaction net-based lambda evaluation☆21Jun 24, 2016Updated 9 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- Experiments in implementing functional data structures in Idris☆15Jul 25, 2019Updated 6 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Writeup that goes along with this:☆16Apr 19, 2018Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 10 months ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- The Prettiest Printer☆35Feb 14, 2024Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- A port of the gloss library from Haskell to Idris☆23Jul 9, 2018Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago