euisuny / best-of-poplView external linksLinks
Best of POPL (BOP) Reading Group Memoirs
☆67Jan 27, 2022Updated 4 years ago
Alternatives and similar repositories for best-of-popl
Users that are interested in best-of-popl are comparing it to the libraries listed below
Sorting:
- Mechanized baselines for various type system features☆18Dec 6, 2025Updated 2 months ago
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- Staged Abstract Interpreters☆69Mar 13, 2023Updated 2 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Sep 23, 2025Updated 4 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 4 months ago
- A Collection of Papers & Notes in Programming Language & Formal Verification☆17May 10, 2022Updated 3 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Feb 8, 2026Updated last week
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Mar 9, 2025Updated 11 months ago
- ☆14Nov 23, 2016Updated 9 years ago
- Stronger types for a few Typed Racket operators☆11Jan 25, 2024Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- LFSC Proof Checker☆11Sep 14, 2023Updated 2 years ago
- Playing with incremental parsing and later compiler passes☆12Dec 12, 2018Updated 7 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 5 months ago
- Benchmark repository of polyglot effect handler examples☆34Aug 21, 2025Updated 5 months ago
- Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine☆29Feb 18, 2021Updated 4 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- ☆17Oct 31, 2025Updated 3 months ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Session Type EDSL for Rust☆103Jun 29, 2022Updated 3 years ago
- SPLV20 course notes☆115Nov 19, 2022Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated last year
- Logical Relation for MLTT in Coq☆29Jan 14, 2026Updated last month
- Refinement types + dependent types = ❤️☆62Aug 8, 2022Updated 3 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆41Apr 14, 2021Updated 4 years ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55May 28, 2020Updated 5 years ago
- Gallina to Bedrock2 compilation toolkit☆65Feb 3, 2026Updated 2 weeks ago
- antifunext☆38Jun 27, 2024Updated last year
- ☆12Jul 1, 2025Updated 7 months ago
- A cost-aware logical framework, embedded in Agda.☆75Nov 7, 2025Updated 3 months ago
- print information from LLVM dataflow analyses☆13Jan 22, 2020Updated 6 years ago
- A Probability Theory Library for the Coq Theorem Prover☆54Oct 6, 2023Updated 2 years ago