Paper: The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name (at LICS 2020)

Authors: Gianluca Curzi Michele Pagani

Abstract

No Abstract Available

BibTeX

  @InProceedings{CurziPagani-TheBenefitofBeingNo,
    author = 	 {Gianluca Curzi and Michele Pagani},
    title = 	 {The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name},
    booktitle =  {Proceedings of the Thirty fifth Annual IEEE Symposium on Logic in Computer Science (LICS 2020)},
    year =	 {2020},
    month =	 {July}, 
    pages =      {327--340},
    location =   {Saarbrucken, Germany}, 
    publisher =	 {IEEE Computer Society Press}
  }