\n

CL&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&C will be held as a satellite w orkshop of FSCD 2018 (former TLCA + RTA).

\n\nInvited Speaker: Alex Simpson.

\n\n

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
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 .

\n