thery / T2048
a version of the 2048 game for Coq
☆22Updated last year
Related projects ⓘ
Alternatives and complementary repositories for T2048
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Lenses in Coq☆16Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- ☆18Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- my phd thesis☆26Updated 3 months ago
- ☆27Updated last year
- ModTT in Agda☆11Updated 3 years ago
- IO for Gallina☆31Updated 2 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Higher Algebra with Opetopic Types☆14Updated last year
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- ☆11Updated 4 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months 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
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month