teach-plt / plt-errataLinks
Collection of errata for book Aarne Ranta, Implementing Programming Languages
☆12Updated last month
Alternatives and similar repositories for plt-errata
Users that are interested in plt-errata are comparing it to the libraries listed below
Sorting:
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆114Updated last week
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆66Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 2 weeks ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆48Updated 7 months ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- ☆36Updated 3 years ago
- Hoare Type Theory☆75Updated last month
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 6 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Notes and handouts from OPLSS 2019☆34Updated 5 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- being an operating system for typechecking processes☆126Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 7 months ago
- ☆84Updated 7 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago