thery / T2048
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
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- ☆11Updated 4 years ago
- ☆27Updated last year
- Mtac in Agda☆28Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 4 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆30Updated 6 months ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Lenses in Coq☆16Updated 2 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 2 months ago
- ☆18Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- my phd thesis☆26Updated 5 months ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- ModTT in Agda☆11Updated 3 years ago
- ☆23Updated 6 months ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago