See this document in CiteSeerX!

Pi-Calculus, Dialogue Games and PCF (1995)  (Make Corrections)  
J. M. E. Hyland, C.-H. L. Ong



  Home/Search   Context   Related

 
View or download:
comlab.ox.ac.uk/pub/Docu...fpca95.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  comlab.ox.ac.uk/ou...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantical framework in which to seek to unify analyses of both the qualitative (correctness) as well as the quantitative (efficiency) properties of programming languages. This paper reports work arising from a recent construction of an order (or inequationally) fully abstract model for Scott's functional programming language... (Update)

Active bibliography (related documents):   More   All
0.3:   Games and Full Abstraction for the Lazy lambda-calculus - Abramsky, McCusker (1995)   (Correct)
0.2:   Call-by-value games (Extended Abstract) - Abramsky, McCusker   (Correct)
0.2:   Correspondence between operational and denotational semantics: the.. - Ong (1995)   (Correct)

Similar documents based on text:   More   All
1.3:   On full abstraction for PCF: I. Models, observables and the.. - Hyland, Ong   (Correct)
0.9:   Full Abstraction for PCF - Abramsky, Jagadeesan, Malacaria (1996)   (Correct)
0.7:   A Universal Innocent Game Model For The Böhm Tree Lambda Theory - Ker, Nickau, Ong   (Correct)

BibTeX entry:   (Update)

@misc{ hyland-picalculus,
  author = "J. M. E. Hyland and C.-H. L. Ong",
  title = "Pi-Calculus, Dialogue Games and PCF",
  url = "citeseer.ist.psu.edu/hyland95picalculu.html" }
Citations (may not include all citations):
2732   Communicating Sequential Processes (context) - Hoare - 1985
1933   Communication and Concurrency (context) - Milner - 1989
854   Information and Computation (context) - Milner, Parrow et al. - 1992
359   Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
283   Theoretical Computer Science (context) - Plotkin, language - 1977
248   Expressing mobility (context) - Sangiorgi - 1993
194   Functions as processes (context) - Milner - 1990
175   Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
159   The Chemical Abstract Machine (context) - Berry, Boudol - 1990
147   abstraction and parametric polymorphism (context) - Reynolds - 1983
144   Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
130   Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993
87   call-by-value and the lambda calculus (context) - Plotkin - 1975
49   Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
48   Hereditarily sequential functionals - Nickau - 1994
29   Fair games and full completeness for Multiplicative Linear L.. - Hyland, Ong - 1993
18   Fully abstract models of typed lambda-calculus (context) - Milner - 1977
17   Correspondence between operational and denotational semantic.. - Ong - 1995
10   Kripke logical relations and PCF - O'Hearn, Riecke - 1994
5   Progress in Theoretical Computer Science Series (context) - Curien, Sequential et al. - 1993
4   uk in directory papers/Ong (context) - Hyland, Ong et al. - 1994

Documents on the same site (http://www.comlab.ox.ac.uk/oucl/users/luke.ong/publications.html):   More
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997)   (Correct)
Non-Determinism in a Functional Setting (Extended Abstract) - Ong (1993)   (Correct)
Correspondence between Operational and Denotational Semantics - Ong (1995)   (Correct)

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