Article

Free access

Extending record typing to type parametric modules with sharing

Author:

Maria Virginia AponteAuthors Info & Claims

POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 465 - 478

https://doi.org/10.1145/158511.158704

Published: 01 March 1993 Publication History

PDF eReader

Abstract

We extend term unification techniques used to type extensible records in order to solve the two main typing problems for modules in Standard ML: matching and sharing. We obtain a type system for modules based only on well known unification problems, modulo some equational theories we define. Our formalization is simple and has the elegance of polymorphic type disciplines based on unification. It can be seen as a synthesis of previous work on module and record typing.

References

[1]

Maria Virginia Aponte. Typage d'un syst~me de modules paramdtriques avec partage: une application de l'unification dans les thdories dquationnelles. Th&se de doctorat, Universit~ de Paris 7, 1992.

Google Scholar

[2]

You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In TAPSOFT'89, 1989.

Digital Library

Google Scholar

[3]

Robert Harper, Robin Milner, and Mads Tofte. A type discipline for program modules. In Theory and Practice of Programming Languages, volume 250 of Lecture Notes in Computer Science. Springer Verlag, 1987.

Digital Library

Google Scholar

[4]

Robert Harper and John C. Mitchell. The essence of ML. in Fifteenth A CM Symposium on Principles of Programming Languages, 1988.

Digital Library

Google Scholar

[5]

David MacQueen. Modules for standard ML. Polymorphism Newsletter, iI, 1985.

Google Scholar

[6]

Robin Milner and Mads Tofte. Commentary on Standard ML. The MIT Press, 1991.

Digital Library

Google Scholar

[7]

Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. The MIT Press, 1990.

Digital Library

Google Scholar

[8]

Didier R4my. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989.

Google Scholar

[9]

Didier R@my. Algbres Touffues. Application au Typage Polymorphe des Objects Enregistrements dans les Langages Fonctionnels. Th~se de doctorat, Universit de Paris 7, 1990.

Google Scholar

[10]

Didier Rmy. Type inference for records in a natural extension of ML. Technical Report 1431, Inria, Rocquencourt, May 1991. Also in {Rem90}, chapter 4.

Google Scholar

[11]

Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1987.

Google Scholar

[12]

Mads Tofte. Principal signatures for higher-order program modules. In 19th A CM Symposium on Principles of Programming Languages, 1992.

Digital Library

Google Scholar

[13]

Mitchell Wand. Complete type inference for simple objects. In Second Symposium on Logic In Computer Science, 1987.

Google Scholar

Cited By

View all

Leroy X(2008)A syntactic theory of type generativity and sharingJournal of Functional Programming10.1017/S09567968000019336:5(667-698)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001933
Tofte M(2008)Principal signatures for higher-order program modulesJournal of Functional Programming10.1017/S09567968000010884:3(285-335)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001088
Aponte MCosmo R(2005)Type isomorphisms for module signaturesProgramming Languages: Implementations, Logics, and Programs10.1007/3-540-61756-6_95(334-346)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61756-6_95
Show More Cited By

Index Terms

Extending record typing to type parametric modules with sharing
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Modules / packages
        Procedures, functions and subroutines
      2. Language types
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs
      2. Type structures

Recommendations

Parametric quantifiers for dependent type theory

Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions cannot inspect their type argument and will therefore apply the same algorithm to any type they are instantiated on. This idea is formalized mathematically ...
Type inference for record concatenation and subtyping

Record concatenation, multiple inheritance, and multiple-object cloning are closely related and part of various language designs. For example, in Cardelli's untyped Obliq language, a new object can be constructed from several existing objects by cloning ...
Type inference, principal typings, and let-polymorphism for first-class mixin modules
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

A mixin module is a programming abstraction that simultaneously generalizes λ-abstractions, records, and mutually recursive definitions. Although various mixin module type systems have been developed, no one has investigated principal typings or ...

Comments

Information & Contributors

Information

Published In

POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

March 1993

510 pages

ISBN:0897915607

DOI:10.1145/158511

Chairmen:
Mary Van Deusen
IBM Watson Research Center
,
Bernard Lang
INRIA Rocquencourt

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL93

Sponsor:

POPL93: 20th ACM Symposium on Principles of Programming Languages

South Carolina, Charleston, USA

Acceptance Rates

POPL '93 Paper Acceptance Rate 39 of 199 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
260
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)7

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Leroy X(2008)A syntactic theory of type generativity and sharingJournal of Functional Programming10.1017/S09567968000019336:5(667-698)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001933
Tofte M(2008)Principal signatures for higher-order program modulesJournal of Functional Programming10.1017/S09567968000010884:3(285-335)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001088
Aponte MCosmo R(2005)Type isomorphisms for module signaturesProgramming Languages: Implementations, Logics, and Programs10.1007/3-540-61756-6_95(334-346)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61756-6_95
Bert DOriat C(2005)A model inference system for generic specification with application to code sharingTAPSOFT '95: Theory and Practice of Software Development10.1007/3-540-59293-8_232(741-755)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59293-8_232
Tofte MBirkedal L(1998)A region inference algorithmACM Transactions on Programming Languages and Systems10.1145/291891.29189420:4(724-767)Online publication date: 1-Jul-1998
https://dl.acm.org/doi/10.1145/291891.291894
Jones MBoehm HSteele G(1996)Using parameterized signatures to express modular structureProceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/237721.237731(68-78)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237721.237731
Leroy XBoehm HLang BYellin D(1994)Manifest types, modules, and separate compilationProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/174675.176926(109-122)Online publication date: 1-Feb-1994
https://dl.acm.org/doi/10.1145/174675.176926

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Parametric quantifiers for dependent type theory

Type inference for record concatenation and subtyping

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Parametric quantifiers for dependent type theory

Type inference for record concatenation and subtyping

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations