Sciweavers

1385 search results - page 61 / 277
» Natural Rewriting for General Term Rewriting Systems
Sort
View
IANDC
2010
141views more  IANDC 2010»
15 years 4 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
NAACL
2007
15 years 7 months ago
A Case For Shorter Queries, and Helping Users Create Them
Information retrieval systems are frequently required to handle long queries. Simply using all terms in the query or relying on the underlying retrieval model to appropriately wei...
Giridhar Kumaran, James Allan
LICS
2007
IEEE
16 years 12 days ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba
ENTCS
2006
122views more  ENTCS 2006»
15 years 6 months ago
Combining Aspect-Oriented and Strategic Programming
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
Karl Trygve Kalleberg, Eelco Visser
GG
2010
Springer
15 years 7 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...