jsiek / B522-PL-FoundationsLinks
Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
☆55Updated 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☆59Updated last month
- Denotational semantics based on graph and filter models☆23Updated last year
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- ☆56Updated last week
- Constructive Galois connections☆36Updated 7 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated last week
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 5 months ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- ☆38Updated 4 years ago
- Convert Haskell source code to Coq source code.☆93Updated 7 months ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Updated 4 years ago
- Educational Proof Assistant for Type Theory☆80Updated 3 weeks ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 7 years ago
- A monadic library for symbolic evaluation☆73Updated 6 months ago
- The Penn Locally Nameless Metatheory Library☆75Updated 10 months ago
- Relation algebra library for Coq☆50Updated 2 weeks ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- A very little language☆16Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year