Proof Pearl: Revisiting the Mini-rubik in Coq

DOI10.1007/978-3-540-71067-7_25zbMath1165.68476OpenAlexW1530746763MaRDI QIDQ3543668

Laurent Théry

Publication date: 4 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71067-7_25

Mathematics Subject Classification ID

Uses Software

• Coq
• ML
• HOL

Cites Work

• New methods for using Cayley graphs in interconnection networks
• Primality Proving with Elliptic Curves
• Towards Constructive Homological Algebra in Type Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof Pearl: Revisiting the Mini-rubik in Coq