Infinite Values in Hierarchical Imperative Types
نویسندگان
چکیده
منابع مشابه
Existential Types for Imperative Languages
We integrate existential types into a strongly typed C-like language. In particular, we show how a bad combination of existential types, mutation, and aliasing can cause a subtle violation of type safety. We explore two independent ways to strengthen the type system to restore safety. One restricts the mutation of existential packages. The other restricts the types of aliases of existential pac...
متن کاملImperative Programming with Dependent Types
In this paper, we enrich imperative programming with a form of dependent types. We start with explaining some motivations for this enrichment and mentioning some major obstacles that need to be overcome. We then present the design of a source level dependently typed imperative programming language Xanadu, forming both static and dynamic semantics and then establishing the type soundness theorem...
متن کاملSpinor Types in Infinite Dimensions
The Cartan Dirac classification of spinors into types is generalized to infinite dimensions. The main conclusion is that, in the statistical interpretation where such spinors are functions on Z2 , any real or quaternionic structure involves switching zeroes and ones. There results a maze of equivalence classes of each type. Some examples are shown in L2(T) . The classification of spinors leads ...
متن کاملExistential Types for Imperative Languages: Technical Results
This technical report contains the full type-safety proof for the language presented in the paper Existential Types for Imperative Languages, originally submitted for publication in October 2001. Because this report should be read only after the paper, effectively as an appendix, we do not repeat the motivation, examples, and informal presentation contained there. Also refer to the paper for re...
متن کاملClosed types for a safe imperative MetaML
This paper addresses the issue of safely combining computational effects and multi-stage programming. We propose a type system, which exploits a notion of closed type, to check statically that an imperative multi-stage program does not cause run-time errors. Our approach is demonstrated formally for a core language called MiniML ref . This core language safely combines multi-stage constructs an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1989
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v18i293.6687