Advertisement

Fooling the Parallel or Tester with Probability 8/27

  • Jean Goubault-LarrecqEmail author
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11760)

Abstract

It is well-known that the higher-order language PCF is not fully abstract: there is a program—the so-called parallel or tester, meant to test whether its input behaves as a parallel or—which never terminates on any input, operationally, but is denotationally non-trivial. We explore a probabilistic variant of PCF, and ask whether the parallel or tester exhibits a similar behavior there. The answer is no: operationally, one can feed the parallel or tester an input that will fool it into thinking it is a parallel or. We show that the largest probability of success of such would-be parallel ors is exactly 8/27. The bound is reached by a very simple probabilistic program. The difficult part is to show that that bound cannot be exceeded.

References

  1. 1.
    Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. III, pp. 1–168. Oxford University Press (1994)Google Scholar
  2. 2.
    Battenfeld, I.: Computational effects in topological domain theory. Electron. Notes Theor. Comput. Sci. 158, 59–80 (2006)CrossRefGoogle Scholar
  3. 3.
    Bird, B.: Introduction to Functional Programming using Haskell. Prentice-Hall Series in Computer Science. Prentice-Hall, Inc., Upper Saddle River, New Jersey (1998)Google Scholar
  4. 4.
    Ehrhard, T., Tasson, C., Pagani, M.: Probabilistic coherence spaces are fully abstract for probabilistic PCF. In: Jagannathan, S., Sewell, P. (eds.) Proceedings of 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014), pp. 309–320 (2014)Google Scholar
  5. 5.
    Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press, Cambridge (2003)CrossRefGoogle Scholar
  6. 6.
    Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory-Selected Topics in Point-Set Topology. New Mathematical Monographs, vol. 22. Cambridge University Press, Cambridge (2013)CrossRefGoogle Scholar
  7. 7.
    Goubault-Larrecq, J.: Full abstraction for non-deterministic and probabilistic extensions of PCF I: the angelic cases. J. Logic Algebraic Methods Program. 84(1), 155–184 (2015).  https://doi.org/10.1016/j.jlamp.2014.09.003MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Goubault-Larrecq, J.: Fooling the parallel or tester with probability 8/27 (2019). full version on arXiv:1903.12653 [cs.LO]
  9. 9.
    Goubault-Larrecq, J.: A probabilistic and non-deterministic call-by-push-value language. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019) (2019, to appear). full version on arXiv:1812.11573 [cs.LO]
  10. 10.
    Goubault-Larrecq, J., Palamidessi, C., Troina, A.: A probabilistic applied pi–calculus. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 175–190. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-76637-7_12CrossRefGoogle Scholar
  11. 11.
    Jones, C.: Probabilistic non-determinism. Ph.D. thesis, University of Edinburgh (1990). Technical report ECS-LFCS-90-105Google Scholar
  12. 12.
    Jones, C., Plotkin, G.: A probabilistic powerdomain of evaluations. In: Proceedings of the 4th Annual Symposium on Logic in Computer Science, pp. 186–195. IEEE Computer Society (1989)Google Scholar
  13. 13.
    Jung, A., Tix, R.: The troublesome probabilistic powerdomain. In: Edalat, A., Jung, A., Keimel, K., Kwiatkowska, M. (eds.) Proceedings of 3rd Workshop on Computation and Approximation. Electronic Lecture Notes in Computer Science, vol. 13, 23 p. Elsevier (1998)Google Scholar
  14. 14.
    Keimel, K., Lawson, J.: Measure extension theorems for \({T_0}\)-spaces. Topol. Appl. 149(1–3), 57–83 (2005)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(1), 223–255 (1977)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Sazonov, V.Y.: Expressibility of functions in D. Scott’s LCF language. Algebra i Logika 15(3), 308–330 (1976). Translated from RussianMathSciNetCrossRefGoogle Scholar
  17. 17.
    Vákár, M., Kammar, O., Staton, S.: A domain theory for statistical probabilistic programming. In: Proceedings of 46th ACM Symposium on Principles of Programming Languages (POPL 2019) (2019). arXiv:1811.04196 [cs.LO]CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.LSV, ENS Paris-Saclay, CNRS, Université Paris-SaclayCachanFrance

Personalised recommendations