Kraks / MyPLZooView external linksLinks
Implementations of various toy programming languages
☆12Apr 19, 2018Updated 7 years ago
Alternatives and similar repositories for MyPLZoo
Users that are interested in MyPLZoo are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- Object Algebra Composition☆24Jul 4, 2013Updated 12 years ago
- Talking about classical logic and abstract algebra in Haskell☆16Feb 12, 2021Updated 5 years ago
- ☆18Nov 23, 2021Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- An abstract machine for analyzing Racket bytecode.☆29May 1, 2021Updated 4 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Aug 7, 2012Updated 13 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Sep 27, 2021Updated 4 years ago
- Complexity analysis in Lean☆10Feb 5, 2024Updated 2 years ago
- Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine☆29Feb 18, 2021Updated 4 years ago
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Logical Relation for MLTT in Coq☆29Jan 14, 2026Updated last month
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Faceted execution in Racket☆11Sep 11, 2018Updated 7 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Exploring Automatic Differentiation with Racket☆12Jan 9, 2022Updated 4 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 4 months ago
- An automated theorem prover for intuitionistic propostional logic☆14Sep 21, 2020Updated 5 years ago
- Experiments with modal types☆17Oct 20, 2020Updated 5 years ago
- Yet another Scheme interpreter.☆11Sep 17, 2022Updated 3 years ago
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆23Mar 30, 2011Updated 14 years ago
- TypeScript client for Idris IDE-mode.☆13Nov 6, 2022Updated 3 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- an implementation of Observational Type Theory (OTT) and more☆30Oct 15, 2022Updated 3 years ago
- Playing with incremental parsing and later compiler passes☆12Dec 12, 2018Updated 7 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Category Theory in Programming☆13Jan 22, 2026Updated 3 weeks ago
- Effectful Streaming for Idris☆15Dec 13, 2020Updated 5 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- Documented version of a simple type-theoretic language: Mini-TT☆18May 5, 2019Updated 6 years ago
- Relational implementation of the CESK machine☆21Jul 15, 2013Updated 12 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago