RTA-TLCA

Keyphrases

Publications

2014

Carles Creus, Guillem Godoy
Automatic Evaluation of Context-Free Grammars (System Description). RTA-TLCA (2014)
Anton Setzer, Andreas Abel, Brigitte Pientka, David Thibodeau
Unnesting of Copatterns. RTA-TLCA (2014)
Martin Hofmann, Georg Moser
Amortised Resource Analysis and Typed Polynomial Interpretations. RTA-TLCA (2014)
Paul-André Melliès
Local States in String Diagrams. RTA-TLCA (2014)
Sylvain Schmitz
Implicational Relevance Logic is 2-ExpTime-Complete. RTA-TLCA (2014)
Carlos Lombardi, Alejandro Ríos, Roel de Vrijer
Proof Terms for Infinitary Rewriting. RTA-TLCA (2014)
Peng Fu, Aaron Stump
Self Types for Dependently Typed Lambda Encodings. RTA-TLCA (2014)
Carsten Fuhs, Cynthia Kop
First-Order Formative Rules. RTA-TLCA (2014)
Mariangiola Dezani-Ciancaglini, Silvia Ghilezan
Preciseness of Subtyping on Intersection and Union Types. RTA-TLCA (2014)
Kyungmin Bae, José Meseguer
Predicate Abstraction of Rewrite Theories. RTA-TLCA (2014)
Manfred Schmidt-Schauß
Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). RTA-TLCA (2014)
Daniel de Carvalho, Jakob Grue Simonsen
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting. RTA-TLCA (2014)
Carles Creus, Guillem Godoy
Tree Automata with Height Constraints between Brothers. RTA-TLCA (2014)
Nao Hirokawa, Georg Moser
Automated Complexity Analysis Based on Context-Sensitive Rewriting. RTA-TLCA (2014)
Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu
All-Path Reachability Logic. RTA-TLCA (2014)
Kohei Honda, Nobuko Yoshida, Martin Berger
Process Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus. RTA-TLCA (2014)
Roberto Maieli
Construction of Retractile Proof Structures. RTA-TLCA (2014)
Cody Roux, Floris van Doorn
The Structural Theory of Pure Type Systems. RTA-TLCA (2014)
Martín Hötzel Escardó, Alex Simpson
Abstract Datatypes for Real Numbers in Type Theory. RTA-TLCA (2014)
Manfred Schmidt-Schauß, David Sabel
Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. RTA-TLCA (2014)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Nagoya Termination Tool. RTA-TLCA (2014)
Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. RTA-TLCA (2014)
Hans Zantema, Barbara König, H. J. Sander Bruggink
Termination of Cycle Rewriting. RTA-TLCA (2014)
Jiaxiang Liu, Nachum Dershowitz, Jean-Pierre Jouannaud
Confluence by Critical Pair Analysis. RTA-TLCA (2014)
Ales Bizjak, Lars Birkedal, Marino Miculan
A Model of Countable Nondeterminism in Guarded Type Theory. RTA-TLCA (2014)
Thomas Sternagel, Aart Middeldorp
Conditional Confluence (System Description). RTA-TLCA (2014)
Rick Statman
Near Semi-rings and Lambda Calculus. RTA-TLCA (2014)
Lukasz Czajka
A Coinductive Confluence Proof for Infinitary Lambda-Calculus. RTA-TLCA (2014)
Christian Sternagel, René Thiemann
Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs. RTA-TLCA (2014)
Stefano Berardi, Silvia Steila
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations. RTA-TLCA (2014)
Clément Aubert, Marc Bagnol
Unification and Logarithmic Space. RTA-TLCA (2014)
Koji Nakazawa, Tomoharu Nagai
Reduction System for Extensional Lambda-mu Calculus. RTA-TLCA (2014)
Guillaume Burel
Cut Admissibility by Saturation. RTA-TLCA (2014)

volume 8560, 2014

Rewriting and Typed Lambda Calculi - Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings RTA-TLCA 8560 (2014)