plum-umd / abstracting-definitional-interpretersLinks
Abstracting Definitional Interpreters
☆68Updated 7 years ago
Alternatives and similar repositories for abstracting-definitional-interpreters
Users that are interested in abstracting-definitional-interpreters are comparing it to the libraries listed below
Sorting:
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- xmonad in Coq☆46Updated 12 years ago
- ☆60Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- ☆55Updated last month
- Summer school on programming in Agda☆68Updated last year
- higher order dependently typed logic programing☆171Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last week
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A blog about Coq☆46Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A pure Haskell implementation of Datalog☆105Updated 4 years ago