Alternatives and similar repositories for reg-machine

Users that are interested in reg-machine are comparing it to the libraries listed below

• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 7 months ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 5 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆23Updated 9 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆14Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated last month
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 3 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 4 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated last year
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 6 months ago
• poitin / Distiller
  Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".
  ☆29Updated 3 years ago
• palladin / idris-snippets
  Collection of Idris snippets
  ☆23Updated last year
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• nikivazou / theorem-proving-template
  Template repo for theorem proving in Liquid Haskell
  ☆32Updated 7 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year