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:
- second-order abstract syntax☆31Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A tool for formally verifying Haskell code in Agda☆28Updated 9 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆36Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Web based opetopic editor☆36Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Formalization of Linear Logic☆11Updated 8 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Formalisation of Goedel's System T in Coq☆15Updated 14 years ago
- Where my everyday research happens☆55Updated this week
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Updated 10 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago