plum-umd / abstracting-definitional-interpreters
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
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- ☆60Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆94Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- MetaML and MetaOCaml bibliography☆89Updated 5 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 3 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- A TACtic library for Agda☆48Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆146Updated 3 years ago
- Summer school on programming in Agda☆68Updated last year
- The Ynot Project source code.☆22Updated 11 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months 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
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- higher order dependently typed logic programing☆171Updated 6 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Model finder for higher-order logic☆44Updated last year
- A "implementation" of Girard's paradox in OCaml☆107Updated 10 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Gallina to Bedrock2 compilation toolkit☆53Updated 3 weeks ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago