thery / T2048Links
a version of the 2048 game for Coq
☆22Updated last year
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
- ☆11Updated 5 years ago
- Quasi-quoting library for agda☆18Updated 8 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- ☆15Updated last year
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 3 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 4 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆17Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- my phd thesis☆26Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆16Updated 2 months ago
- ☆13Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- ☆17Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆18Updated 3 years ago