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

Content Provider	ACM Digital Library
Author	Wells, J. B. Makholm, Henning
Abstract	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 developed type inference for first-class mixin modules, nor has anyone added Milner's let-polymorphism to such a system.This paper proves that typability is NP-complete for the naive approach followed by previous mixin module type systems. Because a λ-calculus extended with record concatenation is a simple restriction of our mixin module calculus, we also prove the folk belief that typability is NP-complete for the naive early type systems for record concatenation.To allow feasible type inference, we present Martini, a new system of simple types for mixin modules with principal typings. Martini is conceptually simple, with no subtyping and a clean and balanced separation between unification-based type inference with type and row variables and constraint solving for safety of linking and field extraction. We have implemented a type inference algorithm and we prove its complexity to be $O(n^{2}),$ or O(n) given a fixed bound on the number of field labels. To prove the complexity, we need to present an algorithm for row unification that may have been implemented by others, but which we could not find written down anywhere. Because Martini has principal typings, we successfully extend it with Milner's let-polymorphism.
Starting Page	156
Ending Page	167
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/1090189.1086386
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	40
Issue Number	9
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Type systems Mixin modules Row unification Record concatenation Polymorphism
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

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

Type inference, principal typings, and letpolymorphism for first-class mixin modules (2005)

Type inference and principal typings for symmetric record concatenation and mixin modules (2005)

Type inference and principal typings for symmetric record concatenation and mixin modules (2005)

Type Inference and Principal Typings for Symmetric Record Concatenation and Mixin Modules

HMF:simple type inference for first-class polymorphism

Flexible types:robust type inference for first-class polymorphism

Mixin' up the ML module system

Principal type inference for GADTs

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

Similar Documents

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

Type inference, principal typings, and letpolymorphism for first-class mixin modules (2005)

Type inference and principal typings for symmetric record concatenation and mixin modules (2005)

Type inference and principal typings for symmetric record concatenation and mixin modules (2005)

Type Inference and Principal Typings for Symmetric Record Concatenation and Mixin Modules

HMF:simple type inference for first-class polymorphism

Flexible types:robust type inference for first-class polymorphism

Mixin' up the ML module system

Principal type inference for GADTs

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