JohnReppy / compiling-pattern-guardsLinks
Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
☆25Updated 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 bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 11 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Updated 10 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years 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
- MetaML and MetaOCaml bibliography☆93Updated 8 months ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- ☆26Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Experiments with sequent calculi☆27Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 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 Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago