Skip to main content
SpringerLink
Log in

Structure sharing for quantified terms: Fundamentals

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Structure sharing is used in symbolic computation to share a common top level between terms with different lower levels. It is widely used in the implementation of Prolog interpreters and is of interest for the implementation of automatic theorem provers, interactive proof editors and verification systems. Previously, structure sharing has been applied only to free-variable terms. In this paper we extend the structure sharing technique to quantified terms. We give an efficient unification algorithm of our structure sharing representation of quantified terms, and we prove the correctness of the algorithm.

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. Boyer, R. S. and Moore, J. S., ‘The sharing of structure in theorem-proving programs’, Machine Intelligence 7 (eds B.Meltzer and D.Michie), Edinburgh University Press, Edinburgh, pp. 101–116 (1972).

    Google Scholar 

  2. deBruijn, N. G., ‘Lambda calculus notation with nameless dummies’, Nederl. Akad. Wetensch. Proc. Ser. A 75, 381–392 (1972).

    Google Scholar 

  3. deBruijn, N. G., ‘Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings’, Nederl. Akad. Wetensch. Proc. Ser. A 81, 348–356 (1978).

    Google Scholar 

  4. Levy, J.-J., ‘Reductions correctes et optimales dans le λ-calcul’, Thèse de doctorat d'état, Université Paris VII (1978).

  5. Manna, Z. and Waldinger, R., ‘Deductive synthesis of the unification algorithm’, Sci. Comp. Programming 1, 5–48 (1981).

    Google Scholar 

  6. Robinson, J. A., ‘A machine-oriented logic based on the resolution principle’, J. Assoc. Comp. Mach. 12, 23–41 (1965).

    Google Scholar 

  7. Staples, J., ‘A graph-like lambda calculus for which leftmost-outermost reduction is optimal’, Proc. Int. Workshop on Graph Grammars and their Applications to Computer Science and Biology (eds V. Claus, H. Ehrig and G. Rosenberg); Lecture Notes in Computer Science 73, 440–455 (1980).

  8. Staples, J., ‘Computation of graph-like expressions’, Theor. Comp. Sci. 10, 171–185 (1980).

    Google Scholar 

  9. Staples, J., ‘A new strategy for lazy evaluation of lambda expressions’, Aust. Comp. Sci. Commun. 4, 277–285 (1982).

    Google Scholar 

  10. Staples, J., ‘Efficient lazy evaluation of lambda expressions: a stack-based approach’, Univ. of Queensland Dept of Comp. Sci. Tech. Report No. 26 (March 1981).

  11. Staples, J. and Robinson, P. J., ‘Efficient unification of quantified terms’, J. Logic Programming 5, 133–149 (1988).

    Google Scholar 

  12. Wadsworth, C. P., ‘Semantics and pragmatics of the lambda calculus’, PhD Thesis, Oxford (1971).

Download references

Author information

Authors and Affiliations

  1. Key Centre for Software Technology, Computer Science Department, University of Queensland, 4067, St. Lucia, Queensland, Australia

    John Staples & Peter J. Robinson

Authors
  1. John Staples
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter J. Robinson
    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

Staples, J., Robinson, P.J. Structure sharing for quantified terms: Fundamentals. J Autom Reasoning 6, 115–145 (1990). https://doi.org/10.1007/BF00245815

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation