BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2018/newsitem/9731/7-J
 uly-2018-Seventh-International-Workshop-on-Classic
 al-Logic-and-Computation-CL-C-2018-Oxford-England
DTSTAMP:20180301T152529
SUMMARY:Seventh International Workshop on Classica
 l Logic and Computation  (CL&C 2018), Oxford, Engl
 and
DTSTART;VALUE=DATE:20180707
DTEND;VALUE=DATE:20180707
LOCATION:Oxford, England
DESCRIPTION:CL&C is focused on the interplay betwe
 en, on one side, the exploration of the computatio
 nal content of classical mathematical proofs, and 
 on the other side, the languages and the semantica
 l models proposed in computer science for this tas
 k: continuations, game models, denotational models
 , learning models and so forth. The scientific aim
  of this workshop is to bring together researchers
  from both proof theory and computer science and t
 o exchange ideas. This year, CL&C will be held as 
 a satellite workshop of FSCD 2018 (former TLCA + R
 TA).  Invited Speaker: Alex Simpson.  The PC recog
 nises two kinds of papers: it will distinguish bet
 ween accepted (full) papers that contain unpublish
 ed results not submitted elsewhere, which we publi
 sh on EPTCS, and presentations of (short) papers a
 bout work in progress or overview of papers publis
 hed elsewhere. We have room for informal talks, to
 o. Therefore participants are encouraged to presen
 t: work in progress, overviews of more extensive w
 ork, and programmatic position papers. All submitt
 ed papers will be reviewed to normal standards. Pr
 oceedings will appear on EPTCS.
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>CL&amp;C 
 is focused on the interplay between, on one side, 
 the exploration of the computational content of cl
 assical mathematical proofs, and on the other side
 , the languages and the semantical models proposed
  in computer science for this task: continuations,
  game models, denotational models, learning models
  and so forth. The scientific aim of this workshop
  is to bring together researchers from both proof 
 theory and computer science and to exchange ideas.
  This year, CL&amp;C will be held as a satellite w
 orkshop of FSCD 2018 (former TLCA + RTA).</p>\n\n 
  <p>Invited Speaker: Alex Simpson.</p>\n</div><div
 >\n  <p>The PC recognises two kinds of papers: it 
 will distinguish between accepted (full) papers th
 at contain unpublished results not submitted elsew
 here, which we publish on EPTCS, and presentations
  of (short) papers about work in progress or overv
 iew of papers published elsewhere. We have room fo
 r informal talks, too. Therefore participants are 
 encouraged to present: work in progress, overviews
  of more extensive work, and programmatic position
  papers. All submitted papers will be reviewed to 
 normal standards. Proceedings will appear on EPTCS
 .</p>\n</div>
URL:http://www.di.unito.it/~stefano/CL&C/CL&C18.ht
 m
CONTACT:Stefano Berardi at stefano at di.unito.it
END:VEVENT
END:VCALENDAR