The **Second International Conference on Formal Structures for Computation and Deduction** is co-located with ICFP 2017.

You can find all information at http://www.cs.ox.ac.uk/conferences/fscd2017/.

**Dates**

#### Mon 4 Sep Times are displayed in time zone: **Greenwich Mean Time : Belfast** change

Mon 4 Sep

Times are displayed in time zone:

**Greenwich Mean Time : Belfast**change10:30 - 10:45Other | Welcome message FSCD 2017 |

10:45 - 11:45Talk | Brzozowski Goes Concurrent -- A Kleene Theorem for Pomset Languages FSCD 2017 |

13:00 - 13:30Talk | Polynomial running times for polynomial-time oracle machines FSCD 2017 | ||

13:30 - 14:00Talk | A Curry-Howard Approach to Church’s Synthesis FSCD 2017 | ||

14:00 - 14:30Talk | Streett Automata Model Checking of Higher-Order Recursion Schemes FSCD 2017 A: Ryota Suzuki, A: Koichi Fujima, A: Naoki KobayashiUniversity of Tokyo, Japan, A: Takeshi TsukadaUniversity of Tokyo, Japan |

15:00 - 15:30Talk | Relating System F and λ2: A Case Study in Coq, Abella and Beluga FSCD 2017 | ||

15:30 - 16:00Talk | Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL FSCD 2017 Jasmin BlanchetteVrije Universiteit Amsterdam, A: Mathias FleuryMPI-INF, A: Dmitriy TraytelETH Zurich |

16:40 - 17:10Talk | A polynomial-time algorithm for the Lambek calculus with brackets of bounded order FSCD 2017 | ||

17:10 - 17:40Talk | A sequent calculus for semi-associativity FSCD 2017 | ||

17:40 - 18:10Talk | Combinatorial Flows and their Normalisation FSCD 2017 |

#### Tue 5 Sep Times are displayed in time zone: **Greenwich Mean Time : Belfast** change

Tue 5 Sep

Times are displayed in time zone:

**Greenwich Mean Time : Belfast**change10:30 - 11:30Talk | Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses FSCD 2017 Georg MoserUniversity of Innsbruck |

11:30 - 12:00Talk | Continuation Passing Style for Effect Handlers FSCD 2017 A: Daniel HillerströmThe University of Edinburgh, A: Sam LindleyUniversity of Edinburgh, UK, A: Robert AtkeyUniversity of Strathclyde, A: KC SivaramakrishnanUniversity of Cambridge |

13:00 - 13:30Talk | Confluence of an extension of Combinatory Logic by Boolean constants FSCD 2017 | ||

13:30 - 14:00Talk | Improving Rewriting Induction Approach for Proving Ground Confluence FSCD 2017 | ||

14:00 - 14:30Talk | The confluent terminating context-free substitutive rewriting system for the λ-calculus with surjective pairing and terminal type FSCD 2017 A: Yohji Akama |

15:00 - 15:30Talk | Is the optimal implementation inefficient? Elementarily not FSCD 2017 | ||

15:30 - 16:00Talk | Optimality and the Linear Substitution Calculus FSCD 2017 A: Pablo BarenbaumUniversity of Buenos Aires, Argentina / IRIF, France / University of Paris Diderot, France, A: Eduardo BonelliCONICET, Argentina / Universidad Nacional de Quilmes, Argentina |

16:40 - 17:10Talk | Generalized Refocusing: from Hybrid Strategies to Abstract Machines FSCD 2017 | ||

17:10 - 17:40Talk | Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or FSCD 2017 | ||

17:40 - 18:10Talk | Refutation of Sallé's Longstanding Conjecture FSCD 2017 |

#### Wed 6 Sep Times are displayed in time zone: **Greenwich Mean Time : Belfast** change

Wed 6 Sep

Times are displayed in time zone:

**Greenwich Mean Time : Belfast**change09:00 - 10:00Talk | Quantitative semantics for probabilistic programming FSCD 2017 |

10:30 - 11:00Talk | Displayed categories FSCD 2017 | ||

11:00 - 11:30Talk | List Objects with Algebraic Structure FSCD 2017 | ||

11:30 - 12:00Talk | There is only one notion of differentiation FSCD 2017 |

13:00 - 13:30Talk | A Fibrational Framework for Substructural and Modal Logics FSCD 2017 | ||

13:30 - 14:00Talk | Dinaturality between syntax and semantics FSCD 2017 | ||

14:00 - 14:30Talk | Models of Type Theory Based on Moore Paths FSCD 2017 |

15:00 - 15:30Talk | Böhm Reduction in Infinitary Term Graph Rewriting Systems FSCD 2017 | ||

15:30 - 16:00Talk | Infinite Runs in Abstract Completion FSCD 2017 |

16:40 - 17:10Talk | Negative Translations and Normal Modality FSCD 2017 |

17:10 - 17:20Other | Termination and Complexity Competition 2017 FSCD 2017 |

17:20 - 18:10Meeting | FSCD General Meeting FSCD 2017 |

#### Thu 7 Sep Times are displayed in time zone: **Greenwich Mean Time : Belfast** change

Thu 7 Sep

Times are displayed in time zone:

**Greenwich Mean Time : Belfast**change09:00 - 10:00Talk | Type systems for the relational verification of higher order programs FSCD 2017 |

10:30 - 11:00Talk | Arrays and References in Resource Aware ML FSCD 2017 | ||

11:00 - 11:30Talk | The Complexity of Principal Inhabitation FSCD 2017 | ||

11:30 - 11:59Talk | Types as Resources for Classical Natural Deduction FSCD 2017 |