
Infinite Values in Hierarchical Imperative Types
Author(s) -
Michael I. Schwartzbach
Publication year - 1989
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v18i293.6687
Subject(s) - hierarchy , context (archaeology) , mathematics , set (abstract data type) , value (mathematics) , discrete mathematics , computer science , programming language , statistics , biology , economics , market economy , paleontology
A system of hierarchical imperative types is extended to allow infinite values. The general structure of value assignments to types in the context of a hierarchy is considered, and it is shown that a smallest and largest such exist. A method for obtaining intermediate value assignments is investigated, and a general characterization of the infinite values allowable in programming languages is presented. Finally, the set of rational values is demonstrated to be appropriate for our imperative hierarchy. Programs can then work on infinite imperative data structures which are allocated lazily during execution.