shlevy / cat-fiatView external linksLinks
An attempt to formalize unix cat in fiat
☆11May 28, 2017Updated 8 years ago
Alternatives and similar repositories for cat-fiat
Users that are interested in cat-fiat are comparing it to the libraries listed below
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- A Language and its compiler on Ethereum Virtual Machine☆14Dec 17, 2018Updated 7 years ago
- Compiler for IMP programming language implemented in Haskell☆16Jun 16, 2020Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- Deriving Storable instances using GHC.Generics☆16Apr 9, 2022Updated 3 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Pure Type Systems for Functional Programming☆31Nov 21, 2020Updated 5 years ago
- Generates natural language versions of Coq proofs☆51Feb 11, 2018Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Oct 3, 2019Updated 6 years ago
- Like the checkers library, but for hedgehog. Common stuff you'd want to check.☆22Nov 20, 2018Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- ☆22Oct 20, 2025Updated 3 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- xmonad in Coq☆46Jul 9, 2012Updated 13 years ago
- Folds for recursive types with GHC Generics☆28Aug 9, 2025Updated 6 months ago
- convert simple cryptol expressions into finite-state machines☆22Sep 15, 2017Updated 8 years ago
- Template for Hindley-Milner based languages☆39Dec 7, 2021Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- A compiler for Coq☆26Feb 22, 2013Updated 12 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- Simple reflection of expressions☆34Jun 18, 2021Updated 4 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 8 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- A Haskell library implementing several Paxos-related algorithms☆25Dec 13, 2012Updated 13 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- A Haskell library making it easier to write Alex lexers.☆12Sep 15, 2025Updated 5 months ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago