BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//6.4.7.3//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:5678@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20190228T110000
DTEND;TZID=Europe/Paris:20190228T123000
DTSTAMP:20201211T105227Z
URL:https://www.i2m.univ-amu.fr/events/lambda-calculus-and-probabilistic-c
omputation/
SUMMARY:Lambda Calculus and Probabilistic Computation - Claudia Faggian
DESCRIPTION:In order to model higher-order probabilistic computation\, a na
tural approach is to take the lambda calculus as a paradigm\, and to enric
h it with an operator which models probabilistic choice. The resulting cal
culus is however not confluent\; such an issue is typically handled in the
literature by fixing a deterministic reduction strategy.\nFollowing [Plot
kin75]\, we wish to preserve the key distinction between a calculus and a
programming language. The former defines terms and reduction rules\, and s
atisfy confluence\, the latter is specified by a deterministic strategy (a
n abstract machine). Standardization is what relates the two: the programm
ing language implements the standard strategy associated to the calculus.
We propose two probabilistic lambda calculi\, based respectively on the ca
ll-by-value and call-by-name parameter passing mechanism. The common root
of the two calculi is a further calculus based on Linear Logic\, which all
ows us to develop a unified\, modular approach.\n(joint work with Simona R
onchi Della Rocca)
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
020/01/Claudia_Faggian.jpg
CATEGORIES:SÃ©minaire Logique et Interactions
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR