Abstract types and the dot notation - Archive ouverte HAL Access content directly
Conference Papers Year :

Abstract types and the dot notation

(1) , (1, 2)
1
2

Abstract

We investigate the use of the dot notation in the context of abstract types. The dot notation -- that is, a.f referring to the operation f provided by the abstraction a -- is used by programming languages such as Modula-2 and CLU. We compare this notation with the Mitchell-Plotkin approach, which draws a parallel between type abstraction and (weak) existential quantification in constructive logic. The basic operations on existentials coming from logic give new insights about the meaning of type abstraction, but differ completely from the more familiar dot notation. In this paper, we formalize simple calculi equipped with the dot notation, and relate them to a more classical calculus a la Mitchell and Plotkin. This work provides some theoretical foundations for the dot notation, and suggests some useful extensions.
Fichier principal
Vignette du fichier
abstract-types-dot-notation.pdf (229.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01499980 , version 1 (01-04-2017)

Identifiers

  • HAL Id : hal-01499980 , version 1

Cite

Luca Cardelli, Xavier Leroy. Abstract types and the dot notation. IFIP TC2 working conference on programming concepts and methods, IFIP, Apr 1990, Tiberias, Israel. pp.479-504. ⟨hal-01499980⟩

Collections

ENS-PARIS PSL
178 View
251 Download

Share

Gmail Facebook Twitter LinkedIn More