LaifsV1 / YUP
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
- Logical relations proof in Agda☆26Updated 9 years ago
- Work in progress☆34Updated 4 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Web based opetopic editor☆35Updated 6 months ago
- Formalisation of Goedel's System T in Coq☆15Updated 13 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated this week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A tool for formally verifying Haskell code in Agda☆28Updated 8 years ago
- Constructive Galois connections☆32Updated 7 years ago
- ☆19Updated 8 months ago
- Cryptographic Constructions in the Type Theory of Agda☆52Updated 9 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago