pa-ba / reg-machineLinks
Coq & Haskell code for Calculating Correct Compilers II
☆12Updated 3 years ago
Alternatives and similar repositories for reg-machine
Users that are interested in reg-machine are comparing it to the libraries listed below
Sorting:
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- ☆26Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".☆29Updated 3 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
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Deciding Presburger arithmetic in agda☆33Updated 2 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
- ☆12Updated 10 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago