nikivazou / theorem-proving-templateView external linksLinks
Template repo for theorem proving in Liquid Haskell
☆32Sep 19, 2018Updated 7 years ago
Alternatives and similar repositories for theorem-proving-template
Users that are interested in theorem-proving-template are comparing it to the libraries listed below
Sorting:
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- LaTeX style file to typeset functional languages like Haskell☆26Mar 25, 2013Updated 12 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- SPAKE2 key exchange protocol for Haskell☆14May 24, 2023Updated 2 years ago
- Dafny for Metatheory of Programming Languages☆29Feb 6, 2026Updated last week
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago
- Derivation of Optimized Definitions Based on Specs☆14Sep 28, 2019Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- ☆12May 22, 2016Updated 9 years ago
- Bindings to the Zstandard library to make it usable from the Haskell programming language.☆47Feb 7, 2017Updated 9 years ago
- LIMA: Language for Integrated Modeling and Analysis☆12Sep 8, 2018Updated 7 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- A simple ML dialect☆11Jan 2, 2017Updated 9 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- Deriving via☆33Aug 6, 2018Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- Hopefully verifiable code generation in GHC☆94May 10, 2017Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- convert simple cryptol expressions into finite-state machines☆22Sep 15, 2017Updated 8 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Apr 23, 2021Updated 4 years ago
- Generates natural language versions of Coq proofs☆51Feb 11, 2018Updated 8 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- A tutorial on writing a concurrency testing tool in Haskell☆12Nov 5, 2017Updated 8 years ago
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Sep 20, 2021Updated 4 years ago
- [WIP] A type system for nix☆63Jul 11, 2019Updated 6 years ago