scispace - formally typeset
Journal ArticleDOI

Dynamic typing in polymorphic languages

Reads0
Chats0
TLDR
This work investigates the interplay of dynamic types with other advanced type constructions, discussing their integration into languages with explicit polymorphism (in the style of system F), implicit polymorphism, abstract data types, and subtyping.
Abstract
There are situations in programming where some dynamic typing is needed, even in the presence of advanced static type systems. We investigate the interplay of dynamic types with other advanced type constructions, discussing their integration into languages with explicit polymorphism (in the style of system F ), implicit polymorphism (in the style of ML), abstract data types, and subtyping.

read more

Citations
More filters
Book

Types and Programming Languages

TL;DR: This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
Proceedings ArticleDOI

Dynamic software updating

TL;DR: This work presents a new approach for C-like languages that provides type-safe dynamic updating of native code in an extremely flexible manner and permits the use of automated tools to aid the programmer in the updating process.
Proceedings ArticleDOI

Scrap your boilerplate: a practical design pattern for generic programming

TL;DR: This work describes a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types that makes essential use of rank-2 polymorphism, an extension found in some implementations of Haskell.

First-Class Phantom Types

TL;DR: This work proves type soundness and decidability for a Haskell-like language extended by first-class phantom types, which make type constraints explicit via type equations in the datatype cases themselves.
Proceedings ArticleDOI

Strongly typed heterogeneous collections

TL;DR: This work describes HLIST - a Haskell library for strongly typed heterogeneous collections including extensible records and raises interesting issues regarding Haskell's type system, in particular, avoidance of overlapping instances, and reification of type equality and type unification.
References
More filters
Book

The Definition of Standard ML

TL;DR: This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers, and the authors have defined their semantic objects in mathematical notation that is completely independent of StandardML.
Journal ArticleDOI

On understanding types, data abstraction, and polymorphism

TL;DR: A λ-calculus-based model for type systems that allows us to explore the interaction among the concepts of type, data abstraction, and polymorphism in a simple setting, unencumbered by complexities of production programming languages is developed.
Book ChapterDOI

Towards a theory of type structure

TL;DR: It can be shown that B maps every type expression into a functor from C T into C, that w = w' implies w[w] = B[w'], and that B[WlI: 2](~) = B [Wl][ D I t I B[ w2](D) ]
Journal ArticleDOI

Abstract types have existential type

TL;DR: This work uses a second-order typed lambda calculus SOL to show how data algebras may be given types, passed as parameters, and returned as results of function calls.