Capturing Strong Reduction in Director String Calculus

Authors

Vugranam Sreedhar, University of Nevada, Las VegasFollow
Kazem Taghva, University of Nevada, Las VegasFollow

Document Type

Article

Publication Date

1-18-1993

Publication Title

Theoretical Computer Science

Volume

107

Issue

2

First page number:

333

Last page number:

347

Abstract

A modified version of director string calculus (MDSC) is introduced which preserves the applicative structure of the original lambda terms and captures the strong reduction as opposed to weak reduction of the original director string calculus (DSC). Furthermore, MDSC provides an environment which supports the nonatomic nature of the substitution operation and hence can lend itself to parallel and optimal reduction.

Disciplines

Electrical and Computer Engineering | Engineering

Language

English

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

Repository Citation

Sreedhar, V., Taghva, K. (1993). Capturing Strong Reduction in Director String Calculus. Theoretical Computer Science, 107(2), 333-347.