Kegelmann, M., Factorization systems on domains, Technical Report, School of Computer Science, The University of Birmingham, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel (1997) (Correct)
....fully abstract model. Such extensions to PCF escape Loader s proof. But the precise programming constructs associated with these extensions is a mystery, and would need a deeper understanding of the operational nature of bistructure models. Connections. Lamarche [17] followed by Kegelmann [15]) has proposed a large cartesian closed category of interpolative domains encompassing, as full sub cartesian closed categories, categories of continuous functions on one hand, and categories of stable functions on the other. Lamarche s framework has some technical similarities with ours; two ....
Kegelmann, M., Factorization systems on domains, Technical Report, School of Computer Science, The University of Birmingham, 1996.
Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel (Correct)
....fully abstract model. Such extensions to PCF escape Loader s proof. But the precise programming constructs associated with these extensions is a mystery, and would need a deeper understanding of the operational nature of bistructure models. Connections. Lamarche [17] followed by Kegelmann [15]) has proposed a large cartesian closed category of interpolative domains encompassing, as full sub cartesian closed categories, categories of continuous functions on one hand, and categories of stable functions on the other. Lamarche s framework has some technical similarities with ours; two ....
Kegelmann, M., Factorization systems on domains, Technical Report, School of Computer Science, The University of Birmingham, 1996.
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