More precise typing of rewrite strategies

Azamat Mametjanov, Victor Winter, Ralf Lämmel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The programming concept of rewrite strategies supports versatile composition of rewrite rules and control of their application. Such programmability of rewrites can possibly lead to incorrect compositions of rewrites or incorrect applications of rewrites to terms within a strategic rewriting program. In this paper, we explore the analysis of strategic rewriting programs to detect certain programming errors statically. In particular, we introduce fine-grain types to closely approximate the dynamic behavior of rewriting. We develop an expressive type system for a core rewriting language. The resulting system detects programming errors of universally unreachable and failing rewrites. Static detection of such errors can substantially reduce testing and debugging efforts and lead to a more effective use of strategic rewriting in large and complex rewriting problems.

Original languageEnglish (US)
Title of host publicationProceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11
DOIs
StatePublished - Jul 7 2011
Event11th Workshop on Language Descriptions, Tools and Applications, LDTA 2011 - Saarbrucken, Germany
Duration: Mar 26 2011Mar 27 2011

Publication series

NameProceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11

Conference

Conference11th Workshop on Language Descriptions, Tools and Applications, LDTA 2011
CountryGermany
CitySaarbrucken
Period3/26/113/27/11

Fingerprint

Computer systems programming
Chemical analysis
Testing
Programming
Language
Debugging
Expressive

Keywords

  • strategies
  • term rewriting
  • transformation
  • type-checking
  • types

ASJC Scopus subject areas

  • Language and Linguistics
  • Computer Science Applications

Cite this

Mametjanov, A., Winter, V., & Lämmel, R. (2011). More precise typing of rewrite strategies. In Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11 (Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11). https://doi.org/10.1145/1988783.1988786

More precise typing of rewrite strategies. / Mametjanov, Azamat; Winter, Victor; Lämmel, Ralf.

Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11. 2011. (Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mametjanov, A, Winter, V & Lämmel, R 2011, More precise typing of rewrite strategies. in Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11. Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11, 11th Workshop on Language Descriptions, Tools and Applications, LDTA 2011, Saarbrucken, Germany, 3/26/11. https://doi.org/10.1145/1988783.1988786
Mametjanov A, Winter V, Lämmel R. More precise typing of rewrite strategies. In Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11. 2011. (Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11). https://doi.org/10.1145/1988783.1988786
Mametjanov, Azamat ; Winter, Victor ; Lämmel, Ralf. / More precise typing of rewrite strategies. Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11. 2011. (Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11).
@inproceedings{1f0ef7f04816403b866b560fb08d1510,
title = "More precise typing of rewrite strategies",
abstract = "The programming concept of rewrite strategies supports versatile composition of rewrite rules and control of their application. Such programmability of rewrites can possibly lead to incorrect compositions of rewrites or incorrect applications of rewrites to terms within a strategic rewriting program. In this paper, we explore the analysis of strategic rewriting programs to detect certain programming errors statically. In particular, we introduce fine-grain types to closely approximate the dynamic behavior of rewriting. We develop an expressive type system for a core rewriting language. The resulting system detects programming errors of universally unreachable and failing rewrites. Static detection of such errors can substantially reduce testing and debugging efforts and lead to a more effective use of strategic rewriting in large and complex rewriting problems.",
keywords = "strategies, term rewriting, transformation, type-checking, types",
author = "Azamat Mametjanov and Victor Winter and Ralf L{\"a}mmel",
year = "2011",
month = "7",
day = "7",
doi = "10.1145/1988783.1988786",
language = "English (US)",
isbn = "9781450306652",
series = "Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11",
booktitle = "Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11",

}

TY - GEN

T1 - More precise typing of rewrite strategies

AU - Mametjanov, Azamat

AU - Winter, Victor

AU - Lämmel, Ralf

PY - 2011/7/7

Y1 - 2011/7/7

N2 - The programming concept of rewrite strategies supports versatile composition of rewrite rules and control of their application. Such programmability of rewrites can possibly lead to incorrect compositions of rewrites or incorrect applications of rewrites to terms within a strategic rewriting program. In this paper, we explore the analysis of strategic rewriting programs to detect certain programming errors statically. In particular, we introduce fine-grain types to closely approximate the dynamic behavior of rewriting. We develop an expressive type system for a core rewriting language. The resulting system detects programming errors of universally unreachable and failing rewrites. Static detection of such errors can substantially reduce testing and debugging efforts and lead to a more effective use of strategic rewriting in large and complex rewriting problems.

AB - The programming concept of rewrite strategies supports versatile composition of rewrite rules and control of their application. Such programmability of rewrites can possibly lead to incorrect compositions of rewrites or incorrect applications of rewrites to terms within a strategic rewriting program. In this paper, we explore the analysis of strategic rewriting programs to detect certain programming errors statically. In particular, we introduce fine-grain types to closely approximate the dynamic behavior of rewriting. We develop an expressive type system for a core rewriting language. The resulting system detects programming errors of universally unreachable and failing rewrites. Static detection of such errors can substantially reduce testing and debugging efforts and lead to a more effective use of strategic rewriting in large and complex rewriting problems.

KW - strategies

KW - term rewriting

KW - transformation

KW - type-checking

KW - types

UR - http://www.scopus.com/inward/record.url?scp=79959893910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959893910&partnerID=8YFLogxK

U2 - 10.1145/1988783.1988786

DO - 10.1145/1988783.1988786

M3 - Conference contribution

AN - SCOPUS:79959893910

SN - 9781450306652

T3 - Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11

BT - Proceedings of the 11th Workshop on Language Descriptions, Tools and Applications, LDTA'11

ER -