Skip to main content
SpringerLink
Log in

Rewrite systems on a lattice of types

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Re-writing systems for partial algebras are developed by modifying the Knuth-Bendix completion algorithm to permit the use of latticestructured domains. Some problems with the original algorithm, such as the treatment of division rings, are overcome conveniently by this means. The use of a type lattice also gives a natural framework for specifying data types in Computer Science without over-specifying error situations. The soundness and meaning of the major concepts involved in re-writing systems are reviewed when applied to such structures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Broy, M., Wirsing, M.: On the algebraic specification of non-deterministic programming languages. Lecture Notes in Computer Science. Vol. 112, pp. 162–179 (March 1981)

    Article  MATH  Google Scholar 

  2. Guttag, J.V., Horowitz, E., Musser, D.R.: Abstract Data Types and Software Validation. Comm. ACM 21, 1048–64 (Dec 1978)

    Article  MathSciNet  MATH  Google Scholar 

  3. Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness, and implementation of abstract data types. Current trends in programming methodology, 1979. Yeh (ed.), Vol. IV, pp. 80–321

  4. Huet, G., Oppen, D.C.: Equations and Rewrite Rules — A Survey. Stanford Comput. Sci. Report. No. STAN-CS-80-785, 1980

  5. Knuth, D.E., Bendix, P.B.: Simple Word Problems in Universal Algebras. In: Computational Problems in Abstract Algebra, pp. 263–297. J. Leech (ed.). Oxford: Pergamon Press 1970

    Google Scholar 

  6. Manna, Z.: Mathematical Theory of Computation. New York: MacGraw-Hill 1974

    MATH  Google Scholar 

  7. Newman, M.H.A.: On theories with a combinatorial definition of ‘equivalence’. Ann. Math. 43, 223–243 (1942)

    Article  MathSciNet  MATH  Google Scholar 

  8. Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12, 32–41 (1965)

    Article  MathSciNet  Google Scholar 

  9. Scott, D.S.: Data Types as Lattices. SIAM J. Comput. 5, 522–587 (Sept. 1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Shamir, A., Wadge, W.W.: Data Types as Objects. Lecture Notes in Computer Science 52, pp. 465–479 (July 1977) Springer

  11. Sickel, S.: A search technique for clause interconnectivity graphs. IEEE Trans. Comput. C25, (Aug. 1976)

  12. Walther, C.: A many-sorted calculus based on resolution and paramodulation. Internation Joint Conference on A.I. 1983, Karlsruhe, A. Bundy (ed.). Kaufmann Inc., Pub.

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College of Science and Technology, University of London, 180 Queen's Gate, SW7 2BZ, London, UK

    R. J. Cunningham & A. J. J. Dick

Authors
  1. R. J. Cunningham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. J. J. Dick
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cunningham, R.J., Dick, A.J.J. Rewrite systems on a lattice of types. Acta Informatica 22, 149–169 (1985). https://doi.org/10.1007/BF00264228

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264228

Keywords

Search

Navigation