Please use this identifier to cite or link to this item:
doi:10.22028/D291-26472
Title: | A verification of extensible record types |
Author(s): | Hense, Andreas V. Smolka, Gert |
Language: | English |
Year of Publication: | 1992 |
Free key words: | order-sorted logic rational tree unification term rewriting |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
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. |
Link to this record: | urn:nbn:de:bsz:291-scidok-51775 hdl:20.500.11880/26528 http://dx.doi.org/10.22028/D291-26472 |
Series name: | Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes |
Series volume: | 1992/03 |
Date of registration: | 4-Apr-2013 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
fb14_1992_03.pdf | 20,82 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.