LaifsV1 / YUPLinks
YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and equational reasoning.
☆36Updated 2 years ago
Alternatives and similar repositories for YUP
Users that are interested in YUP are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Web based opetopic editor☆35Updated 8 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- ☆22Updated 9 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆19Updated 11 months ago
- Constructive Galois connections☆32Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Mtac in Agda☆28Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Research middleware compiler from System F-based languages to Java with the Imperative Functional Object encoding☆45Updated 9 years ago