G. Winskel - Academia.edu (original) (raw)

Papers by G. Winskel

Theoretical Computer Science, 1996

Lecture Notes in Computer Science, 2013

because functicns like that of example 8.2.5 which are not sequential but still included. By indu... more because functicns like that of example 8.2.5 which are not sequential but still included. By induction on types Berry shows that the stable ordering is "hidden" in the fully abstract model of PCF and that the functions in it are stable with respect to it. As remarked above the fullyabstract model cannot contain all such functions. For first order types (of the form (@, ,... rn; ?$ where ci and 7 are ground types) he shows that the stable order is the image of the syntactic order and that the extensional order is the image of Plotkin's operational preorder 5 on terms. He conjectures that this state of affairs holds at all types in the fully-abstract model. The work of Berry and Curien ([Ber and Cur], [Cur]) on models of algorithms shows the stable ordering will be very important for a semantic construction of the full*y-abstract model. Some obvious approaches do not work however. The stable ordering alone does not support sequential functions; both parts of axioms Q for...

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Foundations of Software Science and Computation Structures, 2018

because functicns like that of example 8.2.5 which are not sequential but still included. By indu... more because functicns like that of example 8.2.5 which are not sequential but still included. By induction on types Berry shows that the stable ordering is "hidden" in the fully abstract model of PCF and that the functions in it are stable with respect to it. As remarked above the fullyabstract model cannot contain all such functions. For first order types (of the form (@, ,... rn; ?$ where ci and 7 are ground types) he shows that the stable order is the image of the syntactic order and that the extensional order is the image of Plotkin's operational preorder 5 on terms. He conjectures that this state of affairs holds at all types in the fully-abstract model. The work of Berry and Curien ([Ber and Cur], [Cur]) on models of algorithms shows the stable ordering will be very important for a semantic construction of the full*y-abstract model. Some obvious approaches do not work however. The stable ordering alone does not support sequential functions; both parts of axioms Q for...

because functicns like that of example 8.2.5 which are not sequential but still included. By indu... more because functicns like that of example 8.2.5 which are not sequential but still included. By induction on types Berry shows that the stable ordering is "hidden" in the fully abstract model of PCF and that the functions in it are stable with respect to it. As remarked above the fullyabstract model cannot contain all such functions. For first order types (of the form (@, ,... rn; ?$ where ci and 7 are ground types) he shows that the stable order is the image of the syntactic order and that the extensional order is the image of Plotkin's operational preorder 5 on terms. He conjectures that this state of affairs holds at all types in the fully-abstract model. The work of Berry and Curien ([Ber and Cur], [Cur]) on models of algorithms shows the stable ordering will be very important for a semantic construction of the full*y-abstract model. Some obvious approaches do not work however. The stable ordering alone does not support sequential functions; both parts of axioms Q for...

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Foundations of Software Science and Computation Structures, 2018

Foundations of Software Science and Computation Structures, 2018

Journal of the London Mathematical Society, 2007

ABSTRACT Many original motivations and intuitions were formed around the model of transition syst... more ABSTRACT Many original motivations and intuitions were formed around the model of transition systems. Through the medium of presheaves, we are able to cope uniformly with a range of models and their equivalences, from interleaving to independence models, and at the same time, by altering our view a little, see the approach as only a slight adjustment in the perspective that motivated Park and Milner’s definition of strong bisimulation.

ABSTRACT Many original motivations and intuitions were formed around the model of transition syst... more ABSTRACT Many original motivations and intuitions were formed around the model of transition systems. Through the medium of presheaves, we are able to cope uniformly with a range of models and their equivalences, from interleaving to independence models, and at the same time, by altering our view a little, see the approach as only a slight adjustment in the perspective that motivated Park and Milner’s definition of strong bisimulation.

Category Theory and Computer Science, 1997

Abstract. Recent work has shown that presheaf categories provide a general model of concurrency, ... more Abstract. Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also han-dle systems where the language of actions may change ...

Theoretical Computer Science, 1996

Lecture Notes in Computer Science, 2013

because functicns like that of example 8.2.5 which are not sequential but still included. By indu... more because functicns like that of example 8.2.5 which are not sequential but still included. By induction on types Berry shows that the stable ordering is "hidden" in the fully abstract model of PCF and that the functions in it are stable with respect to it. As remarked above the fullyabstract model cannot contain all such functions. For first order types (of the form (@, ,... rn; ?$ where ci and 7 are ground types) he shows that the stable order is the image of the syntactic order and that the extensional order is the image of Plotkin's operational preorder 5 on terms. He conjectures that this state of affairs holds at all types in the fully-abstract model. The work of Berry and Curien ([Ber and Cur], [Cur]) on models of algorithms shows the stable ordering will be very important for a semantic construction of the full*y-abstract model. Some obvious approaches do not work however. The stable ordering alone does not support sequential functions; both parts of axioms Q for...

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Foundations of Software Science and Computation Structures, 2018

because functicns like that of example 8.2.5 which are not sequential but still included. By indu... more because functicns like that of example 8.2.5 which are not sequential but still included. By induction on types Berry shows that the stable ordering is "hidden" in the fully abstract model of PCF and that the functions in it are stable with respect to it. As remarked above the fullyabstract model cannot contain all such functions. For first order types (of the form (@, ,... rn; ?$ where ci and 7 are ground types) he shows that the stable order is the image of the syntactic order and that the extensional order is the image of Plotkin's operational preorder 5 on terms. He conjectures that this state of affairs holds at all types in the fully-abstract model. The work of Berry and Curien ([Ber and Cur], [Cur]) on models of algorithms shows the stable ordering will be very important for a semantic construction of the full*y-abstract model. Some obvious approaches do not work however. The stable ordering alone does not support sequential functions; both parts of axioms Q for...

because functicns like that of example 8.2.5 which are not sequential but still included. By indu... more because functicns like that of example 8.2.5 which are not sequential but still included. By induction on types Berry shows that the stable ordering is "hidden" in the fully abstract model of PCF and that the functions in it are stable with respect to it. As remarked above the fullyabstract model cannot contain all such functions. For first order types (of the form (@, ,... rn; ?$ where ci and 7 are ground types) he shows that the stable order is the image of the syntactic order and that the extensional order is the image of Plotkin's operational preorder 5 on terms. He conjectures that this state of affairs holds at all types in the fully-abstract model. The work of Berry and Curien ([Ber and Cur], [Cur]) on models of algorithms shows the stable ordering will be very important for a semantic construction of the full*y-abstract model. Some obvious approaches do not work however. The stable ordering alone does not support sequential functions; both parts of axioms Q for...

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Foundations of Software Science and Computation Structures, 2018

Foundations of Software Science and Computation Structures, 2018

Journal of the London Mathematical Society, 2007

ABSTRACT Many original motivations and intuitions were formed around the model of transition syst... more ABSTRACT Many original motivations and intuitions were formed around the model of transition systems. Through the medium of presheaves, we are able to cope uniformly with a range of models and their equivalences, from interleaving to independence models, and at the same time, by altering our view a little, see the approach as only a slight adjustment in the perspective that motivated Park and Milner’s definition of strong bisimulation.

ABSTRACT Many original motivations and intuitions were formed around the model of transition syst... more ABSTRACT Many original motivations and intuitions were formed around the model of transition systems. Through the medium of presheaves, we are able to cope uniformly with a range of models and their equivalences, from interleaving to independence models, and at the same time, by altering our view a little, see the approach as only a slight adjustment in the perspective that motivated Park and Milner’s definition of strong bisimulation.

Category Theory and Computer Science, 1997

Abstract. Recent work has shown that presheaf categories provide a general model of concurrency, ... more Abstract. Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also han-dle systems where the language of actions may change ...