Skip to main content
Article thumbnail
Location of Repository

A verification of extensible record types

By Saarbruecken (Germany)) Deutsches Forschungszentrum fuer Kuenstliche Intelligenz GmbH (DFKI), Saarbruecken (Germany). Fachbereich 14 - Informatik) A.V. (Universitaet des Saarlandes Hense, Saarbruecken (Germany). Fachbereich 14 - Informatik Universitaet des Saarlandes and Saarbruecken (Germany). Fachbereich 14 - Informatik G. (Universitaet des Saarlandes Smolka

Abstract

In the strive for more flexible type checkers, Remy and Wand proposed flexible record types in order to avoid the complications involved with subtyping. We formalize their approach in the framework of order-sorted logic. R, the considered language of records, is so simple that the type inference algorithm can be expressed as a constraint solver in first-order logic. We specify expressions and types, give an effective method for finding a typing, and state soundness results. R can be the basis of type inference for object-oriented programming languages. (orig.)SIGLEAvailable from TIB Hannover: RO 9514(92-03) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Topics: 09H - Computer software, programming, RECORDS: M, ORDER-SORTED LOGIC, RATIONAL TREE UNIFICATION, TERM REWRITING, TYPE INFERENCE, RECURSIVE TYPES, OBJECT-ORIENTED PROGRAMMING
Year: 1992
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10068/15... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.