Standard ML Type Generativity as Existential Quantification

نویسنده

  • Claudio V. Russo
چکیده

One of the distinguishing features of Standard ML is the use of type generativity. Each declaration of a datatype binds a globally fresh type name to the type identifier introduced. Type generativity has been regarded as an extra-logical device which, though desirable in a programming language to ensure data abstraction, bears no close resemblance to type theoretic constructs. We show that it corresponds precisely to existential quantification over types, and use the observation to suggest proper extensions to the current static semantics of Standard ML.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type Systems for Modules Notes from Meeting #3

The paper presents second order type theory for the ML module system with generative functors. The key idea is to use existential quantification over types to account for type generativity to solve the avoidance problem, i.e. avoid leaking local abstract type variables. The solution is to make sure every type containing abstract type variables is prefixed with an existential that binds those ab...

متن کامل

Standard ML Type Generativity asExistential Quanti cationClaudio

One of the distinguishing features of Standard ML is the use of type generativity. Each declaration of a datatype binds a globally fresh type name to the type identiier introduced. Type generativity has been regarded as an extra-logical device which, though desirable in a programming language to ensure data abstraction, bears no close resemblance to type theoretic constructs. We show that it co...

متن کامل

Types for modules

The programming language Standard ML is an amalgam of two, largely orthogonal, languages. The Core language expresses details of algorithms and data structures. The Modules language expresses the modular architecture of a software system. Both languages are statically typed, with their static and dynamic semantics specified by a formal definition. Over the past decade, Standard ML Modules has b...

متن کامل

Non - Dependent Types for Standard MLModulesClaudio

Two of the distinguishing features of Standard ML Modules are its term dependent type syntax and the use of type generativity in its static semantics. From a type-theoretic perspective, the former suggests that the language involves rst-order dependent types, while the latter has been regarded as an extra-logical device that bears no direct relation to type-theoretic constructs. We reformulate ...

متن کامل

Towards a Simpler Account of Modules and Generativity: Abstract Types

We present a variant of the explicitly-typed secondorder polymorphic λ-calculus with primitive open existential types, i.e. a collection of more atomic constructs for introduction and elimination of existential types. We equip the language with a call-by-value small-step reduction semantics that enjoys the subject reduction property. Traditional closed existential types can be defined as syntac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996