Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-26T08:46:00.814Z Has data issue: false hasContentIssue false
  • English
  • Français

[top ][top ]-closed relations and admissibility

Published online by Cambridge University Press:  01 June 2000

MARTÍN ABADI
MARTÍN ABADI
Affiliation:
Bell Labs Research, Lucent Technologies, 3180 Porter Drive, Palo Alto, California 94304, USA
Get access Rights & Permissions [Opens in a new window]

Abstract

While developing a method for reasoning about programs, Pitts defined the [top ][top ]-closed relations as an alternative to the standard admissible relations. This paper reformulates and studies Pitts's operational concept of [top ][top ]-closure in a semantic framework. It investigates the non-trivial connection between [top ][top ]-closure and admissibility, showing that [top ][top ]-closure is strictly stronger than admissibility and that every [top ][top ]-closed relation corresponds to an admissible preorder.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 10 , Issue 3 , June 2000 , pp. 313 - 320
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)