Add to ORKGA 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
In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ beh...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.This thesis is concerned with...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
In this paper we investigate the ways in which a fixed collection of valued con-straints can be comb...
A type hierarchy for an imperative language defines an ordering on the types such that any applicat...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
A system of hierarchical, imperative, fully recursive types allows program fragments written for sm...
AbstractA system of hierarchical, fully recursive types in a truly imperative language allows progra...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper, we investigate the ways in which a fixed collection of valued constraints can be comb...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ beh...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.This thesis is concerned with...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
In this paper we investigate the ways in which a fixed collection of valued con-straints can be comb...
A type hierarchy for an imperative language defines an ordering on the types such that any applicat...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
A system of hierarchical, imperative, fully recursive types allows program fragments written for sm...
AbstractA system of hierarchical, fully recursive types in a truly imperative language allows progra...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper we investigate the ways in which a fixed collection of valued constraints can be combi...
In this paper, we investigate the ways in which a fixed collection of valued constraints can be comb...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ beh...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.This thesis is concerned with...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...