Proof Normalization of Structured Algebraic Specifications Is Convergent

  • Martin Wirsing
  • John N. Crossley
  • Hannes Peterreins
Conference paper

DOI: 10.1007/3-540-48483-3_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1589)
Cite this paper as:
Wirsing M., Crossley J.N., Peterreins H. (1999) Proof Normalization of Structured Algebraic Specifications Is Convergent. In: Fiadeiro J.L. (eds) Recent Trends in Algebraic Development Techniques. WADT 1998. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg

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 l-calculus by appropriate structural reductions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Heidelberg Berlin 1999

Authors and Affiliations

  • Martin Wirsing
    • 1
  • John N. Crossley
    • 2
  • Hannes Peterreins
    • 3
  1. 1.Institut für InformatikLudwig-Maximilians-Universität MünchenMünchenGermany
  2. 2.School of Computer Science and Software EngineeringMonash UniversityClaytonAustralia
  3. 3.Portfolio Consulting GmbHMünchenGermany

Personalised recommendations