Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
☆25Jul 26, 2022Updated 3 years ago
Alternatives and similar repositories for compiling-pattern-guards
Users that are interested in compiling-pattern-guards are comparing it to the libraries listed below
Sorting:
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 3 months ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆32Dec 11, 2023Updated 2 years ago
- SML reference interpreter☆122Oct 17, 2025Updated 5 months ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Oct 14, 2019Updated 6 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- A Teeny Type Theory☆27Jun 4, 2022Updated 3 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- ☆28Jun 18, 2020Updated 5 years ago
- Erlang BEAM emulator in Haskell☆48Jun 14, 2014Updated 11 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- ☆15Jun 11, 2015Updated 10 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- ☆12May 9, 2015Updated 10 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- An interpreter of F-ing modules☆19Jun 21, 2019Updated 6 years ago
- Cohesive type theory☆19Dec 6, 2021Updated 4 years ago
- Notes and handouts from OPLSS 2019☆35Jun 28, 2019Updated 6 years ago
- Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".☆30Apr 11, 2022Updated 3 years ago