• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 2
  • Tagged with
  • 4
  • 4
  • 4
  • 4
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

The implementation of generators and goal-directed evaluation in Icon.

O'Bagy, Janalee. January 1988 (has links)
Generators and goal-directed evaluation provide a rich programming paradigm when combined with traditional control structures in an imperative language. Icon is a language whose goal-directed evaluation is integrated with traditional control structures. This integration provides powerful mechanisms for formulating many complex programming operations in concise and natural ways. However, generators, goal-directed evaluation, and related control structures introduce implementation problems that do not exist for languages with only conventional expression evaluation. This dissertation presents an implementation model using recursion that serves as a basis for both an interpreter and a compiler. Furthermore, in the case of the compiler, optimizations can be performed to improve the efficiency of Icon programs, mainly by reducing the general evaluation strategy whenever possible. The dissertation describes a compile-time semantic analysis used to gather information about the properties of expressions and how they are used at their lexical sites. The optimizations that can be performed using this information are illustrated in the context of the compiler model described in the dissertation.
2

THE DESIGN AND IMPLEMENTATION OF A GOAL-DIRECTED PROGRAMMING LANGUAGE

Korb, John Timothy January 1979 (has links)
No description available.
3

The design and implementation of high level programming language features for pattern matching in real-time.

Nilsen, Kelvin Don. January 1988 (has links)
High-level programming language features simplify software development by eliminating many low-level programming concerns and by providing programmers with useful abstractions to simplify description and analysis of their programs. This dissertation discusses briefly some of the special needs of structural pattern-matching programs that must execute in real time and suggests language features to support these needs. These language features are implemented in an experimental version of the Icon programming language and examples of how these language features can be used are presented. This dissertation also presents and discusses the implementation of these language mechanisms, including the implementation of a new algorithm for garbage collecting linked data structures and strings in real time. One of the new language features is a stream data type, which allows programmers to perform pattern matching directly on sequences of data values produced by external sources, without requiring explicit read operations to bring the data into memory before analyzing it. Other new language features provide the ability to create and manipulate concurrent Icon processes, between which the stream data type serves as the principal mechanism for interprocess communication. Stream and concurrent process manipulation mechanisms integrate naturally with each other and with the existing mechanisms of the Icon programming language. Sequential Icon programs are, for the most part, unaffected by the new language capabilities.
4

CONTROL MECHANISMS FOR GENERATORS IN ICON

Wampler, Stephen Berry January 1981 (has links)
Generators, or expressions capable of producing a sequence of results during evaluation, are found in one form or another in a number of programming languages. The use of generators has been limited by a lack of understanding of their operation. Control structures for generating expressions are usually patterned after the control structures found in conventional language designs. A notation for describing the static aspects of generators is presented in this dissertation. This notation is used to describe the operation of the generator-based control structures in Icon and to introduce several novel control structures based upon generator evaluation. Co-expressions are introduced as the expression-level equivalent of coroutines, and combined with generators to provide a powerful programming facility. Finally, machine and language independent models for implementation of goal-directed evaluation and co-expressions are presented.

Page generated in 0.1342 seconds