From Qualitative to Quantitative Semantics - By Change of Base

We give a general description of the transition from qualitative models of programming languages to quantitative ones, as a change of base for enriched categories. This is induced by a monoidal functor from the category of coherence spaces to the category of modules over a complete semiring $${\mathcal {R}}$$. Using the properties of this functor, we characterise the requirements for the change of base to preserve the structure of a Lafont category model of linear type theory with free exponential, and thus to give an adequate semantics of erratic PCF with scalar weights from $${\mathcal {R}}$$. Moreover, this model comes with a meaning-preserving functor from the original, qualitative one, which we may use to interpret side-effects such as state. As an example, we show that the game semantics of Idealized Algol bears a natural enrichment over the category of coherence spaces, and thus gives rise by change of base to a $${\mathcal {R}}$$-weighted model, which is fully abstract. We relate this to existing categories of probabilistic games and slot games.

[1]  Guy McCusker,et al.  Understanding Game Semantics Through Coherence Spaces , 2010, MFPS.

[2]  Guy McCusker,et al.  Imperative Programs as Proofs via Game Semantics , 2011, LICS.

[3]  R. Rosebrugh,et al.  Normed Spaces and the Change of Base for Enriched Categories , 2008 .

[4]  Thomas Ehrhard Hypercoherences: a strongly stable model of linear logic , 1995 .

[5]  Nicolas Tabareau,et al.  An explicit formula for the free exponential modality of linear logic , 2009, Mathematical Structures in Computer Science.

[6]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[7]  Giulio Manzonetto,et al.  Weighted Relational Models of Typed Lambda-Calculi , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[8]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[9]  Vincent Danos,et al.  Probabilistic game semantics , 2002, TOCL.

[10]  François Lamarche,et al.  Quantitative Domains and Infinitary Algebras , 1992, Theor. Comput. Sci..

[11]  Giulio Manzonetto,et al.  Constructing differential categories and deconstructing categories of games , 2013, Inf. Comput..

[12]  Glynn Winskel,et al.  Concurrent Strategies , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[13]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[14]  Dan R. Ghica,et al.  The regular-language semantics of second-order , 2003 .

[15]  Thomas Ehrhard,et al.  Believe it or not, AJM's games model is a model of classical linear logic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[16]  Russell Harmer,et al.  A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[17]  James Laird A Categorical Semantics of Higher Order Store , 2002, CTCS.

[18]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[19]  J. Girard,et al.  Proofs and types , 1989 .

[20]  Dan R. Ghica,et al.  Slot games: a quantitative model of computation , 2005, POPL '05.

[21]  Samson Abramsky,et al.  Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..

[22]  Ulrich Kohlenbach,et al.  Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation , 1993, Ann. Pure Appl. Log..

[23]  J. Laird Fixed Points In Quantitative Semantics , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[24]  Gordon D. Plotkin,et al.  Complete axioms for categorical fixed-point operators , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[25]  G. M. Kelly,et al.  A note on actions of a monoidal category. , 2001 .