Proof Normalization of Structured Algebraic Specifications Is Convergent

Authors:
Martin Wirsing;John N. Crossley;Hannes Peterreins
Affiliations:
-;-;-
Venue:
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Year:
1998

Citing 7
Cited 1

Proofs and types

Proofs and types
Structure and representation in LF

Proceedings of the Fourth Annual Symposium on Logic in computer science
Module algebra

Journal of the ACM (JACM)
Algebraic specification

Handbook of theoretical computer science (vol. B)
Term rewriting and all that

Term rewriting and all that
Proof Systems for Struvtured Algebraic Specifications: An Overview

FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Structured Theories in LCF

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming

Programs, Proofs and Parametrized Specifications

WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new natural deduction calculus for structured algebraic specifications and study proof transformations including cut elimination. As underlying language we choose an ASL-like kernel language which includes operators for composing specifications, renaming the signature and exporting a subsignature of a specification. To get a natural deduction calculus for structured specifications we combine a natural deduction calculus for first-order predicate logic with the proof rules for structured specifications. The main results are soundness and completeness of the calculus and convergence of the associated system of proof term reductions which extends a typed - calculus by appropriate structural reductions.