lastland / WebSpec
☆18Updated 8 years ago
Alternatives and similar repositories for WebSpec
Users that are interested in WebSpec are comparing it to the libraries listed below
Sorting:
- ☆29Updated 9 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- ☆22Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Luck -- A Language for Property-Based Generators☆34Updated 2 months ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- ☆17Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Constructive Galois connections☆32Updated 7 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated 2 weeks ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Mtac in Agda☆28Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year