coq-io / systemLinks
Library of Unix effects for Coq.
☆23Updated 6 years ago
Alternatives and similar repositories for system
Users that are interested in system are comparing it to the libraries listed below
Sorting:
- A library for effects in Coq.☆65Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Coq with native compilation, as well as machine integers and arrays !☆63Updated 7 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated this week
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 8 months ago
- OCaml backend for Agda☆39Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆84Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Reflection library for Coq☆12Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Category theory and algebra☆26Updated 9 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Formalisation of Goedel's System T in Coq☆15Updated 14 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Formalizing nbe in agda☆32Updated 13 years ago