Conservatory / quarkLinks
A Web Browser with a Formally Verified Kernel
☆24Updated 12 years ago
Alternatives and similar repositories for quark
Users that are interested in quark are comparing it to the libraries listed below
Sorting:
- A hip inductive theorem prover!☆90Updated 3 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"☆23Updated 13 years ago
- A minimalist implementation of type theory, suitable for experimentation☆15Updated 2 months ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- topos programming☆31Updated 7 years ago
- second-order abstract syntax☆31Updated 4 years ago
- A web server written in Coq.☆89Updated 9 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Library of Unix effects for Coq.☆23Updated 6 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 10 years ago
- ☆29Updated 10 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 12 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- xmonad in Coq☆46Updated 13 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆21Updated 9 months ago
- Cryptographic Constructions in the Type Theory of Agda☆53Updated 10 years ago
- A type theory based theorem proving library☆25Updated 14 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- The Ynot Project source code.☆22Updated 11 years ago
- ☆34Updated 13 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago