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 the beginnings of at least zero typecheckers☆34Updated 8 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
- A tool for formally verifying Haskell code in Agda☆28Updated 8 years ago
- Web based opetopic editor☆35Updated 11 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- ☆45Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- Formalisation of Goedel's System T in Coq☆15Updated 14 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- ☆31Updated 11 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago