Notes and handouts from OPLSS 2018
☆55Jul 23, 2018Updated 7 years ago
Alternatives and similar repositories for oplss-notes-2018
Users that are interested in oplss-notes-2018 are comparing it to the libraries listed below
Sorting:
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Notes and handouts from OPLSS 2019☆35Jun 28, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A collection of mechanised proofs☆19Feb 4, 2020Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Oct 21, 2024Updated last year
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- ☆48Jul 5, 2019Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Feb 19, 2026Updated last week
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- A Haskell implementation of the tiger compiler☆10May 2, 2020Updated 5 years ago
- ☆12May 22, 2016Updated 9 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- A collection of Notes on GHC☆71Apr 14, 2019Updated 6 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆115Jan 12, 2026Updated last month
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Example code demonstrating how SML modules, in particular functors, can be used for structuring a web framework.☆14Feb 26, 2014Updated 12 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 17, 2026Updated 2 weeks ago
- A practical application launcher for impractical people☆12Dec 21, 2023Updated 2 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Compiler for IMP programming language implemented in Haskell☆16Jun 16, 2020Updated 5 years ago
- A Pandoc filter that identifies Haskell code in Markdown, executes the code in GHCI and embeds the results in the returned Markdown.☆14Jul 11, 2019Updated 6 years ago
- Introduction to algebraic effects and handlers☆100Jul 21, 2018Updated 7 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 8 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- User Interfaces for Programming Languages: The Compendium☆28Feb 14, 2021Updated 5 years ago