Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
☆26Jan 14, 2019Updated 7 years ago
Alternatives and similar repositories for popl19-tutorial
Users that are interested in popl19-tutorial are comparing it to the libraries listed below
Sorting:
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Experiments with modal types☆17Oct 20, 2020Updated 5 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago
- proof script associated to tutorial material☆17Oct 29, 2023Updated 2 years ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- Dafny for Metatheory of Programming Languages☆29Feb 6, 2026Updated last month
- Coq proofs for the paper "Calculating Correct Compilers"☆31Dec 11, 2023Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- Verimag Polyhedra Library☆19Apr 11, 2025Updated 10 months ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018☆23May 9, 2018Updated 7 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 17, 2026Updated 2 weeks ago
- Formalizing convex polyhedra in Coq☆24Jul 8, 2024Updated last year
- Logical relations proof in Agda☆27May 27, 2015Updated 10 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
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Dec 19, 2023Updated 2 years ago
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆14Feb 15, 2025Updated last year
- System FR: Formalized Foundations for Stainless☆12Feb 2, 2026Updated last month
- An automated theorem prover for intuitionistic propostional logic☆14Sep 21, 2020Updated 5 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10May 31, 2022Updated 3 years ago
- Code for the "Logic, machines and sequent calculus" talk☆31Sep 7, 2022Updated 3 years ago
- 🦠 Reusable components based on algebraic effects☆52Nov 21, 2025Updated 3 months ago
- Accepted papers for ICFP 2014☆119May 19, 2016Updated 9 years ago
- Certified Machine Learning☆41Mar 10, 2021Updated 4 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- Interactive Theorem Proving course using HOL4☆12Jun 21, 2023Updated 2 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆15Oct 28, 2021Updated 4 years ago
- ☆10Jan 11, 2017Updated 9 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Partial Commutative Monoids☆32Feb 18, 2026Updated 2 weeks ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- An interval library for OCaml☆16Dec 9, 2022Updated 3 years ago
- Multinomials for the Mathematical Components library.☆16Updated this week
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- 🎲 A Kotlin DSL for probabilistic programming.☆12Apr 8, 2022Updated 3 years ago