Notes and handouts from OPLSS 2019
☆35Jun 28, 2019Updated 6 years ago
Alternatives and similar repositories for oplss-notes-2019
Users that are interested in oplss-notes-2019 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆17Oct 16, 2018Updated 7 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Materials for OPLSS 2021☆11Jun 1, 2021Updated 4 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- Haskell implementation of open games☆13Apr 20, 2016Updated 9 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Jul 23, 2018Updated 7 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Mar 16, 2026Updated last week
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- This is the compiler for the Feldspar Language.☆23Jun 25, 2020Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- 🎲 A Kotlin DSL for probabilistic programming.☆12Apr 8, 2022Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- Certified Machine Learning☆41Mar 10, 2021Updated 5 years ago
- A graduate seminar on SMT solving and solver-aided systems☆29Jul 17, 2022Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- A Haskell parser for JVM bytecode files☆39Jan 12, 2024Updated 2 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- A mechanized proof of type safety for Featherweight Java using Coq☆16Aug 4, 2018Updated 7 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆76Mar 26, 2025Updated 11 months ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Tool for inferring cache replacement policies with automata learning. Uses LearnLib and Sketch.☆16Apr 21, 2020Updated 5 years ago
- proof script associated to tutorial material☆17Oct 29, 2023Updated 2 years ago
- ☆11Nov 27, 2024Updated last year
- Identifying similar OCaml codes☆30Jul 30, 2024Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆33Mar 16, 2021Updated 5 years ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated last month
- Awesome Agda Programming☆19Sep 22, 2025Updated 6 months ago
- A tool for checking the contract satisfaction for hardware designs☆12Nov 4, 2025Updated 4 months ago
- Coq formalizations and proofs of (data) structures and algorithms.☆48May 13, 2018Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- ☆59Jan 30, 2014Updated 12 years ago
- Coq code formatter☆24Jan 22, 2026Updated 2 months ago
- A list of companies in Schleswig-Holstein and Hamburg, that use functional programming☆12Mar 31, 2021Updated 4 years ago