Natural Narrowing for General Term Rewriting Systems (English)
- New search for: Escobar, Santiago
- New search for: Meseguer, José
- New search for: Thati, Prasanna
- New search for: Escobar, Santiago
- New search for: Meseguer, José
- New search for: Thati, Prasanna
In:
Term Rewriting and Applications
;
279-293
;
2005
- Article/Chapter (Book) / Electronic Resource
-
Title:Natural Narrowing for General Term Rewriting Systems
-
Contributors:
-
Published in:Term Rewriting and Applications ; 279-293Lecture Notes in Computer Science ; 3467 ; 279-293
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2005-01-01
-
Size:15 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Confluent Term Rewriting SystemsToyama, Yoshihito et al. | 2005
- 2
-
Generalized Innermost RewritingPol, Jaco / Zantema, Hans et al. | 2005
- 17
-
Orderings for Innermost TerminationFernández, Mirtha-Lina / Godoy, Guillem / Rubio, Albert et al. | 2005
- 32
-
Leanest Quasi-orderingsDershowitz, Nachum / Ellerman, E. Castedo et al. | 2005
- 46
-
Abstract ModularityAbbott, Michael / Ghani, Neil / Lüth, Christoph et al. | 2005
- 61
-
Union of Equational Theories: An Algebraic ApproachHoffman, Piotr et al. | 2005
- 74
-
Equivariant UnificationCheney, James et al. | 2005
- 90
-
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational TheoriesLynch, Christopher / Morawska, Barbara et al. | 2005
- 105
-
Unification in a Class of Permutative TheoriesBoy de la Tour, Thierry / Echenim, Mnacho et al. | 2005
- 120
-
Dependency Pairs for Simply Typed Term RewritingAoto, Takahito / Yamada, Toshiyuki et al. | 2005
- 135
-
Universal Algebra for Termination of Higher-Order RewritingHamana, Makoto et al. | 2005
- 150
-
Quasi-interpretations and Small Space BoundsBonfante, Guillaume / Marion, Jean-Yves / Moyen, Jean-Yves et al. | 2005
- 165
-
A Sufficient Completeness Reasoning Tool for Partial SpecificationsHendrix, Joe / Clavel, Manuel / Meseguer, José et al. | 2005
- 175
-
Tyrolean Termination ToolHirokawa, Nao / Middeldorp, Aart et al. | 2005
- 185
-
Call-by-Value Is Dual to Call-by-Name – ReloadedWadler, Philip et al. | 2005
- 204
-
λμ-Calculus and Duality: Call-by-Name and Call-by-ValueRocheteau, Jérôme et al. | 2005
- 219
-
Reduction in a Linear Lambda-Calculus with Applications to Operational SemanticsSimpson, Alex et al. | 2005
- 235
-
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-CompleteYoshinaka, Ryo et al. | 2005
- 250
-
Localized Fairness: A Rewriting SemanticsMeseguer, José et al. | 2005
- 264
-
Partial Inversion of Constructor Term Rewriting SystemsNishida, Naoki / Sakai, Masahiko / Sakabe, Toshiki et al. | 2005
- 279
-
Natural Narrowing for General Term Rewriting SystemsEscobar, Santiago / Meseguer, José / Thati, Prasanna et al. | 2005
- 294
-
The Finite Variant Property: How to Get Rid of Some Algebraic PropertiesComon-Lundh, Hubert / Delaune, Stéphanie et al. | 2005
- 308
-
Intruder Deduction for AC-Like Equational Theories with HomomorphismsLafourcade, Pascal / Lugiez, Denis / Treinen, Ralf et al. | 2005
- 323
-
Proving Positive Almost-Sure TerminationBournez, Olivier / Garnier, Florent et al. | 2005
- 338
-
Termination of Single-Threaded One-Rule Semi-Thue SystemsMoczydłowski, Wojciech / Geser, Alfons et al. | 2005
- 353
-
On Tree Automata that Certify Termination of Left-Linear Term Rewriting SystemsGeser, Alfons / Hofbauer, Dieter / Waldmann, Johannes / Zantema, Hans et al. | 2005
- 368
-
Twenty Years LaterJouannaud, Jean-Pierre et al. | 2005
- 376
-
Open. Closed. Open.Dershowitz, Nachum et al. | 2005
- 394
-
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying CodeFelty, Amy P. et al. | 2005
- 407
-
Extending the Explicit Substitution ParadigmKesner, Delia / Lengrand, Stéphane et al. | 2005
- 423
-
Arithmetic as a Theory ModuloDowek, Gilles / Werner, Benjamin et al. | 2005
- 438
-
Infinitary Combinatory Reduction SystemsKetema, Jeroen / Simonsen, Jakob Grue et al. | 2005
- 453
-
Proof-Producing Congruence ClosureNieuwenhuis, Robert / Oliveras, Albert et al. | 2005
- 469
-
The Algebra of Equality ProofsStump, Aaron / Tan, Li-Yang et al. | 2005
- 484
-
On Computing Reachability Sets of Process Rewrite SystemsBouajjani, Ahmed / Touili, Tayssir et al. | 2005
- 500
-
Automata and Logics for Unranked and Unordered TreesBoneva, Iovka / Talbot, Jean-Marc et al. | 2005