Must Preorder in Non-Deterministic Untyped λ-calculus (1992)
by
U. de'Liguoro
,
A. Piperno
| Venue: | IN CAAP '92, VOLUME 581 OF LNCS |
| Citations: | 9 - 1 self |
BibTeX
@INPROCEEDINGS{de'Liguoro92mustpreorder,
author = {U. de'Liguoro and A. Piperno},
title = {Must Preorder in Non-Deterministic Untyped λ-calculus},
booktitle = {IN CAAP '92, VOLUME 581 OF LNCS},
year = {1992},
pages = {203--220},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper studies the interplay between functional application and nondeterministic choice in the context of untyped λ-calculus. We introduce an operational semantics which is based on the idea of must preorder, coming from the theory of process algebras. To characterize this relation, we build a model using the classical inverse limit construction, and we prove it fully abstract using a generalization of Böhm trees.
