Full abstraction and limiting completeness in equational languages (Q1121676): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Full abstraction and limiting completeness in equational languages |
scientific article |
Statements
Full abstraction and limiting completeness in equational languages (English)
0 references
1989
0 references
A notion of full abstraction for equational languages is introduced by the author. That notion has the property that each language has a unique fully abstract model which can be characterized as the final object on a suitable category of computable models. The author also describes two different techniques for proving limiting completeness with respect to regular systems à la Hoffmann-O'Donnell and to information systems à la Dana Scott.
0 references
full abstraction
0 references
limiting completeness
0 references
equational languages
0 references
