tchajed / coq-ioLinks
Modeling I/O in Coq using free monads
☆10Updated 6 years ago
Alternatives and similar repositories for coq-io
Users that are interested in coq-io are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated last week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- https://metaborg.github.io/mj.agda/☆12Updated 4 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated last month
- The Evolution of a Typechecker☆54Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated last month
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).☆12Updated last year
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- Logical Relation for MLTT in Coq☆25Updated last week
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Work in progress☆34Updated this week
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago