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:
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ☆11Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- ☆18Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 10 months ago
- my phd thesis☆26Updated 10 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆19Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ModTT in Agda☆11Updated 3 years ago
- ☆29Updated 2 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- ☆23Updated 11 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- ☆12Updated 5 years ago