jsiek / B629-denotationalLinks
Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
☆74Updated 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☆127Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- ☆85Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- 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
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- Where my everyday research happens☆55Updated this week
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- xmonad in Coq☆46Updated 13 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- Abstracting Definitional Interpreters☆74Updated 8 years ago