Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar16th RTA 2005: Nara, Japan
Jürgen Giesl:
Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3467, Springer 2005, ISBN 3-540-25596-6Yoshihito Toyama:
Confluent Term Rewriting Systems. 1Jaco van de Pol, Hans Zantema:
Generalized Innermost Rewriting. 2-16Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio:
Orderings for Innermost Termination. 17-31Nachum Dershowitz, E. Castedo Ellerman:
Leanest Quasi-orderings. 32-45Michael Gordon Abbott, Neil Ghani, Christoph Lüth:
Abstract Modularity. 46-60Piotr Hoffman:
Union of Equational Theories: An Algebraic Approach. 61-73James Cheney:
Equivariant Unification. 74-89Christopher Lynch, Barbara Morawska:
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. 90-104Thierry Boy de la Tour, Mnacho Echenim:
Unification in a Class of Permutative Theories. 105-119Takahito Aoto, Toshiyuki Yamada:
Dependency Pairs for Simply Typed Term Rewriting. 120-134Makoto Hamana:
Universal Algebra for Termination of Higher-Order Rewriting. 135-149Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds. 150-164Joe Hendrix, Manuel Clavel, José Meseguer:
A Sufficient Completeness Reasoning Tool for Partial Specifications. 165-174Nao Hirokawa, Aart Middeldorp:
Tyrolean Termination Tool. 175-184Philip Wadler:
Call-by-Value Is Dual to Call-by-Name - Reloaded. 185-203Jérôme Rocheteau:
lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value. 204-218Alex K. Simpson:
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. 219-234Ryo Yoshinaka:
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete. 235-249José Meseguer:
Localized Fairness: A Rewriting Semantics. 250-263Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
Partial Inversion of Constructor Term Rewriting Systems. 264-278Santiago Escobar, José Meseguer, Prasanna Thati:
Natural Narrowing for General Term Rewriting Systems. 279-293Hubert Comon-Lundh, Stéphanie Delaune:
The Finite Variant Property: How to Get Rid of Some Algebraic Properties. 294-307Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Intruder Deduction for AC-Like Equational Theories with Homomorphisms. 308-322Olivier Bournez, Florent Garnier:
Proving Positive Almost-Sure Termination. 323-337Wojciech Moczydlowski, Alfons Geser:
Termination of Single-Threaded One-Rule Semi-Thue Systems. 338-352Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. 353-367Jean-Pierre Jouannaud:
Twenty Years Later. 368-375Nachum Dershowitz:
Open. Closed. Open. 376-393Amy P. Felty:
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code. 394-406Delia Kesner, Stéphane Lengrand:
Extending the Explicit Substitution Paradigm. 407-422Gilles Dowek, Benjamin Werner:
Arithmetic as a Theory Modulo. 423-437Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems. 438-452Robert Nieuwenhuis, Albert Oliveras:
Proof-Producing Congruence Closure. 453-468Aaron Stump, Li-Yang Tan:
The Algebra of Equality Proofs. 469-483Ahmed Bouajjani, Tayssir Touili:
On Computing Reachability Sets of Process Rewrite Systems. 484-499Iovka Boneva, Jean-Marc Talbot:
Automata and Logics for Unranked and Unordered Trees. 500-515
last updated on 2019-07-18 23:05 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
