jsiek / B522-PL-Foundations
Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
☆53Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for B522-PL-Foundations
- Formalizations of Gradually Typed Languages in Agda☆54Updated last month
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆34Updated 4 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated 2 months ago
- ☆51Updated last month
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆50Updated last month
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 9 months ago
- Relation algebra library for Coq☆48Updated last week
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆56Updated 3 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated last week
- A compiler for the gradually typed lambda calculus☆76Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- ☆35Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆29Updated last year
- A (formalised) general definition of type theories☆56Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A proof of Abel-Ruffini theorem.☆28Updated this week
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Monadic effects and equational reasonig in Coq☆68Updated 3 weeks ago
- Constructive Galois connections☆32Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated last month