Winskel, G., Stable bistructure models of PCF, in Proc. 19th Int. Conf. on Mathematical Foundations of Programming Semantics, (eds. Pr'ivara, I., Rovan, B., and Ruzicka, P.,) LNCS, Vol. 841, SpringerVerlag, Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (1 citation) (Correct)
....and Ehrhard [BE91, Ehr93] refined the model with stronger stability conditions on functions to arrive at a model that is fully abstract for the first order fragment of PCF. Brookes and Geva [BG93] also achieve full abstraction for a fragment of PCF using domain theoretic ideas. Recently, Winskel [Win94] refined Berry s bidomains to bistructures, and arrived at a better model incorporating stable and pointwise orders. The initial failures of stable functions led to the third approach of sequential algorithms. Previously, Berry and Curien [BC85, Cur86] described a model composed of algorithms ....
G. Winskel. Stable bistructure models of PCF. Technical Report RS-94-13, BRICS, 1994.
Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel (1997) Self-citation (Winskel) (Correct)
....Scott model. The argument follows Jim and Meyer s in [13] and is based on the bidomain model failing to eliminate an or tester , the first of Curien s examples in [5] Proposition 4.4.2. The same argument applies to the variation sketched above, where coherence is replaced by hypercoherence. In [29] it is shown how to adjoin an additional conflict relation to bistructures to obtain a model of PCF whose 37 theory strictly includes that of the Scott model. Several strengthenings of this idea are possible; the conflict relation can be combined with hypercoherences on bistructures, or even ....
Winskel, G., Stable bistructure models of PCF, in Proc. 19th Int. Conf. on Mathematical Foundations of Programming Semantics, (eds. Pr'ivara, I., Rovan, B., and Ruzicka, P.,) LNCS, Vol. 841, SpringerVerlag,
Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel Self-citation (Winskel) (Correct)
....Scott model. The argument follows Jim and Meyer s in [13] and is based on the bidomain model failing to eliminate an or tester , the first of Curien s examples in [5] Proposition 4.4.2. The same argument applies to the variation sketched above, where coherence is replaced by hypercoherence. In [29] it is shown how to adjoin an additional conflict relation to bistructures to obtain a model of PCF whose 37 theory strictly includes that of the Scott model. Several strengthenings of this idea are possible; the conflict relation can be combined with hypercoherences on bistructures, or even ....
Winskel, G., Stable bistructure models of PCF, in Proc. 19th Int. Conf. on Mathematical Foundations of Programming Semantics, (eds. Pr'ivara, I., Rovan, B., and Ruzicka, P.,) LNCS, Vol. 841, SpringerVerlag, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC