Program

9:00  – 10:00


Keynote FSCD
Tobias Nipkow

10:00 – 10:30


Coffee break

10:30 – 12:30  Session 1


On upper bounds on the Church-Rosser theorem
Ken-Etsu Fujita
Confluence of Conditional Term Rewrite Systems via Transformations
Karl Gmeiner
An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages
Nils Dallmeyer, Manfred Schmidt-Schauß
An extension of proof graphs for disjunctive parameterised Boolean equation systems
Yutaro Nagae, Masahiko Sakai

12:30 – 14:00


Lunch

14:00 – 16:00  Session 2


Invited talk: The Complexity of Abstract Machines
Beniamino Accattoli
Sound Structure-Preserving Transformation for Ultra-Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
Ryota Nakayama, Naoki Nishida, Masahiko Sakai
Reversible Term Rewriting in Practice
Naoki Nishida, Adrian Palacios, German Vidal

16:00 – 16:30


Coffee break