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
- 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
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Work in progress☆34Updated 4 months ago
- Logical relations proof in Agda☆26Updated 9 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
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Web based opetopic editor☆35Updated 5 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Where my everyday research happens☆52Updated 3 weeks ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- ☆19Updated 7 months ago
- System F in coq.☆19Updated 10 years ago
- Formalization of Linear Logic☆10Updated 7 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- ☆45Updated 5 years ago
- A tool for formally verifying Haskell code in Agda☆28Updated 8 years ago