Glynn Winskel rejoined the University of Cambridge Computer Laboratory as professor in This followed 12 years as professor of computer science at. Organization: University of Cambridge. Web page: Pages in this Program. Program · Program for Tuesday, September 4th · Disclaimer. Formal Semantics of Programming Languages [Glynn Winskel] on *FREE* shipping on qualifying offers. The Formal Semantics of Programming.
|Published (Last):||22 July 2006|
|PDF File Size:||20.63 Mb|
|ePub File Size:||10.92 Mb|
|Price:||Free* [*Free Regsitration Required]|
Presheaf Models for the pi-Calculus. The formal semantics of programming languages – an introduction.
Glynn Winskel – Google Scholar Citations
Name Generation and Linearity. Computation, Logic, Games, and Quantum Foundations A Categorical Axiomatics for Bisimulation. Domain theory for concurrency. Petri nets in cryptographic protocols.
Category Theory and Computer Science New articles by this author. Distributed Strategies Made Easy. Was this page useful?
The system can’t perform the operation now. Petri Nets With Persistence. Linear Logic on Petri Nets. Distributing probability over non-determinism. Bisimulation from Open Maps. Category Theory and Models for Parallel Computation. Compositional Checking of Satsfaction.
Petri Nets and Bisimulation. Get my own profile Cited by View all All Since Citations h-index 42 22 iindex University of Cambridge, UK.
Probabilistic Event Structures and Domains. Constraining rule-based dynamics with types.
Email address for updates. On Probabilistic Distributed Strategies. Profunctors, open maps and bisimulation.
Juanito CamilleriGlynn Winskel: New articles related to this author’s research. Game semantics, in creating a broader foundation which supports concurrent games and strategiesa paper is accepted in the prestigious conference LICS to be held at the Fields Institute in Toronto, another is submitted; Systems biology, in the mathematical foundations of rule-based models and the extraction of chemical pathways form simulationsa paper is accepted for the journal MSCS, another is in preparation and collaboration with the kappa team at Harvard, Paris and Edinburgh continues; Concurrent separation logic, in showing that judgements in the logic are robust under refinement of commands Reynolds’ conjecture mainly the work of my teaching replacement, Jon Hayman.
Bistructures, bidomains, and linear logic. Thierry CoquandCarl A.
FioreGlynn Winskel: Logic and Program Semantics HildebrandtPrakash PanangadenGlynn Winskel: Marc de VismeGlynn Winskel: Concurrency, Graphs and Models The following articles are merged g,ynn Scholar. Non-angelic Concurrent Game Semantics. A side-effect of getting the ERC grant has been the need to terminate the Leverhulme fellowship on May 1.
Colloquium on Trees in Algebra and Programming, It has given me space to pursue my research and provided the means to rescue my former student Jon Hayman from industry by employing him as my teaching replacement.
I am happy to report that the situation has now completely changed. Linearity in Process Languages. A Linear Metalanguage for Concurrency.