jsiek / B629-denotationalLinks
Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
☆73Updated 7 years ago
Alternatives and similar repositories for B629-denotational
Users that are interested in B629-denotational are comparing it to the libraries listed below
Sorting:
- Unification and type inference algorithms☆125Updated 10 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- ☆84Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- being the materials for Summer 2013's course☆113Updated 2 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
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- xmonad in Coq☆46Updated 13 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 4 months ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Where my everyday research happens☆55Updated 3 months ago
- Summer school on programming in Agda☆68Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago