Program | FSCD 2019

P R O G R A M

Tuesday 25 June

08:00	Registration and opening
09:00 - 10:00	FSCD Invited Talk
	Beniamino Accattoli A Fresh Look at the lambda-Calculus
10:00 - 10:30	Coffee Break
10:30 - 12:30	FSCD Theme: Lambda calculus
	Maciej Bendkowski Towards the average-case analysis of substitution resolution in lambda-calculus
	Pierre Vial Sequence Types for Hereditary Permutators
	Ugo Dal Lago and Thomas Leventis On the Taylor Expansion of Probabilistic lambda-terms
	Simona Kašterović and Michele Pagani The Discriminating Power of the Let-in Operator1in the Lazy Call-by-Name Probabilistic lambda-Calculus
12:30 - 14:00	Lunch Break
14:00 - 15:30	FSCD Theme: Calling Paradigms
	José Espírito Santo, Luís Pinto, and Tarmo Uustalu Modal embeddings and calling paradigms
	Małgorzata Biernacka and Witold Charatonik Deriving an Abstract Machine for Strong Call by Need
	Maciej Piróg, Piotr Polesiuk, and Filip Sieczkowski Typed Equivalence of Effect Handlers and Delimited Control
15:30 - 16:00	Coffee Break
16:00 - 17:30	FSCD Theme: Logic and models of computation
	Alejandro Díaz-Caro and Gilles Dowek Proof Normalisation in a Logic Identifying Isomorphic Propositions
	Dominique Larchey-Wendling and Yannick Forster Hilbert’s Tenth Problem in Coq
	Paulin Jacobé de Naurois Pointers in Recursion: Exploring the Tropics

19:00	Reception

08:00	Registration
09:00 - 10:00	FSCD Invited Talk
	Amy P. Felty A Linear Logical Framework in Hybrid
10:00 - 10:30	Coffee Break
10:30 - 12:30	FSCD Theme: Types
	Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, and Ivan Scagnetto lambda!-calculus, Intersection Types, and Involutions
	Luigi Liquori and Claude Stolze The Delta-calculus: Syntax and Types
	Niccolò Veltri and Niels van der Weide Guarded Recursion in Agda via Sized Types
	Ambrus Kaposi, Simon Huber, and Christian Sattler Gluing for type theory
12:30 - 14:00	Lunch Break
14:00 - 15:30	FSCD Theme: Homotopy Type Theory
	Thierry Coquand, Simon Huber, and Christian Sattler Homotopy canonicity for cubical type theory
	Jonathan Sterling, Carlo Angiuli, and Daniel Gratzer Cubical Syntax for Reflection-Free Extensional Equality
	Benedikt Ahrens, Dan Frumin, Marco Maggesi, and Niels van der Weide Bicategories in Univalent Foundations
15:30 - 16:00	Coffee Break
16:00 - 17:30	FSCD Theme: Semantics
	Clovis Eberhart, Tom Hirschowitz, and Alexis Laouar Template games, simple games, and Day convolution
	Thomas Ehrhard Differentials and distances in probabilistic coherence spaces
	Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, and Marco Maggesi Modular specification of monads through higher-order presentations

08:00	Registration
09:00 - 10:00	FSCD Invited Talk
	Hongseok Yang Some semantic issues in probabilistic programming languages
10:00 - 10:30	Coffee Break
10:30 - 12:30	FSCD Theme: Rewriting
	Mirai Ikebuchi A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods
	Alfons Geser, Dieter Hofbauer, and Johannes Waldmann Sparse Tiling through Overlap Closures for Termination of String Rewriting
	David M. Cerna and Temur Kutsia A generic framework for higher-order generalizations
	Rubén Rubio, Narciso Martí-Oliet, Isabel Pita, and Alberto Verdejo Model checking strategy-controlled rewriting systems (System Description)
12:30 - 14:00	Lunch Break
14:00 - 15:00	FSCD Theme: Rewriting and Types
	Łukasz Czajka and Cynthia Kop Polymorphic Higher-order Termination
	Frédéric Blanqui, Guillaume Genestier and Olivier Hermant Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting
15:00 - 15:30	Group Photo
17:00 - 22:30	Excursion & Banquet

08:00	Registration
09:00 - 10:00	FSCD Invited Talk
09:00 - 10:00	Sarah Winkler Extending Maximal Completion
10:00 - 10:30	Coffee Break
10:30 - 11:00	FSCD Theme: Rewriting
10:30 - 11:00	Claudia Faggian Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms
11:00 - 12:30	FSCD Theme: Linear Logic
	Ross Horne The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic
	Yosuke Fukuda and Akira Yoshimizu A Linear-logical Reconstruction of Intuitionistic Modal Logic S4
	Willem B. Heijltjes, Dominic J. D. Hughes, and Lutz Straßburger Proof nets for first-order additive linear logic
12:30 - 14:00	Lunch Break
14:00 - 15:30	FSCD General Meeting