JohnReppy / compiling-pattern-guards
Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
☆25Updated 2 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
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 3 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆47Updated 10 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- ☆26Updated 8 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 2 weeks ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- MLpolyR☆7Updated 8 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- ☆12Updated 3 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆16Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- ☆29Updated 9 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago