jsiek / B522-PL-FoundationsLinks
Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
☆53Updated 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:
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- Denotational semantics based on graph and filter models☆23Updated 7 months ago
- Gallina to Bedrock2 compilation toolkit☆58Updated 3 weeks ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A cost-aware logical framework, embedded in Agda.☆64Updated last week
- ☆55Updated 4 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 6 months ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Course on Metaprogramming☆72Updated last month
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 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
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Constructive Galois connections☆34Updated 7 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Abstracting Definitional Interpreters☆68Updated 7 years ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- HoTT in Lean 3☆80Updated 5 years ago
- A very little language☆16Updated 2 years ago
- The Iowa Agda Library☆48Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago