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\n\n
We are seeking for short sub missions (~3-4 pages long) presenting (i) new comp leted results (ii) work in progress, or (iii) adve rtising recently published results. Suggested, but not exclusive, topics of interest for the worksho p are: Proof systems, Calculi, Type systems, Curry -Howard correspondence, Semantics, Tools, and Proo f theory and verification.
\n