| View all photos | View group photo | |
 |
 |
23rd International Conference on
Types for Proofs and Programs,
TYPES 2017
Budapest, Hungary, 29 May - 1 June 2017
23rd International Conference on
Types for Proofs and Programs,
Budapest, Hungary, 29 May - 1 June 2017
The meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. Since 2009, TYPES has been run as an independent conference series. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), Båstad (1992), Nijmegen (1993), Båstad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), Lökeberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016).
The TYPES areas of interest include, but are not limited to:
We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress.
University of St Andrews
An Architecture for Dependently Typed Applications in Idris
A useful pattern in dependently typed programming is to define a state transition system, for example the states and operations in a network protocol, as an indexed monad. We index each operation by its input and output states, thus guaranteeing that operations satisfy pre- and post-conditions, by typechecking. However, what if we want to write a program using several systems at once? What if we want to define a high level state transition system, such as a network application protocol, in terms of lower level states, such as network sockets and mutable variables?
In this talk, I will present an architecture for dependently typed applications in the Idris programming language, based on a hierarchy of state transition systems, and implemented in a generic data type ST. This is based on a monad indexed by contexts of resources, allowing us to reason about multiple state transition systems in the type of a function. Using ST, I will show: how to implement a state transition system as a dependent type, with type level guarantees on its operations; how to account for operations which could fail; how to combine state transition systems into a larger system; and, how to implement larger systems as a hierarchy of state transition systems. I will illustrate the system with a high level network application protocol, implemented in terms of POSIX network sockets.
University of Helsinki
Proof systems based on neighbourhood semantics
A method is presented for generating proof systems on the basis of neighbourhood semantics. The method is a generalisation of the internalisation of possible worlds semantics into sequent calculi. Its specific features will be illustrated through case studies from the treatment of counterfactuals and conditional beliefs.
THIS TALK IS CANCELLED.
TU Dortmund
Bounding Principles for Decision Problems with Intersection Types
The classical type-theoretic decision problems, inhabitation (given a type, is there a term having the type?) and typability (given a term, does it have a type?), are undecidable for intersection types. But one can consider bounding principles admitting of algorithmic solutions while retaining interesting levels of expressive power. We overview the status of known bounding principles, computational aspects of the associated decision problems, and some application perspectives.
We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2017.
Important dates:
When preparing the final versions, please:
Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop.
The conference proceedings can be downloaded.
Talks last 15 minutes followed by 5 minutes question time. You can find the slides for the uploaded talks here: https://www.dropbox.com/sh/unwi307a12pwyuh/AACtRaRU1Hlb1CbldGbqitf9a?dl=0.
TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2017 was held between 29 May and 1 June in Budapest, Hungary. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics, an open-access series of conference proceedings.
Submission to this post-proceedings volume is open to everyone, also to those who did not participate in the conference.
We would like to invite all researchers that study and apply type systems to share their results. In particular, we welcome submissions on the following topics:
Important dates:
Details:
Editors:
Registration for the conference is open at https://e-conf.com/eutypes2017/registration.
Registration fees:
| Early bird (before 10 May) | Normal (after 10 May) | |
| Normal participant | 250 EUR | 300 EUR |
| Student | 200 EUR | 250 EUR |
| Registration for only the first two days of the conference (COST MC meeting) | 170 EUR | 220 EUR |
The registration fee for participants and students includes:
The registration fee for COST MC participants who only come for the first two days includes:
We strongly recommend registering for the excursion because it is a great opportunity for discussion of research ideas in a relaxed environment and for general networking.
| Ticket for excursion on 30 May (not included in registration fee) | 30 EUR |
| Extra ticket for conference dinner on 31 May | 50 EUR |
Cancelling registration: if registration is cancelled, full refund is guaranteed until 10 May, 50% refund until 15 May.
Talks last 15 minutes followed by 5 minutes question time. You can find the slides for the uploaded talks here: https://www.dropbox.com/sh/unwi307a12pwyuh/AACtRaRU1Hlb1CbldGbqitf9a?dl=0.
| 29 May (Monday) (EUTypes meeting) | 30 May (Tuesday) (EUTypes meeting) | 31 May (Wednesday) | 1 June (Thursday) | |
| 8.30-9.00 | registration | |||
| 9.00-10.00 | session 1 (3 talks) | invited talk: Jakob Rehof | session 8 (3 talks) | invited talk: Edwin Brady |
| 10.00-10.20 | coffee break | coffee break | coffee break | coffee break |
| 10.20-11.20 | session 2 (3 talks) | session 6 (3 talks) | session 9 (3 talks) | session 14 (3 talks) |
| 11.20-11.40 | coffee break | coffee break | coffee break | coffee break |
| 11.40-12.40 | session 3 (3 talks) | session 7 (3 talks) | session 10 (3 talks) | session 15 (3 talks) |
| 12.40-14.20 | lunch | lunch (until 14.00) | lunch | lunch |
| 14.20-16.00 | session 4 (3 talks) + WG meetings | MC meeting + business meeting (14.00-15.30) | session 11 (5 talks) | session 16 (5 talks) |
| 16.00-16.30 | coffee break | excursion (15.30-20.00) | coffee break | coffee break |
| 16.30-18.10 | WG + dissemination meetings (until 17.00) | session 12 (5 talks) | session 17 (2 talks) (until 17.40) | |
| 18.40- | conference dinner |
| 9.00-10.00 | Session 5 (chair: Aleksy Schubert) | INVITED TALK: Jakob Rehof. Bounding Principles for Decision Problems with Intersection Types |
| 10.00-10.20 | coffee break | |
| 10.20-10.40 | Session 6 (chair: Fredrik Nordvall Forsberg) | Aleš Bizjak and Rasmus Ejlers Møgelberg. Presheaf semantics for guarded dependent type theory |
| 10.40-11.00 | Andreas Abel, Andrea Vezzosi and Théo Winterhalter. Normalization by Evaluation for Sized Dependent Types | |
| 11.00-11.20 | Thorsten Altenkirch, Ambrus Kaposi and András Kovács. Normalisation by Evaluation for a Type Theory with Large Elimination | |
| 11.20-11.40 | coffee break | |
| 11.40-12.00 | Session 7 (chair: Hugo Herbelin) | Thierry Coquand, Bassel Mannaa and Fabian Ruch. A Model of Type Theory in Stacks |
| 12.00-12.20 | Pierre-Marie Pédrot and Nicolas Tabareau. An Effectful Way to Eliminate Addiction to Dependence | |
| 12.20-12.40 | Valentin Blot. An interpretation of system F through bar recursion | |
| 12.40-14.00 | lunch | |
| 14.00-15.00 | EUTypes MC meeting (open to any conference participant) | |
| 15.00-15.30 | TYPES conference business meeting | |
| 15.30-20.00 | excursion |
Sightseeing tour by bus with English speaking guide. During the guided tour our guests get acquainted with the most beautiful sights of Budapest, have a short walk in Buda Castle including entrance to Matthias Church. The last stop of the program is a visit in a wine cellar (called Budafok Wine Town) in South Buda region. Wine tasting with assistance of a skilled Sommelier in the Zaborszky Cellar.
| Departure time: | 15.30 h |
| Meeting point: | at Danube gate of the Conference venue (1117 Budapest, Pázmány Péter sétány 1/c) |
| The excursion ends: | approx. 20.00 h at the Conference venue |
| Price: | EUR 30 / person |
| Please note: | Minimum number of participants: 30. After 23 May, registration is subject to available places left. |
Sightseeing on the Danube with dinner on Boat „Sirona”. During the 3-hour boat trip our guests can enjoy the wonderful panorama of the illuminated city, while a tasteful buffet dinner including drinks will be served on board.
| Departure time: | 19.00 h |
| Place of the departure: | ELTE Lágymányosi Dock, opposite to Conference venue (1117 Budapest, Pázmány Péter sétány 1/C) 47°28'18.8"N 19°03'52.8" (see map) |
| Meeting time: | 18.40 h |
| Meeting point: | at Danube gate of the Conference venue (1117 Budapest, Pázmány Péter sétány 1/c) |
| The boat trip ends: | at 22.30 at the pier at Jászai Mari tér, close to Margaret bridge on the Pest side (see map) |
The Conference Dinner is included in registration fee (regular/students).
Price of the extra ticket: EUR 50 / person.
The first two days of TYPES 2017, May 29 - 30 are organised by EUTypes Cost Action CA15123. 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.
The currency is Hungarian Forint (HUF), around 300 HUF is worth 1 Euro. You can use debit/credit cards in almost every shop and restaurant, but you may need cash in small pubs. The cheapest way to get cash is from an exchange bureau in the city centre. Ask your hotel or follow these instructions.
The conference will be held in the Lágymányos South Building of Eötvös Loránd University, see the map below. The address is Pázmány Péter sétány 1/C, Budapest 1117, Hungary. Look for the red hat on the following map. The lecture hall we will use is 0-823 Kitaibel Pál room, very close to the West entrance of the building which is marked with an arrow on the map.
Wifi access: you can use eduroam or the network Types2017 with password TypeTheoryApps.
We reserved 55 rooms altogether in the following hotels (see the above map):
Services such as booking.com and airbnb.com are known to work well in Budapest too.
The judgemental map of Budapest (google) is quite accurate about what the different areas are like. The conference venue is in the "more nerds" area.