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/2014/newsitem/5567/15- 16-May-2014-Proof-Computation-and-Complexity-PCC-2 014-Paris-France DTSTAMP:20140223T000000 SUMMARY:Proof, Computation and Complexity (PCC 201 4), Paris, France DTSTART;VALUE=DATE:20140515 DTEND;VALUE=DATE:20140516 LOCATION:Paris, France DESCRIPTION:The aim of PCC is to stimulate researc h in proof theory, computation, and complexity, fo cusing on issues which combine logical and computa tional aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of in terest are (non-exhaustively listed) foundations f or specification and programming languages, logica l methods in specification and program development including program extraction from proofs, type th eory, new developments in structural proof theory, and implicit computational complexity. PCC 201 4 is organised as a satellite event of TYPES 2014. Registration for PCC 2014 will be through the TYP ES 2014 site, with details to be announced later o n. The workshop is scheduled for the full day of F riday, May 16. The participants are encouraged to attend the Thursday sessions of TYPES 2014. If the number and quality of submissions justifies this, then PCC 2014 will start in the afternoon of Thur sday, May 15. This will be known by the notificati on date. For more information, see http://www.ir it.fr/PCC2014/ PCC is intended to be a lively fo rum for presenting and discussing recent work. We solicit contributions in the fields of PCC, non-ex haustively described above. Deadline for proposing a contributed talk: Monday, March 3, 2014. X-ALT-DESC;FMTTYPE=text/html:
\n

\n The aim of PCC is to stimulate research in pr oof theory, computation,\n and complexity, focusing on issues which combine logical and\n computational aspects. Topics may include appl ications of formal\n inference systems in c omputer science, as well as new developments in\n proof theory motivated by computer science demands. Specific areas of\n interest are ( non-exhaustively listed) foundations for specifica tion\n and programming languages, logical m ethods in specification and\n program devel opment including program extraction from proofs, t ype\n theory, new developments in structura l proof theory, and implicit\n computationa l complexity.\n

\n

\n PCC 2014 is organised as a satellite event of TYPES\n 2014. Registration for PCC 2014 will be thr ough the TYPES 2014\n site, with details to be announced later on. The workshop is\n s cheduled for the full day of Friday, May 16. The p articipants\n are encouraged to attend the Thursday sessions of TYPES\n 2014. If the n umber and quality of submissions justifies this,\n then PCC 2014 will start in the afternoon of Thursday, May 15.\n This will be known b y the notification date.\n

\n \n \n

For more information, see\n http://www.irit.fr/PCC2014/\n

\n < /div>
\n

\n PCC is intended to be a lively forum for presenting and\n disc ussing recent work. We solicit contributions in th e fields\n of PCC, non-exhaustively describ ed above. Deadline for\n proposing a contr ibuted talk: Monday, March 3, 2014.\n

\n
URL:/NewsandEvents/Archives/2014/newsitem/5567/15- 16-May-2014-Proof-Computation-and-Complexity-PCC-2 014-Paris-France END:VEVENT END:VCALENDAR