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 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- ☆60Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- xmonad in Coq☆46Updated 13 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Examples from the class CMSC 330 during Summer 2015☆48Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A library for effects in Coq.☆66Updated 3 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆147Updated 3 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆153Updated 2 weeks ago
- higher order dependently typed logic programing☆173Updated 6 years ago
- ☆84Updated 7 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆59Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Constructive Galois connections☆32Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago