Advertisement

Solving type equations by graph rewriting

  • Hassan Ait-Kaci
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 202)

Abstract

I have described a syntactic calculus of partially ordered structures and its application to computation. A syntax of record-like terms and a "type subsumption" ordering were defined and shown to form a lattice structure. A simple "type-as-set" interpretation of these term structures extends this lattice to a distributive one, and in the case of finitary terms, to a complete Brouwerian lattice. As a result, a method for solving systems of type equations by iterated rewriting of type symbols was proposed which defines an operational semantics for KBL — a Knowledge Base Language. It was shown that a KBL program can be seen as a system of equations. Thanks to the lattice properties of finite structures, a system of equations admits a least fixed-point solution. The particular order of computation of KBL, the "fan-out computation order", which rewrites symbols closer to the root first was formally defined and shown to be maximal. Unfortunately, the complete "correctness" of KBL is not yet established. That is, it is not known at this point whether the normal form of a term is equal to the fixed-point solution. However, as steps in this direction, two technical lemmas were conjectured to which a proof of the correctness is corollary.

Keywords

Distributive Lattice Term Structure Operational Semantic Algebraic Semantic Regular Term 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ait-Kaci, H. A Lattice Theoretic Approach to Computation Based on a Calculus of Partially Ordered Type Structures. PhD thesis, Computer and Information Science, University of Pennsylvania, 1984.Google Scholar
  2. [2]
    Berry, G., and Levy, J.J. Minimal and Optimal Computations of Recursive Programs. Journal of the ACM 26:148–75, 1979.Google Scholar
  3. [3]
    Birkhoff, G. Colloquium Publications. Volume 25: Lattice Theory. American Mathematical Society, Providence, RI, 1940. Third (revised) edition, 1979.Google Scholar
  4. [4]
    Borkin, S.A. Series in Computer Science. Volume 4: Data Models: A Semantic Approach for Database Systems. The M.I.T. Press, Cambridge, MA, 1980.Google Scholar
  5. [5]
    Brachman, R.J. A New Paradigm for Representing Knowledge. BBN Report 3605, Bolt Beranek and Newman, Cambridge, MA, 1978.Google Scholar
  6. [6]
    Brachman, R.J. What IS-A Is and Isn't: An Analysis of Taxonomic Links in Semantic Networks. Computer 16(10):30–35, October 1983.Google Scholar
  7. [7]
    Brouwer, L.E.J. On Order in the Continuum, and the Relation of Truth to Non-Contradictority. In Proceedings of the Section of Sciences 54, pages 357–358. Koninklijke Nederlandse Akademie Van Wetenschappen, 1951. Series A, Mathematical Sciences.Google Scholar
  8. [8]
    Courcelle, B. Fundamental Properties of Infinite Trees. Theoretical Computer Science 25:95–169, 1983.Google Scholar
  9. [9]
    Courcelle, B., and Nivat, M. The Algebraic Semantics of Recursive Program Schemes. In J. Winkowski (editor), Mathematical Foundations of Computer Science Proceedings, pages 16–30. Springer-Verlag, Berlin, W.Germany, 1978. Lecture Notes in Computer Science 64.Google Scholar
  10. [10]
    Dummett, M. Elements of Intuitionism. Oxford University Press, Oxford, UK, 1977.Google Scholar
  11. [11]
    Goguen, J.A., and Tardo, J.J. An Introduction to OBJ: a Language for Writing and Testing Formal Algebraic Program Specifications. In Proceedings of the IEEE Conference on Specifications of Reliable Software, pages 170–189. Cambridge, MA, 1979.Google Scholar
  12. [12]
    Gorn, S. Explicit Definitions and Linguistic Dominoes. In J.F. Hart and S. Takasu (editors), Systems and Computer Science, pages 77–105. University of Toronto Press, Toronto, Ontario, 1965.Google Scholar
  13. [13]
    Gorn, S. Data Representation and Lexical Calculi. Information Processing & Management 20(1–2):151–174, 1984. Also available as technical report MS-CIS-82-39, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA.Google Scholar
  14. [14]
    Guessarian, I. Lecture Notes in Computer Science. Volume 99: Algebraic Semantics. Springer-Verlag, Berlin, W.Germany, 1981.Google Scholar
  15. [15]
    Huet, G. Resolution d'Equations dans des Langages d'Ordre 1, 2, ..., ω. PhD thesis, Universite de Paris VII, France, September, 1976.Google Scholar
  16. [16]
    Nivat, M. On the Interpretation of Recursive Polyadic Program Schemes. In Symposia Mathematica, pages 225–81. Istituto Nazionale di Alta Mathematica, Rome, Italy, 1975.Google Scholar
  17. [17]
    Plotkin, G.D. A Powerdomain Construction. SIAM Journal on Computing 5, 1976.Google Scholar
  18. [18]
    Plotkin, G.D. Lattice Theoretic Properties of Subsumption. Memorandum MIP-R-77, Department of Machine Intelligence and Perception, University of Edinburgh, June, 1977.Google Scholar
  19. [19]
    Reynolds, J.C. Transformational Systems and the Algebraic Structure of Atomic Formulas. In D. Michie (editor), Machine Intelligence 5, chapter 7. Edinburgh University Press, 1970.Google Scholar
  20. [20]
    Robinson, J.A. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM 12(1):23–41, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Hassan Ait-Kaci
    • 1
  1. 1.Microelectronics and Computer Technology CorporationAustin

Personalised recommendations