BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7111@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20190228T110000
DTEND;TZID=Europe/Paris:20190228T123000
DTSTAMP:20241120T203423Z
URL:https://www.i2m.univ-amu.fr/evenements/lambda-calculus-and-probabilist
 ic-computation/
SUMMARY:Claudia Faggian (IRIF\, Université de Paris): Lambda Calculus and 
 Probabilistic Computation
DESCRIPTION:Claudia Faggian: In order to model higher-order probabilistic c
 omputation\, a natural approach is to take the lambda calculus as a paradi
 gm\, and to enrich it with an operator which models probabilistic choice. 
 The resulting calculus is however not confluent\; such an issue is typical
 ly handled in the literature by fixing a deterministic reduction strategy.
 \nFollowing [Plotkin75]\, we wish to preserve the key distinction between 
 a calculus and a programming language. The former defines terms and reduct
 ion rules\, and satisfy confluence\, the latter is specified by a determin
 istic strategy (an abstract machine). Standardization is what relates the 
 two: the programming language implements the standard strategy associated 
 to the calculus. We propose two probabilistic lambda calculi\, based respe
 ctively on the call-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 allows us to develop a unified\, modular approach.\n(joint w
 ork with Simona Ronchi 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