RTA-TLCA 2014 LNCS PROCEEDINGS: AUTHOR INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A B C D E F G H J K L M N P R S T U V Y Z

A
Abel, Andreas	Unnesting of Copatterns (PDF, talk)
Aoto, Takahito	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (PDF, talk)
Aubert, Clément	Unification and Logarithmic Space (PDF, talk)
B
Bae, Kyungmin	Predicate Abstraction of Rewrite Theories (PDF, talk)
Bagnol, Marc	Unification and Logarithmic Space (PDF, talk)
Berardi, Stefano	Ramsey Theorem as an intuitionistic property of well founded relations (PDF, talk)
Berger, Martin	Process Types as a Descriptive Tool for Interaction: Control and the Pi-Calculus (PDF)
Birkedal, Lars	A Model of Countable Nondeterminism in Guarded Type Theory (PDF, talk)
Bizjak, Aleš	A Model of Countable Nondeterminism in Guarded Type Theory (PDF, talk)
Bruggink, Sander	Termination of Cycle Rewriting (PDF, talk)
Burel, Guillaume	Cut Admissibility by Saturation (PDF, talk)
C
Ciobaca, Stefan	All-Path Reachability Logic (PDF, talk)
Creus, Carles	Automatic Evaluation of Context-Free Grammars (System Description) (PDF, talk) Tree Automata with Height Constraints between Brothers (PDF, talk)
Czajka, Łukasz	A Coinductive Confluence Proof for Infinitary Lambda-Calculus. (PDF, talk)
D
de Carvalho, Daniel	An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (PDF, talk)
de Vrijer, Roel	Proof terms for infinitary rewriting (PDF, talk)
Dershowitz, Nachum	Confluence by Critical Pair Analysis (PDF, talk)
Dezani-Ciancaglini, Mariangiola	Preciseness of subtyping on intersection and union types (PDF, talk)
E
Escardo, Martin	Abstract datatypes for real numbers in type theory (PDF, talk)
F
Fu, Peng	Self Types for Dependently Typed Lambda Encodings (PDF, talk)
Fuhs, Carsten	First-Order Formative Rules (PDF, talk)
G
Gambino, Nicola	A unified approach to Univalent Foundations and Homotopical Algebra (PDF)
Ghilezan, Silvia	Preciseness of subtyping on intersection and union types (PDF, talk)
Godoy, Guillem	Automatic Evaluation of Context-Free Grammars (System Description) (PDF, talk) Tree Automata with Height Constraints between Brothers (PDF, talk)
H
Hirokawa, Nao	Automated Complexity Analysis Based on Context-Sensitive Rewriting (PDF, talk)
Hofmann, Martin	Amortised Resource Analysis and Typed Polynomial Interpretations (PDF, talk)
Honda, Kohei	Process Types as a Descriptive Tool for Interaction: Control and the Pi-Calculus (PDF)
J
Jouannaud, Jean-Pierre	Confluence by Critical Pair Analysis (PDF, talk)
K
Koenig, Barbara	Termination of Cycle Rewriting (PDF, talk)
Kop, Cynthia	First-Order Formative Rules (PDF, talk)
Kusakari, Keiichirou	Nagoya Termination Tool (PDF, talk)
L
Liu, Jiaxiang	Confluence by Critical Pair Analysis (PDF, talk)
Lombardi, Carlos	Proof terms for infinitary rewriting (PDF, talk)
M
Maieli, Roberto	Construction of retractile proof structures (PDF, talk)
Melliès, Paul-André	Local states in string diagrams (PDF, talk)
Mereuta, Radu	All-Path Reachability Logic (PDF, talk)
Meseguer, Jose	Predicate Abstraction of Rewrite Theories (PDF, talk)
Miculan, Marino	A Model of Countable Nondeterminism in Guarded Type Theory (PDF, talk)
Middeldorp, Aart	Conditional Confluence (System Description) (PDF, talk)
Moore, Brandon	All-Path Reachability Logic (PDF, talk)
Moser, Georg	Automated Complexity Analysis Based on Context-Sensitive Rewriting (PDF, talk) Amortised Resource Analysis and Typed Polynomial Interpretations (PDF, talk)
N
Nagai, Tomoharu	Reduction System for Extensional Lambda-mu Calculus (PDF, talk)
Nakazawa, Koji	Reduction System for Extensional Lambda-mu Calculus (PDF, talk)
P
Pientka, Brigitte	Unnesting of Copatterns (PDF, talk)
R
Rios, Alejandro	Proof terms for infinitary rewriting (PDF, talk)
Rosu, Grigore	All-Path Reachability Logic (PDF, talk)
Roux, Cody	The Structural Theory of Pure Type Systems (PDF, talk)
S
Sabel, David	Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (PDF, talk)
Sakabe, Toshiki	Nagoya Termination Tool (PDF, talk)
Schmidt-Schauss, Manfred	Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk) (PDF) Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (PDF, talk)
Schmitz, Sylvain	Implicational Relevance Logic is 2-ExpTime-Complete (PDF, talk)
Serbanuta, Traian Florin	All-Path Reachability Logic (PDF, talk)
Setzer, Anton	Unnesting of Copatterns (PDF, talk)
Simonsen, Jakob Grue	An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (PDF, talk)
Simpson, Alex	Abstract datatypes for real numbers in type theory (PDF, talk)
Statman, Richard	Near semi-rings and lambda calculus (PDF, talk)
Stefanescu, Andrei	All-Path Reachability Logic (PDF, talk)
Steila, Silvia	Ramsey Theorem as an intuitionistic property of well founded relations (PDF, talk)
Sternagel, Christian	Formalizing monotone algebras for certification of termination- and complexity proofs (PDF, talk)
Sternagel, Thomas	Conditional Confluence (System Description) (PDF, talk)
Stump, Aaron	Self Types for Dependently Typed Lambda Encodings (PDF, talk)
T
Thibodeau, David	Unnesting of Copatterns (PDF, talk)
Thiemann, René	Formalizing monotone algebras for certification of termination- and complexity proofs (PDF, talk)
Toyama, Yoshihito	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (PDF, talk)
U
Uchida, Kazumasa	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (PDF, talk)
V
van Doorn, Floris	The Structural Theory of Pure Type Systems (PDF, talk)
Y
Yamada, Akihisa	Nagoya Termination Tool (PDF, talk)
Yoshida, Nobuko	Process Types as a Descriptive Tool for Interaction: Control and the Pi-Calculus (PDF)
Z
Zantema, Hans	Termination of Cycle Rewriting (PDF, talk)