Proof pearl: a formal proof of Higman's Lemma in ACL2

Authors:
Francisco J. Martín-Mateos;José L. Ruiz-Reina;José A. Alonso;Mariá J. Hidalgo
Affiliations:
Computational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática, Sevilla, Spain;Computational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática, Sevilla, Spain;Computational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática, Sevilla, Spain;Computational Logic Group, Dept. of Computer Science and Artificial Intelligence, University of Seville, E.T.S.I. Informática, Sevilla, Spain
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 5
Cited 2

Term rewriting and all that

Term rewriting and all that
Proving termination with multiset orderings

Communications of the ACM
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Structured Theory Development for a Mechanized Logic

Journal of Automated Reasoning
An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs

Decision procedures for automating termination proofs

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Proof Pearl: a Formal Proof of Higman's Lemma in ACL2

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a formalization and proof of Higman's Lemma in ACL2. We formalize the constructive proof described in [10] where the result is proved using a termination argument justified by the multiset extension of a well-founded relation. To our knowledge, this is the first mechanization of this proof.