[TYPES/announce] Call for participation: TYPES 2017. Registration is open

[Ambrus Kaposi]

 * registration is open
 * invited talks: Sara Negri, Edwin Brady, Jakob Rehof
 * 51 contributed talks


                      CALL FOR PARTICIPATION

   23rd International Conference on Types for Proofs and Programs,
                            TYPES 2017
                                and
                     EUTYPES Cost Action CA15123 meeting
                 Budapest, Hungary, 29 May - 1 June 2017

                     http://types2017.elte.hu



BACKGROUND

The TYPES meetings are a forum to present new and on-going work in all
aspects of type theory and its applications, especially in formalised
and computer assisted reasoning and computer programming.

The TYPES areas of interest include, but are not limited to:

 * foundations of type theory and constructive mathematics;
 * applications of type theory;
 * dependently typed programming;
 * industrial uses of type theory technology;
 * meta-theoretic studies of type systems;
 * proof assistants and proof technology;
 * automation in computer-assisted reasoning;
 * links between type theory and functional programming;
 * formalizing mathematics using type theory.



FINANCIAL SUPPORT

The first two days of TYPES 2017, May 29 - 30 are organised by EUTypes
Cost Action CA15123 (https://eutypes.cs.ru.nl). On May 30 there will
be an EUTypes Management Committee (MC) meeting, and on both days
there will be WG meetings. This means that members of the EUTypes MC
will be invited for these 2 days through the e-cost system, and their
cost of travel and stay will be covered. There will likely be some
funding for a limited number of other invited speakers. The funding is
subject to COST rules, and invitations will be sent out via the e-cost
system after the 1st of May.



INVITED SPEAKERS


 * Edwin Brady (University of St Andrews): An Architecture for
   Dependently Typed Applications in Idris

 * Sara Negri (University of Helsinki): TBA

 * Jakob Rehof (TU Dortmund): Bounding Principles for Decision
   Problems with Intersection Types



CONTRIBUTED TALKS

51 talks were accepted, see http://types2017.elte.hu/#accepted for the
list of accepted papers and http://types2017.elte.hu/#programme for
the programme.



REGISTRATION

Registration is open: http://types2017.elte.hu/#registration

The early bird fee is 250 EUR + 30 EUR for the excursion
(optional). Please register for the excursion because it is a great
opportunity for discussion of research ideas in a relaxed environment
and for general networking.

For students, the early bird registration fee is 200 EUR.



VENUE

Budapest is the capital of Hungary with around two million
inhabitants. The conference will be held at Eötvös Loránd
University. Among the graduates of this university were John von
Neumann and Paul Erdos. The conference dinner will take place during a
boat cruise on the river Danube which separates the Buda and Pest
parts of the city.



PROGRAMME COMMITTEE

 * Andreas Abel (Chalmers University Gothenburg)
 * Thorsten Altenkirch (University of Nottingham)
 * José Espirito Santo (University of Minho)
 * Fredrik Nordvall Forsberg (University of Strathclyde)
 * Silvia Ghilezan (University of Novi Sad)
 * Hugo Herbelin (INRIA Paris-Rocquencourt)
 * Martin Hofmann (Ludwig Maximilian University of Munich)
 * Ambrus Kaposi (Eötvös Loránd University) (co-chair)
 * Tamás Kozsik (Eötvös Loránd University) (co-chair)
 * Assia Mahboubi (INRIA)
 * Alexandre Miquel (University of the Republic, Uruguay)
 * Leonardo de Moura (Microsoft Research, Redmond, USA)
 * Keiko Nakata (SAP, Potsdam)
 * Andrew Polonsky (University Paris Diderot)
 * Simona Ronchi Della Rocca (Università di Torino)
 * Aleksy Schubert (University of Warsaw)
 * Wouter Swierstra (Utrecht University)
 * Tarmo Uustalu (Tallinn University of Technology)



CONTACT

Email: info at types2017.elte.hu

Organisers: Ambrus Kaposi, Tamás Kozsik, András Kovács and the
Department of Programming Languages and Compilers at the Faculty of
Informatics, Eötvös Loránd University, Budapest.