Skip to main content
SpringerLink
Log in

A fixed-point semantics for feature type systems

  • Chapter 6 Basic Frameworks For Typed And Order-Sorted Systems
  • Conference paper
  • First Online:
Conditional and Typed Rewriting Systems (CTRS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 516))

Included in the following conference series:

  • 143 Accesses

Abstract

The solution of a set of recursive feature type equations is defined in terms of a fixed-point semantics. Using the corresponding operational semantics, the result of the evaluation of a feature term is computed by successive continuous approximations. This semantics allows the usage of any order for evaluating a term, and also allows for cyclic feature terms, alleviating the need for an “occur-check”.

Research reported in this paper is partly supported by the German Ministry of Research and Technology (BMFT, Bundesminister für Forschung und Technologie), under grant No. 08 B3116 3. The views and conclusions contained herein are those of the authors and should not be interpreted as representing official policies.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hassan Aït-Kaci. “An Algebraic Semantics Approach to the Effective Resolution of Type Equations”. Theoretical Computer Science 45, 293–351.

    Google Scholar 

  2. Martin Emele and Rémi Zajac. Multiple Inheritance in RETIF. ATR Technical Report TR-I-0114, ATR, Kyoto.

    Google Scholar 

  3. Martin Kay. “Functional Unification Grammar: a formalism for machine translation”. Proc. of the 10th Intl. Conf. on Computational Linguistics, COLING-84, Stanford.

    Google Scholar 

  4. G.D. Plotkin. “A Powerdomain Construction”. SIAM J. of Computing 5/3.

    Google Scholar 

  5. Carl Pollard and Drew Moshier. “Unifiying partial descriptions of sets”. In P. Hanson (ed.), Information, Language and Cognition, Vancouver Studies in Cognitive Science 1, University of British Columbia Press, Vancouver.

    Google Scholar 

  6. Dana Scott. “Domains for Denotational Semantics”. In: ICALP-82, LNCS 140, Springer-Verlag, Heidelberg.

    Google Scholar 

  7. Gert Smolka. A Feature Logic with Subsorts. LILOG Report 33, IBM Deutschland, Stuttgart.

    Google Scholar 

  8. M.B. Smyth. “Power Domains”. J. of Computer and System Sciences 16, 23–36.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Project Polygloss University of Stuttgart IMS-CL/IfI-AIS, Keplerstraß 17, D 7000, Stuttgart 1, West Germany

    Martin Emele & Rémi Zajac

Authors
  1. Martin Emele
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rémi Zajac
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Kaplan M. Okada

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emele, M., Zajac, R. (1991). A fixed-point semantics for feature type systems. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-54317-1_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54317-6

  • Online ISBN: 978-3-540-47558-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation