![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
RTA-TLCA 2014: Vienna, Austria
- Gilles Dowek:
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. Lecture Notes in Computer Science 8560, Springer 2014, ISBN 978-3-319-08917-1 - Kohei Honda, Nobuko Yoshida
, Martin Berger
:
Process Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus. 1-20 - Manfred Schmidt-Schauß:
Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). 21-30 - Anton Setzer
, Andreas Abel, Brigitte Pientka, David Thibodeau:
Unnesting of Copatterns. 31-45 - Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida:
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. 46-60 - Kyungmin Bae, José Meseguer:
Predicate Abstraction of Rewrite Theories. 61-76 - Clément Aubert
, Marc Bagnol:
Unification and Logarithmic Space. 77-92 - Stefano Berardi, Silvia Steila:
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations. 93-107 - Ales Bizjak, Lars Birkedal, Marino Miculan
:
A Model of Countable Nondeterminism in Guarded Type Theory. 108-123 - Guillaume Burel:
Cut Admissibility by Saturation. 124-138 - Carles Creus, Guillem Godoy:
Automatic Evaluation of Context-Free Grammars (System Description). 139-148 - Carles Creus, Guillem Godoy:
Tree Automata with Height Constraints between Brothers. 149-163 - Lukasz Czajka:
A Coinductive Confluence Proof for Infinitary Lambda-Calculus. 164-178 - Daniel de Carvalho, Jakob Grue Simonsen:
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting. 179-193 - Mariangiola Dezani-Ciancaglini, Silvia Ghilezan
:
Preciseness of Subtyping on Intersection and Union Types. 194-207 - Martín Hötzel Escardó, Alex Simpson:
Abstract Datatypes for Real Numbers in Type Theory. 208-223 - Peng Fu
, Aaron Stump:
Self Types for Dependently Typed Lambda Encodings. 224-239 - Carsten Fuhs, Cynthia Kop:
First-Order Formative Rules. 240-256 - Nao Hirokawa
, Georg Moser:
Automated Complexity Analysis Based on Context-Sensitive Rewriting. 257-271 - Martin Hofmann, Georg Moser:
Amortised Resource Analysis and Typed Polynomial Interpretations. 272-286 - Jiaxiang Liu
, Nachum Dershowitz, Jean-Pierre Jouannaud:
Confluence by Critical Pair Analysis. 287-302 - Carlos Lombardi, Alejandro Ríos, Roel de Vrijer:
Proof Terms for Infinitary Rewriting. 303-318 - Roberto Maieli
:
Construction of Retractile Proof Structures. 319-333 - Paul-André Melliès:
Local States in String Diagrams. 334-348 - Koji Nakazawa, Tomoharu Nagai:
Reduction System for Extensional Lambda-mu Calculus. 349-363 - Cody Roux, Floris van Doorn:
The Structural Theory of Pure Type Systems. 364-378 - Manfred Schmidt-Schauß, David Sabel
:
Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. 379-394 - Sylvain Schmitz
:
Implicational Relevance Logic is 2-ExpTime-Complete. 395-409 - Rick Statman:
Near Semi-rings and Lambda Calculus. 410-424 - Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu:
All-Path Reachability Logic. 425-440 - Christian Sternagel, René Thiemann
:
Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs. 441-455 - Thomas Sternagel
, Aart Middeldorp
:
Conditional Confluence (System Description). 456-465 - Akihisa Yamada
, Keiichirou Kusakari, Toshiki Sakabe:
Nagoya Termination Tool. 466-475 - Hans Zantema, Barbara König, H. J. Sander Bruggink:
Termination of Cycle Rewriting. 476-490
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.