An essence of SSReflect

Authors:
Iain Whiteside;David Aspinall;Gudmund Grov
Affiliations:
CISA, School of Informatics, University of Edinburgh, Edinburgh, Scotland;CISA, School of Informatics, University of Edinburgh, Edinburgh, Scotland;CISA, School of Informatics, University of Edinburgh, Edinburgh, Scotland
Venue:
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Year:
2012

Citing 14
Cited 0

Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Refactoring: improving the design of existing code

Refactoring: improving the design of existing code
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Proof Style

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
A Survey of Software Refactoring

IEEE Transactions on Software Engineering
The Four Colour Theorem: Engineering of a Formal Proof

Computer Mathematics
Declarative Representation of Proof Terms

Journal of Automated Reasoning
Procedural Representation of CIC Proof Terms

Journal of Automated Reasoning
Hiproofs: A Hierarchical Notion of Proof Tree

Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative language for the coq proof assistant

TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Incidence simplicial matrices formalized in Coq/SSReflect

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Towards formal proof script refactoring

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Reflexive toolbox for regular expression matching: verification of functional programs in Coq+Ssreflect

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
A tactic language for declarative proofs

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

SSReflect is a powerful language for proving theorems in the Coq system. It has been used for some of the largest proofs in formal mathematics thus far. However, although it constructs proofs in a formal system, like most other proof languages the semantics is informal making it difficult to reason about such proof scripts. We give a semantics to a subset of the language, using a hierarchical notion of proof tree, and show some simple transformations on proofs that preserve the semantics.