Completeness in data type specifications

  • Kounalis Emmanuel
Rewrite Rules And The Completion Procedure
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)


The proof-theoretical nature of initial algebra semantics provides us with the basis for showing the completeness of Data Type Specifications by term rewriting methods. Based upon these methods- in which the equations of a specification are regarded as rewriting rules- we show the decidability of completeness in a very large subclass of algebraic specifications including non-linear and/ or non-normalizing ones.

Furthermore the decision algorithm allows us to complete partial specifications and to ”reason” about the structure of specifications.

Some computer experiments illustrating its behavior are also given.


Structural Scheme Proof Theory Ground Term Abstract Data Type Completeness Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. Bibliography

  1. [DER,82]
    DERSHOWITZ N:”Ordering for term rewriting systems” TCS 17(3) 1983Google Scholar
  2. [EKP,78]
    EHRIG H,KREOWSKY H, PADAWITZ P: ”Stepwise specifications and implementeation of ADTs. ICALP 78.Google Scholar
  3. [GTW,75]
    GOGUEN J.A, THATCHER J.W, WAGNER E.G ”Abstract data types as initial algebras and the correctness of data representations” Con. on computer Grafics, Pattern recognition,and data structures 1975.Google Scholar
  4. [GTW,76]
    GOGUEN J.A., THATCHER J.W., WAGNER E.G.: ”An initial algebra approach to the specification, correctness and implementation of abstract data types” in ”Current trends in programming methodology”, vol. 4, pp 80–149, Ed. Yeh R., Prentice-Hall (1978)Google Scholar
  5. [G&H,78]
    GUTTANG J, HORNING J: ”The algebraic specifications of ADTs” Acta Informatica 10 1978 p 27–52CrossRefGoogle Scholar
  6. [H&H,82]
    HUET G., HULLOT J.M.:”Proofs by induction in equational theories with constructors” Proc. 21th FOCS (1980) and JCSS 25-2 (1982)Google Scholar
  7. [H&O,80]
    HUET G., OPPEN D.: ”Equations and rewrite rules: a survey” in ”Formal languages: perspectives and open problems” Ed. Book R.,Academic Press (1980)Google Scholar
  8. [J&K,84]
    JOUANNAUD J.P, KIRCHNER ”Completion of a set of rules modulo a set of equations,” Proc. 11th ACM Conference of Principles of Programming Languages (1984), also SIAM to appearGoogle Scholar
  9. [K&K,84]
    KIRCHNER C.,KIRCHNER H.: ”New applicatons of the REVE system” Rep. CRIN (1984) to appear.Google Scholar
  10. [K&B,70]
    KNUTH D., BENDIX P. ”Simple Word Problems in Universal Algebras,” Computational problems in Abstract Algebra Ed.Pergamon Press pp.263–297 (1970)Google Scholar
  11. [LES,83]
    LESCANNE P.:”Computer experimentswith the REVE term rewriting system generator” Proc. 10th POPL Conference (1983)Google Scholar
  12. [N&W,83]
    NIPKOW T, WEIKUM” A decidability result about sufficient completeness of axiomaticaly specified ADTs.LNCS 146 (1983) p 257–268Google Scholar
  13. [MUS,80]
    MUSSER D.R.: ”On proving inductive properties of abstract data types” Proc. 7th POPL Conference, Las Vegas (1980)Google Scholar
  14. [PAD,80]
    PADAWITZ P: ”New results on completeness and consinsency of ADTs” LNCS 88 (1980) 460–473Google Scholar
  15. [PAD,83]
    —: ”Correctess,Completeness, Consinstency of Equational Data type specifications” TUBerlin Bericht Nr 83-15Google Scholar
  16. [R&Z,84]
    REMY J.L, ZHANG H.”REVEUR 4:a System for validating Conditional Algebraic Specifications of Abstract Data Types” Proc. of 5th ECAI (1984)Google Scholar
  17. [THI,83]
    THIEL J.J.: ”Stop loosing sleep over uncompleteness of Data Type Specifications” Proc of 11th ACM Conference of Principles of Programming Languages POPL (1984).Google Scholar
  18. [WAN,77]
    WAND M: ”Algebraic theories and Tree Replacements Systems.” T.R 66 Undiana Univer. Bloomington (1977).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Kounalis Emmanuel
    • 1
  1. 1.Campus ScientifiqueCentre de Recherche en Informatique de NancyVandoeuvre les Nancy

Personalised recommendations