- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Lotus - a Procedural Environment
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Lotus - a Procedural Environment Fowler, James M.
Abstract
Much recent Artificial Intelligence research involves procedural or executable representations of knowledge as an alternative to conventional static data representations, LOTUS is a purely procedural programming environment where variables can assume only executable values, and may be interrogated only through their execution. The LOTUS language is defined and proven to be universal. Design strategies and implementation techniques are developed which allow algorithms to be implemented as global self-modifying procedural networks. Such executable networks may be viewed as self-modifying interpreters which simply execute their symbolic inputs, A context-free parser is implemented in which the sentence to be parsed is really a LOTUS program which, when executed, parses itself. Attention is drawn to the initial conceptual difficulties presented by LOTUS. Possible extensions to the language which could make it more effective in other A. I. domains are discussed, and questions of synchronization requirements and parallelism are investigated. A LOTOS Manual and the complete MTS-LISP implementation of LOTOS are included as appendices.
Item Metadata
Title |
Lotus - a Procedural Environment
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1976
|
Description |
Much recent Artificial Intelligence research involves procedural or executable representations of knowledge as an alternative to conventional static data representations, LOTUS is a purely procedural programming environment where variables can assume only executable values, and may be interrogated only through their execution.
The LOTUS language is defined and proven to be universal. Design strategies and implementation techniques are developed which allow algorithms to be implemented as global self-modifying procedural networks. Such executable networks may be viewed as self-modifying interpreters which simply execute their symbolic inputs, A context-free parser is implemented in which the sentence to be parsed is really a LOTUS program which, when executed, parses itself.
Attention is drawn to the initial conceptual difficulties presented by LOTUS. Possible extensions to the language which could make it more effective in other A. I. domains are discussed, and questions of synchronization requirements and parallelism are investigated.
A LOTOS Manual and the complete MTS-LISP implementation of LOTOS are included as appendices.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2010-02-11
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051783
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.