coq-io / systemLinks
Library of Unix effects for Coq.
☆23Updated 5 years ago
Alternatives and similar repositories for system
Users that are interested in system are comparing it to the libraries listed below
Sorting:
- The Evolution of a Typechecker☆54Updated 6 years ago
- A library for effects in Coq.☆65Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated 2 weeks ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Category theory and algebra☆28Updated 8 years ago
- ☆83Updated last year
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated last month
- Logical relations proof in Agda☆26Updated 10 years ago
- ☆84Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Where my everyday research happens☆53Updated last week
- OCaml backend for Agda☆40Updated 6 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago