jsiek / B522-PL-Foundations
Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
☆53Updated 4 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
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 7 years ago
- Gallina to Bedrock2 compilation toolkit☆53Updated this week
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 3 months ago
- Denotational semantics based on graph and filter models☆23Updated 4 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- ☆55Updated last month
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 3 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Deadlock freedom by type checking☆20Updated last year
- A verified compiler for a lazy functional language☆35Updated last week
- Logical Relation for MLTT in Coq☆24Updated 2 weeks ago
- ModTT in Agda☆11Updated 3 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- Relation algebra library for Coq☆48Updated last month
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 8 years ago
- A cost-aware logical framework, embedded in Agda.☆61Updated 8 months ago
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- Coq library for serialization to S-expressions☆19Updated last year
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆35Updated last week
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 9 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago