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/9785/7-- -8-July-2018-Workshop-Programming-Reasoning-on-Inf inite-Structures-PARIS-Oxford-England DTSTAMP:20180313T133009 SUMMARY:Workshop "Programming & Reasoning on Infin ite Structures" (PARIS), Oxford, England DTSTART;VALUE=DATE:20180707 DTEND;VALUE=DATE:20180708 LOCATION:Oxford, England DESCRIPTION:Developing formal methods to program a nd reason about infinite data, whether inductive o r coinductive, is challenging and subject to numer ous recent research efforts. The understanding of the logical and computational principles underlyin g these notions is reaching a mature stage as illu strated by the numerous advances that have appeare d in the recent years. The workshop aims at gather ing researchers working on these topics as well as colleagues interested in understanding the recent results and open problems of this line of researc h. For outsiders, the workshop will offer tutoria l sessions and survey-like invited talks. For spec ialists of the topic, the workshop will permit to gather people working with syntactical or semantic al methods, people focusing on proof systems or pr ogramming languages, and foster exchanges and disc ussions benefiting from their various perspectives . The workshop is affiliated with FSCD 2018, as pa rt of the Federated Logic Conference of 2018 and i s funded by French ANR, RAPIDO project. We are seeking for short submissions (~3-4 pages long) p resenting (i) new completed results (ii) work in p rogress, or (iii) advertising recently published r esults. Suggested, but not exclusive, topics of in terest for the workshop are: Proof systems, Calcul i, Type systems, Curry-Howard correspondence, Sema ntics, Tools, and Proof theory and verification. X-ALT-DESC;FMTTYPE=text/html:
Developin g formal methods to program and reason about infin ite data, whether inductive or coinductive, is cha llenging and subject to numerous recent research e fforts. The understanding of the logical and compu tational principles underlying these notions is re aching a mature stage as illustrated by the numero us advances that have appeared in the recent years . The workshop aims at gathering researchers worki ng on these topics as well as colleagues intereste d in understanding the recent results and open pro blems of this line of research.
\n\nFor ou tsiders, the workshop will offer tutorial sessions and survey-like invited talks. For specialists of the topic, the workshop will permit to gather peo ple working with syntactical or semantical methods , people focusing on proof systems or programming languages, and foster exchanges and discussions be nefiting from their various perspectives. The work shop is affiliated with FSCD 2018, as part of the Federated Logic Conference of 2018 and is funded b y French ANR, RAPIDO project.
\n\np>
We are seeking for short submi ssions (~3-4 pages long) presenting (i) new comple ted results (ii) work in progress, or (iii) advert ising recently published results. Suggested, but n ot exclusive, topics of interest for the workshop are: Proof systems, Calculi, Type systems, Curry-H oward correspondence, Semantics, Tools, and Proof theory and verification.