{"id":151,"date":"2016-05-26T17:45:48","date_gmt":"2016-05-26T15:45:48","guid":{"rendered":"https:\/\/project.inria.fr\/wpte2016\/?page_id=151"},"modified":"2016-05-26T18:11:26","modified_gmt":"2016-05-26T16:11:26","slug":"program","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/wpte2016\/program\/","title":{"rendered":"Program"},"content":{"rendered":"

9:00 \u00a0– 10:00<\/strong><\/span><\/p>\n

\n

Keynote FSCD<\/em><\/span><\/strong>
\n Tobias Nipkow<\/span><\/p>\n

10:00 – 10:30<\/strong><\/span><\/p>\n

\n

Coffee break<\/p>\n

10:30 – 12:30 \u00a0Session 1<\/span><\/strong><\/p>\n

\n

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

12:30 – 14:00<\/strong><\/span><\/p>\n

\n

Lunch<\/p>\n

14:00 – 16:00 \u00a0Session 2<\/strong><\/span><\/p>\n

\n

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

16:00 – 16:30<\/strong><\/span><\/p>\n

\n

Coffee break<\/p>","protected":false},"excerpt":{"rendered":"

9:00 \u00a0– 10:00 Keynote FSCD Tobias Nipkow 10:00 – 10:30 Coffee break 10:30 – 12:30 \u00a0Session 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\u00df An extension of proof graphs … <\/p>\n

Continue reading<\/a><\/p>\n","protected":false},"author":686,"featured_media":0,"parent":0,"menu_order":7,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-151","page","type-page","status-publish","hentry","nodate","item-wrap"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/pages\/151","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/users\/686"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/comments?post=151"}],"version-history":[{"count":6,"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/pages\/151\/revisions"}],"predecessor-version":[{"id":157,"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/pages\/151\/revisions\/157"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/wpte2016\/wp-json\/wp\/v2\/media?parent=151"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}