The design and implementatIon of a program development system based on rewriting method

Sun Yongqiang, Lin Kai, Li Shen

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we present a program development system based on rewriting method with the goal of providing an powerful tool for automatic software development and rapid prototyping. New mechanisms for defining constrained types and optimal rules are introduced to functional programming languages to achieve strong expressiveness. The enhanced functional programming language is combined with an algebraic specification language. Thus, the design from specification to program can be supported, and the efficiency and flexibility of programming can also be improved. In this system, both static and dynamic techniques are used to deal with constrained type check. All function definitions, computation constraints and optimal rules are regarded as rewriting rules. In order to provide a strong support for a large group of TRSs which may be neither terminating nor orthogonal, we propose a method using structure measure to decide TRSs' confluences. Based on this method, we present a partial completion algorithm to generate a rewriting model from a specification. Depending on term rewriting system, the mixed language system computes with parallel outermost and needed reduction. We explain the principles and implementation techniques in detail, some examples are provided.

Original languageEnglish (US)
Pages (from-to)27-34
Number of pages8
JournalSIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume32
Issue number2
StatePublished - Feb 1997
Externally publishedYes

Fingerprint

Functional programming
Computer programming languages
Specifications
Specification languages
Rapid prototyping
Software engineering

Keywords

  • Algebraic specification
  • Constrained type
  • Functional programming language
  • Mixed language
  • Optimal rule
  • Rewriting system
  • Structure measure

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

The design and implementatIon of a program development system based on rewriting method. / Yongqiang, Sun; Kai, Lin; Shen, Li.

In: SIGPLAN Notices (ACM Special Interest Group on Programming Languages), Vol. 32, No. 2, 02.1997, p. 27-34.

Research output: Contribution to journalArticle

@article{9aa3cc10cced465cac013df95376c38d,
title = "The design and implementatIon of a program development system based on rewriting method",
abstract = "In this paper, we present a program development system based on rewriting method with the goal of providing an powerful tool for automatic software development and rapid prototyping. New mechanisms for defining constrained types and optimal rules are introduced to functional programming languages to achieve strong expressiveness. The enhanced functional programming language is combined with an algebraic specification language. Thus, the design from specification to program can be supported, and the efficiency and flexibility of programming can also be improved. In this system, both static and dynamic techniques are used to deal with constrained type check. All function definitions, computation constraints and optimal rules are regarded as rewriting rules. In order to provide a strong support for a large group of TRSs which may be neither terminating nor orthogonal, we propose a method using structure measure to decide TRSs' confluences. Based on this method, we present a partial completion algorithm to generate a rewriting model from a specification. Depending on term rewriting system, the mixed language system computes with parallel outermost and needed reduction. We explain the principles and implementation techniques in detail, some examples are provided.",
keywords = "Algebraic specification, Constrained type, Functional programming language, Mixed language, Optimal rule, Rewriting system, Structure measure",
author = "Sun Yongqiang and Lin Kai and Li Shen",
year = "1997",
month = "2",
language = "English (US)",
volume = "32",
pages = "27--34",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - The design and implementatIon of a program development system based on rewriting method

AU - Yongqiang, Sun

AU - Kai, Lin

AU - Shen, Li

PY - 1997/2

Y1 - 1997/2

N2 - In this paper, we present a program development system based on rewriting method with the goal of providing an powerful tool for automatic software development and rapid prototyping. New mechanisms for defining constrained types and optimal rules are introduced to functional programming languages to achieve strong expressiveness. The enhanced functional programming language is combined with an algebraic specification language. Thus, the design from specification to program can be supported, and the efficiency and flexibility of programming can also be improved. In this system, both static and dynamic techniques are used to deal with constrained type check. All function definitions, computation constraints and optimal rules are regarded as rewriting rules. In order to provide a strong support for a large group of TRSs which may be neither terminating nor orthogonal, we propose a method using structure measure to decide TRSs' confluences. Based on this method, we present a partial completion algorithm to generate a rewriting model from a specification. Depending on term rewriting system, the mixed language system computes with parallel outermost and needed reduction. We explain the principles and implementation techniques in detail, some examples are provided.

AB - In this paper, we present a program development system based on rewriting method with the goal of providing an powerful tool for automatic software development and rapid prototyping. New mechanisms for defining constrained types and optimal rules are introduced to functional programming languages to achieve strong expressiveness. The enhanced functional programming language is combined with an algebraic specification language. Thus, the design from specification to program can be supported, and the efficiency and flexibility of programming can also be improved. In this system, both static and dynamic techniques are used to deal with constrained type check. All function definitions, computation constraints and optimal rules are regarded as rewriting rules. In order to provide a strong support for a large group of TRSs which may be neither terminating nor orthogonal, we propose a method using structure measure to decide TRSs' confluences. Based on this method, we present a partial completion algorithm to generate a rewriting model from a specification. Depending on term rewriting system, the mixed language system computes with parallel outermost and needed reduction. We explain the principles and implementation techniques in detail, some examples are provided.

KW - Algebraic specification

KW - Constrained type

KW - Functional programming language

KW - Mixed language

KW - Optimal rule

KW - Rewriting system

KW - Structure measure

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

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

M3 - Article

AN - SCOPUS:0345985582

VL - 32

SP - 27

EP - 34

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 2

ER -