A Relational Account of Call-by-Value Sequentiality

We construct a model for FPC, a purely functional, sequential, call-by-value language. The model is built from partial continuous functions, in the style of Plotkin, further constrained to be uniform with respect to a class of logical relations. We prove that the model is fully abstract.

[1]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[2]  Sibylle B. Fröschle,et al.  On Plain and Hereditary History-Preserving Bisimulation , 1999 .

[3]  Peter W. O'Hearn,et al.  Kripke Logical Relations and PCF , 1995, Inf. Comput..

[4]  Kim G. Larsen,et al.  Formal Verification of a Power Controller Using the Real-Time Model Checker UPPAAL , 1999, ARTS.

[5]  J. Girard.  Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[6]  Peter W. O'Hearn,et al.  Parametricity and local variables , 1995, JACM.

[7]  I. Stark,et al.  Domains and Denotational Semantics History Accomplishments and Open Problems , 1996 .

[8]  David B. MacQueen,et al.  The Definition of Standard ML (Revised) , 1997 .

[9]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[10]  Jon G. Riecke,et al.  Extensions to Type Systems Can Preserve Operational Equivalences , 1994, TACS.

[11]  J. Fenstad.  Proceedings of the Second Scandinavian Logic Symposium , 1971 .

[12]  George Tsebelis,et al.  A GAME-THEORETIC ANALYSIS , 1990 .

[13]  Jon G. Riecke,et al.  Semantic Orthogonality of Type Disciplines , 1997 .

[14]  K. Mulmuley.  Full Abstraction and Semantic Equivalence , 1987 .

[15]  Ian Stark.  Names, Equations, Relations: Practical Ways to Reason about new , 1997, TLCA.

[16]  Adam Obtulowicz,et al.  Partiality, Cartesian closedness and Toposes , 1989, Inf. Comput..

[17]  Alessandro Panconesi,et al.  Fast Distributed Algorithms for Brooks-Vizing Colourings (Extended Abstract) , 1997 .

[18]  Peter Bro Miltersen.  Two Notes on the Computational Complexity of One-Dimensional Sandpiles , 1999 .

[19]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[20]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[21]  Ralph Loader.  Finitary PCF is not decidable , 2001, Theor. Comput. Sci..

[22]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[23]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[24]  Nobuko Yoshida,et al.  Game-Theoretic Analysis of Call-by-Value Computation , 1997, Theor. Comput. Sci..

[25]  Jon G. Riecke,et al.  A Relational Account of Call-by-Value Sequentiality , 1997 .

[26]  P. Freyd.  Algebraically complete categories , 1991 .

[27]  Peter W. O'Hearn,et al.  From Algol to polymorphic linear lambda-calculus , 2000, JACM.

[28]  R. Viswanathan,et al.  Isolating Side E ects in Sequential , 1995 .

[29]  Guy McCusker.  Games and definability for FPC , 1997, Bull. Symb. Log..

[30]  Marcelo P. Fiore,et al.  Lambda Definability with Sums via Grothendieck Logical Relations , 1999, TLCA.

[31]  Hanno Nickau.  Hereditarily Sequential Functionals , 1994, LFCS.

[32]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[33]  Glynn Winskel,et al.  A theory of recursive domains with applications to concurrency , 1997, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[34]  Anders Sandholm,et al.  A relational account of call-by-value sequentiality , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[35]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[36]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[37]  Andrew M. Pitts,et al.  Relational Properties of Domains , 1996, Inf. Comput..

[38]  Ramesh Viswanathan,et al.  Isolating side effects in sequential languages , 1995, POPL '95.

[39]  Pierre-Louis Curien,et al.  Categorical Combinators , 1986, Inf. Control..

[40]  Ivan Damgård.  An error in the mixed adversary protocol by Fitzi, Hirt and Maurer , 1999, IACR Cryptol. ePrint Arch..

[41]  Michael Marz.  A fully abstract model for sequential computation , 2000, Electron. Notes Theor. Comput. Sci..

[42]  Albert R. Meyer.  Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis , 1988, LICS 1988.

[43]  Jon G. Riecke,et al.  Fully abstract translations between functional languages , 1991, POPL '91.

[44]  Alley Stoughton,et al.  Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[45]  Robin Milner,et al.  Definition of standard ML , 1990 .

[46]  Guy McCusker.  Games and Full Abstraction for FPC , 2000, Inf. Comput..

[47]  K. Sieber.  Applications of Categories in Computer Science: Reasoning about sequential functions via logical relations , 1992 .

[48]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[49]  Martín Abadi,et al.  Syntactic considerations on recursive types , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[50]  Claus Brabrand,et al.  A Runtime System for Interactive Web Services , 1999, Comput. Networks.

[51]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.

[52]  Jerzy Tiuryn,et al.  A New Characterization of Lambda Definability , 1993, TLCA.

[53]  C.-H. Luke Ong,et al.  Pi-calculus, dialogue games and full abstraction PCF , 1995, FPCA '95.

[54]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[55]  Alley Stoughton,et al.  Studying the Fully Abstract Model of PCF within its Continuous Function Model , 1993, TLCA.

[56]  Christian N. S. Pedersen,et al.  Measures on Hidden Markov Models , 1999 .

[57]  Mogens Nielsen,et al.  Hereditary History Preserving Simulation is Undecidable , 1999 .

[58]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[59]  Glynn Winskel,et al.  Event Structures as Presheaves -Two Representation Theorems , 1999, CONCUR.

[60]  Egidio Astesiano,et al.  Nondeterminism and Fully Abstract Models , 1980, RAIRO Theor. Informatics Appl..

[61]  Gonzalo E. Reyes,et al.  A Note on Frame Distributions , 1997 .

[62]  C.-H. Luke Ong,et al.  Pi-Calculus, Dialogue Games and PCF. , 1995 .

[63]  Glynn Winskel,et al.  Relational Semantics of Non-Deterministic Dataflow , 1997 .

[64]  Alessandro Panconesi,et al.  On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[65]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[66]  John C. Reynolds,et al.  The essence of ALGOL , 1997 .

[67]  Samson Abramsky,et al.  Full Abstraction for PCF * ( Extended Abstract ) , 1994 .