plum-umd / abstracting-definitional-interpretersLinks
Abstracting Definitional Interpreters
☆73Updated 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:
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 4 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- An interactive theorem prover based on lambda-tree syntax☆97Updated last month
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- ☆62Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆154Updated last week
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Lecture material for DeepSpec Summer School 2018☆67Updated 6 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated this week
- 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
- higher order dependently typed logic programing☆173Updated 7 years ago
- ☆56Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- xmonad in Coq☆46Updated 13 years ago
- Miller/pattern unification in Agda☆67Updated last month
- Emacs support for F*☆70Updated 5 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Coq formalizations of functional languages.☆146Updated 5 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- ☆84Updated 8 years ago