Abstract types and the dot notation

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01499980
Contributor : Xavier Leroy <>
Submitted on : Saturday, April 1, 2017 - 8:20:16 PM
Last modification on : Tuesday, April 24, 2018 - 5:20:13 PM
Long-term archiving on : Sunday, July 2, 2017 - 12:51:00 PM

File

abstract-types-dot-notation.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01499980, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

132

Files downloads

85