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
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- 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
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- xmonad in Coq☆46Updated 13 years ago
- ☆84Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Constructive Galois connections☆35Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆54Updated 5 years ago
- SPJ's tutorial on implementing functional languages☆29Updated 6 years ago
- Abstracting Definitional Interpreters☆69Updated 7 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago