Sciweavers

289 search results - page 13 / 58
» Program transformation by templates based on term rewriting
Sort
View
PLANX
2007
13 years 8 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
SOFSEM
2009
Springer
14 years 4 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
HASKELL
2006
ACM
14 years 1 months ago
Introducing the Haskell equational reasoning assistant
We introduce the new, improved version of the Haskell Equational Reasoning Assistant, which consists of an Ajax application for rewriting Haskell fragments in their context, and a...
Andy Gill
CSCLP
2008
Springer
13 years 9 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
FOSSACS
2004
Springer
14 years 23 days ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas