• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 34 matches

• 2014
• 
  Martin Hofmann, Georg Moser:
  Amortised Resource Analysis and Typed Polynomial Interpretations. RTA-TLCA 2014: 272-286
• 
  Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
  Nagoya Termination Tool. RTA-TLCA 2014: 466-475
• 
  Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida:
  Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. RTA-TLCA 2014: 46-60
• 
  Clément Aubert, Marc Bagnol:
  Unification and Logarithmic Space. RTA-TLCA 2014: 77-92
• 
  Kyungmin Bae, José Meseguer:
  Predicate Abstraction of Rewrite Theories. RTA-TLCA 2014: 61-76
• 
  Stefano Berardi, Silvia Steila:
  Ramsey Theorem as an Intuitionistic Property of Well Founded Relations. RTA-TLCA 2014: 93-107
• 
  Ales Bizjak, Lars Birkedal, Marino Miculan:
  A Model of Countable Nondeterminism in Guarded Type Theory. RTA-TLCA 2014: 108-123
• 
  Guillaume Burel:
  Cut Admissibility by Saturation. RTA-TLCA 2014: 124-138
• 
  Daniel de Carvalho, Jakob Grue Simonsen:
  An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting. RTA-TLCA 2014: 179-193
• 
  Carles Creus, Guillem Godoy:
  Automatic Evaluation of Context-Free Grammars (System Description). RTA-TLCA 2014: 139-148
• 
  Carles Creus, Guillem Godoy:
  Tree Automata with Height Constraints between Brothers. RTA-TLCA 2014: 149-163
• 
  Lukasz Czajka:
  A Coinductive Confluence Proof for Infinitary Lambda-Calculus. RTA-TLCA 2014: 164-178
• 
  Mariangiola Dezani-Ciancaglini, Silvia Ghilezan:
  Preciseness of Subtyping on Intersection and Union Types. RTA-TLCA 2014: 194-207
• 
  Martín Hötzel Escardó, Alex Simpson:
  Abstract Datatypes for Real Numbers in Type Theory. RTA-TLCA 2014: 208-223
• 
  Peng Fu, Aaron Stump:
  Self Types for Dependently Typed Lambda Encodings. RTA-TLCA 2014: 224-239
• 
  Carsten Fuhs, Cynthia Kop:
  First-Order Formative Rules. RTA-TLCA 2014: 240-256
• 
  Nao Hirokawa, Georg Moser:
  Automated Complexity Analysis Based on Context-Sensitive Rewriting. RTA-TLCA 2014: 257-271
• 
  Kohei Honda, Nobuko Yoshida, Martin Berger:
  Process Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus. RTA-TLCA 2014: 1-20
• 
  Jiaxiang Liu, Nachum Dershowitz, Jean-Pierre Jouannaud:
  Confluence by Critical Pair Analysis. RTA-TLCA 2014: 287-302
• 
  Carlos Lombardi, Alejandro Ríos, Roel de Vrijer:
  Proof Terms for Infinitary Rewriting. RTA-TLCA 2014: 303-318
• 
  Roberto Maieli:
  Construction of Retractile Proof Structures. RTA-TLCA 2014: 319-333
• 
  Paul-André Melliès:
  Local States in String Diagrams. RTA-TLCA 2014: 334-348
• 
  Koji Nakazawa, Tomoharu Nagai:
  Reduction System for Extensional Lambda-mu Calculus. RTA-TLCA 2014: 349-363
• 
  Cody Roux, Floris van Doorn:
  The Structural Theory of Pure Type Systems. RTA-TLCA 2014: 364-378
• 
  Manfred Schmidt-Schauß:
  Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). RTA-TLCA 2014: 21-30
• 
  Manfred Schmidt-Schauß, David Sabel:
  Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. RTA-TLCA 2014: 379-394
• 
  Sylvain Schmitz:
  Implicational Relevance Logic is 2-ExpTime-Complete. RTA-TLCA 2014: 395-409
• 
  Anton Setzer, Andreas Abel, Brigitte Pientka, David Thibodeau:
  Unnesting of Copatterns. RTA-TLCA 2014: 31-45
• 
  Rick Statman:
  Near Semi-rings and Lambda Calculus. RTA-TLCA 2014: 410-424
• 
  Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu:
  All-Path Reachability Logic. RTA-TLCA 2014: 425-440

skipping 4 more matches