Abstract
Probabilistic coherence spaces (PCoh) yield a semantics of higher-order probabilistic computation, interpreting types as convex sets and programs as power series. We prove that the equality of interpretations in Pcoh characterizes the operational indistinguishability of programs in PCF with a random primitive.
This is the first result of full abstraction for a semantics of probabilistic PCF. The key ingredient relies on the regularity of power series.
Along the way to the theorem, we design a weighted intersection type assignment system giving a logical presentation of PCoh.
Supplemental Material
- S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163(2):409--470, Dec. 2000. Google Scholar
Digital Library
- G. Boudol, P.-L. Curien, and C. Lavatelli. A semantics for lambda calculi with resources. Math. Struct. Comp. Sci., 9(4):437--482, 1999. Google Scholar
Digital Library
- A. Bucciarelli, A. Carraro, T. Ehrhard, G. Manzonetto, et al. Full abstraction for resource calculus with tests. In CSL11 -- Annual Conference of the EACSL, volume 12, pages 97--111, 2011.Google Scholar
- V. Danos and T. Ehrhard. Probabilistic coherence spaces as a model of higher-order probabilistic computation. Inf. Comput., 209(6):966--991, 2011. Google Scholar
Digital Library
- V. Danos and R. Harmer. Probabilistic game semantics. ACM Transactions on Computational Logic, 3(3):359--382, July 2002. Google Scholar
Digital Library
- D. de Carvalho. Execution Time of λ-Terms via Denotational Semantics and Intersection Types. Preprint, 2009.Google Scholar
- T. Ehrhard. On Köthe sequence spaces and linear logic. Math. Struct. Comput. Sci., 12:579--623, 2002. Google Scholar
Digital Library
- T. Ehrhard. Finiteness spaces. Math. Struct. Comput. Sci., 1 (4):615--646, 2005. Google Scholar
Digital Library
- T. Ehrhard and L. Regnier. The Differential Lambda-Calculus. Theor. Comput. Sci., 309(1):1--41, 2003. Google Scholar
Digital Library
- J.-Y. Girard. The system F of variable types, fifteen years later. Theor. Comput. Sci., 45:159--192, 1986. Google Scholar
Digital Library
- J.-Y. Girard. Linear logic. Theor. Comput. Sci., 50:1--102, 1987. Google Scholar
Digital Library
- J.-Y. Girard. Normal functors, power series and lambda-calculus. Ann. Pure Appl. Logic, 37(2):129--177, 1988.Google Scholar
Cross Ref
- J.-Y. Girard. Coherent banach spaces: a continuous denotational semantics. Theor. Comput. Sci., 227:297, 1999. Google Scholar
Digital Library
- J.-Y. Girard. Between logic and quantic: a tract. In T. Ehrhard, J.-Y. Girard, P. Ruet, and P. Scott, editors, Linear Logic in Computer Science, volume 316 of London Math. Soc. Lect. Notes Ser. CUP, 2004.Google Scholar
- J. Goubault-Larrecq and D. Varacca. Continuous random variables. In LICS, pages 97--106. IEEE Computer Society, 2011. Google Scholar
Digital Library
- É. Goursat. Cours d'analyse mathématique. Tome I. Gauthier-Villars, 1918.Google Scholar
- R. Hasegawa. Two applications of analytic functors. Theor. Comput. Sci., 272(1-2):113--175, 2002. Google Scholar
Digital Library
- M. Hyland and L. Ong. On full abstraction for PCF. Information and Computation, 163(2):285--408, Dec. 2000. Google Scholar
Digital Library
- C. Jones and G. Plotkin. A probabilistic powerdomains of evaluation. In LICS. IEEE Computer Society, 1989. Google Scholar
Digital Library
- A. J. Kfoury and J. B.Wells. Principality and decidable type inference for finite-rank intersection types. In POPL, pages 161--174, 1999. Google Scholar
Digital Library
- U. D. Lago and M. Zorzi. Probabilistic operational semantics for the lambda calculus. RAIRO - Theor. Inf. and Applic., 46(3):413--450, 2012.Google Scholar
Cross Ref
- J. Laird, G. Manzonetto, G. McCusker, and M. Pagani. Weighted relational models of typed lambda-calculi. In LICS 2013. IEEE Press, June 2013.Google Scholar
Digital Library
- R. Milner. Fully abstract models of typed lambda-calculi. Theor. Comput. Sci., 4:1--22, 1977.Google Scholar
Cross Ref
- R. Milner and C. Strachey. A Theory of Programming Language Semantics. Chapman and Hall, London, 1976.Google Scholar
- E. Moggi. Computational lambda-calculus and monads. In LICS, pages 14--23. IEEE Computer Society, 1989. Google Scholar
Digital Library
- A. D. Pierro, C. Hankin, and H. Wiklicky. Probabilistic lambdacalculus and quantitative program analysis. J. Log. Comput., 15(2): 159--179, 2005. Google Scholar
Digital Library
- G. D. Plotkin. A powerdomain construction. SIAM J. Comput., 5(3): 452--487, 1976.Google Scholar
Digital Library
- G. D. Plotkin. LCF considered as a programming language. Theor. Comput. Sci., 5(3):225--255, 1977.Google Scholar
Cross Ref
- N. Saheb-Djahromi. Cpo's of measures for nondeterminism. Theor. Comput. Sci., 12:19--37, 1980.Google Scholar
Cross Ref
- D. Scott. Continuous lattices. In Lawvere, editor, Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Math., pages 97--136. Springer, 1972.Google Scholar
Index Terms
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Recommendations
Probabilistic coherence spaces are fully abstract for probabilistic PCF
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesProbabilistic coherence spaces (PCoh) yield a semantics of higher-order probabilistic computation, interpreting types as convex sets and programs as power series. We prove that the equality of interpretations in Pcoh characterizes the operational ...
Full Abstraction for Probabilistic PCF
Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and DatabasesWe present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-by-name, we allow a call-by-value ...
The Computational Meaning of Probabilistic Coherence Spaces
LICS '11: Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer ScienceWe study the probabilistic coherent spaces--a denotational semantics interpreting programs by power series with non negative real coefficients. We prove that this semantics is adequate for a probabilistic extension of the untyped $\lambda$-calculus: the ...







Comments