OPLSS / oplss-notes-2017
handouts and notes from the 2017 edition of the summer school
☆39Updated 7 years ago
Alternatives and similar repositories for oplss-notes-2017:
Users that are interested in oplss-notes-2017 are comparing it to the libraries listed below
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Work in progress☆34Updated 2 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- being the materials for Summer 2013's course☆112Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆79Updated 4 years ago
- Category theory and algebra☆28Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆27Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Constructive Galois connections☆32Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- System F in coq.☆19Updated 10 years ago