Multiple strongly typed evaluation phases: a programming-language notion
Thesis/Dissertation
·
OSTI ID:5674835
This work introduces the programming language notion of multiple strongly typed evaluation phases, or simply, phases. In general, a program might be executed through several phases. Each phase requires its own input, and acts as compile time relative to the next phase, or runtime relative to the previous phase. Thus, each phase is the execution of a program, and may play the role of compile time or run time. The notion of phases offers a framework for understanding compiled strongly typed languages, and works toward an improved, strongly typed language basis for reusable software. The research shows how types can be manipulated as first-class values, and notions of compile time and runtime can be unified, without sacrificing strong typing (compile time type checking) or runtime speed. The notion of phases is demonstrated by defining a sample source language, Phi, which looks like a typed lambda calculus; an object language, IL, which is syntactically similar to an untyped lambda calculus, but is strongly typed; an associated IL Machine that interprets IL programs; and a translator for converting Phi programs to IL programs.
- Research Organization:
- California Univ., Los Angeles (USA)
- OSTI ID:
- 5674835
- Country of Publication:
- United States
- Language:
- English
Similar Records
Calculi of lambda-nu-CS conversion: a syntactic theory of control and state in imperative higher-order programming languages
Functional Programming in Computer Science
Abstract types and dependence in programming languages
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6992925
Functional Programming in Computer Science
Technical Report
·
Mon Jan 18 23:00:00 EST 2016
·
OSTI ID:1237221
Abstract types and dependence in programming languages
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6854222