Article

Free access

Type inference in a database programming language

Authors:

Atsushi Ohori,

Peter BunemanAuthors Info & Claims

LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming

Pages 174 - 183

https://doi.org/10.1145/62678.62700

Published: 01 January 1988 Publication History

PDF eReader

Abstract

We extend an ML-like implicit type system to include a number of structures and operations that are common in database programming including sets, labeled records, joins and projections. We then show that the type inference problem of the system is decidable by extending the notion of principal type schemes to include conditions on substitutions. Combined with Milner's polymorphic let constructor, our language also supports type inheritance.

References

[1]

O.P. Buneman and A. Ohori. Using Powerdomains to Generalize Relational Databases. Theoreical Computer Science, To Appear, 1988. Available as a technical report from Department of Computer and Information Science, University of Pennsylvania.

Digital Library

Google Scholar

[2]

L. Cardelli. A Semantics of Multiple Inheritance. In Semantics of Data Types, Lecture Notes in Computer Science 173, Springer-Vcrlag, 1984.

Digital Library

Google Scholar

[3]

L. Cardelli and P. Wegner. On Understanding Types, Data Abstraction, and Polymorphism. Computing $urverys, 17(4):471-522, December 1986.

Digital Library

Google Scholar

[4]

C. Dwork, P. Kanellakis, and J. Mitchell. On the Sequential Nature of Unification. Journal of Logic Programming, 1:35-50, 1984.

Digital Library

Google Scholar

[5]

L. Damas and R. Milner. Principal type-schemes for functional programs, in 9-th A CM Symposium on Principles of Programming Languages, pages 207-212, 1982.

Digital Library

Google Scholar

[6]

M.R. Garey and D. S. Johnson. Computer and intractability, A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.

Digital Library

Google Scholar

[7]

E.M. Gold. Complexity of automaton identification from given data. 1974. Unpublished manuscript, Reference found in {GJ79}.

Google Scholar

[8]

R. Harper, D. B. MacQueen, and R. Milner. Standard ML. LFCS Report Series ECS-LFCS-86-2, Department of Computer Science, University of Edinburgh, March 1986.

Google Scholar

[9]

R. Milner. A Theory of Type Polymorphism in Programming. Journal of Uompater and System Sciences, 17:348-375, 1978.

Google Scholar

[10]

J.C. Mitchell. Coercion and Type inference. In Proc. l l-th A CM Symposium on Principles of Programming Languages, pages 17.5-185, 1984.

Digital Library

Google Scholar

[11]

Robinson, J. A. A machine-oriented logic based on the resolution principle. Journal o/the ACM, 12:23-41, March 1965.

Digital Library

Google Scholar

[12]

R. Stansifer. Type Inference with Subtypes. In Proc. 15*th A CM Symposium on Principles of Programming Languages, pages 88-97, 1988.

Digital Library

Google Scholar

[13]

M. Wand. Complete Type Inference for Simple Objects. In Proceedings of the Second Anual Symposium on Logic in Uompater Science, pages 37-44, Ithaca, New York, June 1987.

Google Scholar

Cited By

View all

Paszke AXie NCong YDagand P(2023)Infix-Extensible Record Types for Tabular DataProceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3609027.3609406(29-43)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3609027.3609406
Alves SRamos M(2021)An ML-style Record Calculus with Extensible RecordsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.351.1351(1-17)Online publication date: 29-Dec-2021
https://doi.org/10.4204/EPTCS.351.1
Ataei PKhan FWalkingshaw ETilevich EDe Roover C(2021)A variational database management systemProceedings of the 20th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences10.1145/3486609.3487197(29-42)Online publication date: 17-Oct-2021
https://dl.acm.org/doi/10.1145/3486609.3487197
Show More Cited By

Index Terms

Type inference in a database programming language
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Data model extensions
    2. Query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)

Recommendations

Polymorphism and type inference in database programming

In order to find a static type system that adequately supports database languages, we need to express the most general type of a program that involves database operations. This can be achieved through an extension to the type system of ML that captures ...
Database programming in Machiavelli—a polymorphic language with static type inference
SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data

Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and appropriate for database applications. In particular, a function that ...
Database programming in Machiavelli—a polymorphic language with static type inference

Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and appropriate for database applications. In particular, a function that ...

Comments

Information & Contributors

Information

Published In

LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming

January 1988

351 pages

ISBN:089791273X

DOI:10.1145/62678

Chairman:
Jerome Chailloux
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 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

LISP88

Sponsor:

LISP88: Lisp & Functional Programming 88

July 25 - 27, 1988

Utah, Snowbird, USA

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
449
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)17

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Paszke AXie NCong YDagand P(2023)Infix-Extensible Record Types for Tabular DataProceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3609027.3609406(29-43)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3609027.3609406
Alves SRamos M(2021)An ML-style Record Calculus with Extensible RecordsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.351.1351(1-17)Online publication date: 29-Dec-2021
https://doi.org/10.4204/EPTCS.351.1
Ataei PKhan FWalkingshaw ETilevich EDe Roover C(2021)A variational database management systemProceedings of the 20th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences10.1145/3486609.3487197(29-42)Online publication date: 17-Oct-2021
https://dl.acm.org/doi/10.1145/3486609.3487197
Ohori AUeno KHoshi KNozaki SSato TMakabe TIto Y(2014)SML# in industryACM SIGPLAN Notices10.1145/2692915.262816449:9(167-173)Online publication date: 19-Aug-2014
https://dl.acm.org/doi/10.1145/2692915.2628164
Ohori AUeno KHoshi KNozaki SSato TMakabe TIto YJeuring JChakravarty M(2014)SML# in industryProceedings of the 19th ACM SIGPLAN international conference on Functional programming10.1145/2628136.2628164(167-173)Online publication date: 19-Aug-2014
https://dl.acm.org/doi/10.1145/2628136.2628164
Benzaken VCastagna GNguyen KSiméon J(2013)Static and dynamic semantics of NoSQL languagesACM SIGPLAN Notices10.1145/2480359.242908348:1(101-114)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429083
Benzaken VCastagna GNguyen KSiméon JGiacobazzi RCousot R(2013)Static and dynamic semantics of NoSQL languagesProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2429069.2429083(101-114)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2429069.2429083
Alexe BBurdick DHernández MKoutrika GKrishnamurthy RPopa LStanoi IWisnesky R(2013)High-Level Rules for Integration and Analysis of Data: New ChallengesIn Search of Elegance in the Theory and Practice of Computation10.1007/978-3-642-41660-6_3(36-55)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41660-6_3
Ohori A(2013)Record Polymorphism: Its Development and ApplicationsIn Search of Elegance in the Theory and Practice of Computation10.1007/978-3-642-41660-6_23(432-444)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41660-6_23
Ohori AUeno KChakravarty MHu ZDanvy O(2011)Making standard ML a practical database programming languageProceedings of the 16th ACM SIGPLAN international conference on Functional programming10.1145/2034773.2034815(307-319)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034773.2034815
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Polymorphism and type inference in database programming

Database programming in Machiavelli—a polymorphic language with static type inference

Database programming in Machiavelli—a polymorphic language with static type inference

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Polymorphism and type inference in database programming

Database programming in Machiavelli—a polymorphic language with static type inference

Database programming in Machiavelli—a polymorphic language with static type inference

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations