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
Sorting:
- 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
- Web based opetopic editor☆35Updated 6 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- Work in progress☆34Updated 5 months ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Ring solver for Idris☆20Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Constructive Galois connections☆32Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆82Updated last year
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated 3 weeks ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Observational Type Theory as an Agda library☆53Updated 7 years ago
- My Agda experiments☆12Updated 5 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- ☆45Updated 5 years ago