AbstractStrategy annotations are used in several rewriting-based programming languages to introduce replacement restrictions aimed at improving efficiency and/or reducing the risk of nontermination. Unfortunately, rewriting restrictions can have a negative impact on the ability to compute normal forms. In this paper, we first ascertain/clarify the conditions ensuring correctness and completeness (regarding normalization) of computing with strategy annotations. Then, we define a program transformation methodology for (correct and) complete evaluations which applies to OBJ-like languages
National audienceProgram transformation is a common practice in computer science, and its many appli...
A simple kind of strategy annotations is investigated, giving rise to a class of strategies, includi...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...
AbstractStrategy annotations are used in several rewriting-based programming languages to introduce ...
Strategy annotations have been used in several programming languages to improve termination and eff...
AbstractIn functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotat...
In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations tha...
AbstractThis paper focuses on the problem of program concretization by applying correctness-preservi...
AbstractStrategy annotations are used in eager programming languages (e.g., OBJ2, OBJ3, CafeOBJ, and...
AbstractStrategy annotations are used in rule-based programming languages such as OBJ2, OBJ3, CafeOB...
In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations th...
AbstractProgram transformation is used in a wide range of applications including compiler constructi...
Program transformation is used in many areas of software engineering. Examples include compilation,...
We describe a language for defining term rewriting strate-gies, and its application to the productio...
We address the problem of proving total correctness of transformation rules for definite logic progr...
National audienceProgram transformation is a common practice in computer science, and its many appli...
A simple kind of strategy annotations is investigated, giving rise to a class of strategies, includi...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...
AbstractStrategy annotations are used in several rewriting-based programming languages to introduce ...
Strategy annotations have been used in several programming languages to improve termination and eff...
AbstractIn functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotat...
In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations tha...
AbstractThis paper focuses on the problem of program concretization by applying correctness-preservi...
AbstractStrategy annotations are used in eager programming languages (e.g., OBJ2, OBJ3, CafeOBJ, and...
AbstractStrategy annotations are used in rule-based programming languages such as OBJ2, OBJ3, CafeOB...
In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations th...
AbstractProgram transformation is used in a wide range of applications including compiler constructi...
Program transformation is used in many areas of software engineering. Examples include compilation,...
We describe a language for defining term rewriting strate-gies, and its application to the productio...
We address the problem of proving total correctness of transformation rules for definite logic progr...
National audienceProgram transformation is a common practice in computer science, and its many appli...
A simple kind of strategy annotations is investigated, giving rise to a class of strategies, includi...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...