thery / T2048Links
a version of the 2048 game for Coq
☆22Updated this week
Alternatives and similar repositories for T2048
Users that are interested in T2048 are comparing it to the libraries listed below
Sorting:
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Quasi-quoting library for agda☆18Updated last year
- ☆11Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14Updated 8 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- my phd thesis☆26Updated last year
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- ☆15Updated 2 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 9 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- ☆14Updated 9 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆18Updated 3 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆21Updated 6 years ago
- ☆21Updated 4 years ago
- ☆19Updated 2 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- ☆17Updated 3 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆21Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago