Award Date
1-1-1990
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Computer Science and Electrical Engineering
Number of Pages
86
Abstract
In this thesis we introduce a modified version of Director String Calculus (MDSC) 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, our reduction system provides an environment which supports the nonatomic nature of substitution operation and hence can lend itself to parallel and optimal reduction. We shall compare our reduction method with other reduction methods, and discuss some of the advantages and disadvantages of our method.
Keywords
Calculus; Computation; Director; String
Controlled Subject
Computer science; Mathematics
File Format
File Size
2160.64 KB
Degree Grantor
University of Nevada, Las Vegas
Language
English
Permissions
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.
Repository Citation
Sreedhar, Vugranam Chakravarthy, "Computation in director string calculus" (1990). UNLV Retrospective Theses & Dissertations. 105.
http://dx.doi.org/10.25669/zqsm-j7g6
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/
COinS