LaifsV1 / YUPView external linksLinks
YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and equational reasoning.
☆36Feb 14, 2023Updated 3 years ago
Alternatives and similar repositories for YUP
Users that are interested in YUP are comparing it to the libraries listed below
Sorting:
- Typed DSLs for sorting☆20Feb 16, 2018Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Haskell pretty printing library supporting indentation, mixfix operators, and automatic line breaks.☆14Jan 26, 2017Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- TODO☆23Oct 10, 2015Updated 10 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- The prelude.☆16Apr 3, 2019Updated 6 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- A tool for formally verifying Haskell code in Agda☆28Oct 25, 2016Updated 9 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- On-line accumulation of rank-based statistics such as quantiles and trimmed means☆31Jul 3, 2024Updated last year
- A general build tool for haskell projects inspired by leiningen☆16Jun 6, 2015Updated 10 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- The missing tutorial module for the lens library☆83May 11, 2024Updated last year
- A slack bot that will fetch type signatures via Hoogle☆21May 11, 2016Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- A bad XML parser☆22Sep 2, 2024Updated last year
- A hack to find types in Haskell codebases☆10Aug 15, 2015Updated 10 years ago
- ☆12May 9, 2015Updated 10 years ago
- A raytracer written in Haskell☆10Aug 26, 2015Updated 10 years ago
- A RWS like monad without the slow writer stuff☆12Jun 17, 2023Updated 2 years ago
- ☆15Feb 10, 2015Updated 11 years ago
- ☆12May 22, 2016Updated 9 years ago
- Formalization of Linear Logic☆11Jun 25, 2017Updated 8 years ago
- Unital Charts☆27Feb 17, 2020Updated 5 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Model finder for higher-order logic☆50Dec 7, 2025Updated 2 months ago
- Agda programming with holes☆28Feb 2, 2021Updated 5 years ago