DMCA
Full Abstraction and Universality via Realisability (1999)
Cached
Download Links
- [www.mathematik.tu-darmstadt.de]
- [www.mathematik.tu-darmstadt.de]
- DBLP
Other Repositories/Bibliography
| Citations: | 4 - 0 self |
BibTeX
@MISC{Marz99fullabstraction,
author = {Michael Marz and Alexander Rohr and Thomas Streicher and D- Darmstadt},
title = {Full Abstraction and Universality via Realisability},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
ion and Universality via Realisability Michael Marz marz@mathematik.tu-darmstadt.de Alexander Rohr y rohr@mathematik.tu-darmstadt.de Thomas Streicher streicher@mathematik.tu-darmstadt.de Technische Universitat Darmstadt Fachbereich Mathematik Schlogartenstrae 7, D-64289 Darmstadt Abstract We construct fully abstract realisability models of PCF. In particular, we prove a variant of the Longley--Phoa Conjecture by showing that the realisability model over an untyped --calculus with arithmetic is fully abstract for PCF. Further we consider the extension of our results to a general sequential functional programming language SFPL giving rise to universal realisability models for SFPL. 1. Introduction Realisability models are known as a flexible tool for organising untyped models of computation into extensional models with a rich type structure where domains appear as sets, see e. g. [5, 8]. For example the Scott model and its effective variant both appear as realisabilit...
Keyphrases
full abstraction untyped model realisability model longley phoa conjecture flexible tool extensional model alexander rohr rohr mathematik introduction realisability model thomas streicher streicher mathematik scott model universal realisability model rich type structure d-64289 darmstadt abstract realisability michael marz untyped calculus abstract realisability model
