Lecture Notes in Computer Science - Term Rewriting and Applications
Latest Publications

TOTAL DOCUMENTS

30

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540368342, 9783540368359

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

RAPT: A Program Transformation System Based on Term Rewriting

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_20 ◽

2006 ◽

pp. 267-276

Author(s):

Yuki Chiba ◽

Takahito Aoto

Keyword(s):

Program Transformation ◽

Term Rewriting ◽

Transformation System

Download Full-text

Checking Conservativity of Overloaded Definitions in Higher-Order Logic

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_16 ◽

2006 ◽

pp. 212-226 ◽

Author(s):

Steven Obua

Keyword(s):

Higher Order ◽

Order Logic ◽

Higher Order Logic

Download Full-text

Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_12 ◽

2006 ◽

pp. 151-165 ◽

Author(s):

Sylvain Salvati

Keyword(s):

Download Full-text

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_23 ◽

2006 ◽

pp. 297-312 ◽

Author(s):

Jürgen Giesl ◽

Stephan Swiderski ◽

Peter Schneider-Kamp ◽

René Thiemann

Keyword(s):

Programming Languages ◽

Term Rewriting ◽

Termination Analysis

Download Full-text

Generalizing Newman’s Lemma for Left-Linear Rewrite Systems

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_6 ◽

2006 ◽

pp. 66-80 ◽

Author(s):

Bernhard Gramlich ◽

Salvador Lucas

Keyword(s):

Rewrite Systems

Download Full-text

Hierarchical Combination of Intruder Theories

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_9 ◽

2006 ◽

pp. 108-122 ◽

Author(s):

Yannick Chevalier ◽

Michaël Rusinowitch

Download Full-text

Propositional Tree Automata

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_5 ◽

2006 ◽

pp. 50-65 ◽

Author(s):

Joe Hendrix ◽

Hitoshi Ohsaki ◽

Mahesh Viswanathan

Keyword(s):

Download Full-text

Predictive Labeling

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_24 ◽

2006 ◽

pp. 313-327 ◽

Author(s):

Nao Hirokawa ◽

Aart Middeldorp

Download Full-text

Feasible Trace Reconstruction for Rewriting Approximations

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_10 ◽

2006 ◽

pp. 123-135 ◽

Author(s):

Yohan Boichut ◽

Thomas Genet

Download Full-text

Solving Partial Order Constraints for LPO Termination

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_2 ◽

2006 ◽

pp. 4-18 ◽

Author(s):

Michael Codish ◽

Vitaly Lagoon ◽

Peter J. Stuckey

Keyword(s):

Partial Order ◽

Order Constraints

Download Full-text