Projecting Sequential Algorithms on Strongly Stable Functions (1993)
| Venue: | Annals of Pure and Applied Logic |
| Citations: | 22 - 2 self |
BibTeX
@ARTICLE{Ehrhard93projectingsequential,
author = {Thomas Ehrhard},
title = {Projecting Sequential Algorithms on Strongly Stable Functions},
journal = {Annals of Pure and Applied Logic},
year = {1993},
volume = {77},
pages = {77--201}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the "extensional projections" of some sequential algorithms. We define a model of PCF where morphisms are "extensional" sequential algorithms and prove that any equation between PCF terms which holds in this model also holds in the strongly stable model.
