License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2019.13
URN: urn:nbn:de:0030-drops-105206
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10520/
Go to the corresponding LIPIcs Volume Portal

Dal Lago, Ugo ; Leventis, Thomas

On the Taylor Expansion of Probabilistic lambda-terms

pdf-format:
LIPIcs-FSCD-2019-13.pdf (0.6 MB)

Abstract

We generalise Ehrhard and Regnier's Taylor expansion from pure to probabilistic lambda-terms. We prove that the Taylor expansion is adequate when seen as a way to give semantics to probabilistic lambda-terms, and that there is a precise correspondence with probabilistic Böhm trees, as introduced by the second author. We prove this adequacy through notions of probabilistic resource terms and explicit Taylor expansion.

BibTeX - Entry

@InProceedings{dallago_et_al:LIPIcs:2019:10520,
  author =	{Ugo Dal Lago and Thomas Leventis},
  title =	{{On the Taylor Expansion of Probabilistic lambda-terms}},
  booktitle =	{4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)},
  pages =	{13:1--13:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-107-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{131},
  editor =	{Herman Geuvers},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10520},
  URN =		{urn:nbn:de:0030-drops-105206},
  doi =		{10.4230/LIPIcs.FSCD.2019.13},
  annote =	{Keywords: Probabilistic Lambda-Calculi, Taylor Expansion, Linear Logic}
}

Keywords: Probabilistic Lambda-Calculi, Taylor Expansion, Linear Logic
Collection: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)
Issue Date: 2019
Date of publication: 18.06.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI