plum-umd / abstracting-definitional-interpretersLinks
Abstracting Definitional Interpreters
☆74Updated 8 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☆86Updated 7 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- ☆62Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- xmonad in Coq☆46Updated 13 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆157Updated last month
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- ☆85Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago