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☆22Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 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 tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- ☆26Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 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
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago