jespercockx / popl19-tutorialLinks
Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
☆26Updated 6 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 library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- ☆18Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Quasi-quoting library for agda☆18Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- ☆14Updated 9 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆17Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago