Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

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

Published: 01 February 1997 Publication History

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.

Cited By

View all
  • (2000)Partial completion of equational theoriesJournal of Computer Science and Technology10.1007/BF0294883715:6(552-559)Online publication date: 1-Nov-2000
  • (1998)Proving inductive theorems using witnessed test setsProceedings Second International Conference on Formal Engineering Methods (Cat.No.98EX241)10.1109/ICFEM.1998.730579(158-164)Online publication date: 1998

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 32, Issue 2
Feb. 1997
45 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/251621
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1997
Published in SIGPLAN Volume 32, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)64
  • Downloads (Last 6 weeks)9
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2000)Partial completion of equational theoriesJournal of Computer Science and Technology10.1007/BF0294883715:6(552-559)Online publication date: 1-Nov-2000
  • (1998)Proving inductive theorems using witnessed test setsProceedings Second International Conference on Formal Engineering Methods (Cat.No.98EX241)10.1109/ICFEM.1998.730579(158-164)Online publication date: 1998

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media