plum-umd / abstracting-definitional-interpretersLinks
Abstracting Definitional Interpreters
☆69Updated 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:
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- higher order dependently typed logic programing☆174Updated 7 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆154Updated last week
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- ☆60Updated 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
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- xmonad in Coq☆46Updated 13 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- ☆84Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- A less devious proof assistant☆225Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year