jsiek / B522-PL-FoundationsView external linksLinks
Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
☆55May 28, 2020Updated 5 years ago
Alternatives and similar repositories for B522-PL-Foundations
Users that are interested in B522-PL-Foundations are comparing it to the libraries listed below
Sorting:
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74May 7, 2018Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 5 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Dec 18, 2025Updated last month
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- https://metaborg.github.io/mj.agda/☆13Oct 14, 2020Updated 5 years ago
- Awesome Agda Programming☆18Sep 22, 2025Updated 4 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Apr 22, 2025Updated 9 months ago
- ☆17Jun 10, 2022Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Mar 17, 2025Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74May 10, 2019Updated 6 years ago
- being the materials for Summer 2013's course☆113Apr 25, 2023Updated 2 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Dec 29, 2023Updated 2 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Sep 2, 2023Updated 2 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- My final year project at the University of Strathclyde☆13Jan 26, 2023Updated 3 years ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- The mathematical study of type theories, in univalent foundations☆118Feb 15, 2025Updated 11 months ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Nov 20, 2025Updated 2 months ago
- Linear Logic for Constructive Mathematics, in Agda☆18Jul 7, 2019Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Lecture notes on realizability☆75Feb 21, 2025Updated 11 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- A library for formalizing Haskell types and functions in Coq☆171Oct 15, 2023Updated 2 years ago
- Mechanized baselines for various type system features☆18Dec 6, 2025Updated 2 months ago
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆14Feb 15, 2025Updated 11 months ago
- An automated theorem prover for intuitionistic propostional logic☆14Sep 21, 2020Updated 5 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Feb 22, 2022Updated 3 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 2 months ago