Article

Free access

Type inference in the polymorphic relational algebra

Authors:

Jan van den Bussche,

Emmanuel WallerAuthors Info & Claims

PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 80 - 90

https://doi.org/10.1145/303976.303984

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

A.V. Aho, R. Sethi, and J.D. Ullman. Compilers. Addison-Wesley, 1986.

Google Scholar

[2]

A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proceedings FPCA '93 Conference on Functional Programming Languages and Computer Architecture, pages 31-41. ACM Press, 1993.

Digital Library

Google Scholar

[3]

A. Aiken, E.L. Wimmers, and T.K. Lakshman. Soft typing with conditional types. In Con{erence Record ~lst A CM Symposium on Principles of Programming Languages, pages 163-173. ACM Press, 1994.

Digital Library

Google Scholar

[4]

L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Proceedings 8th IEEE Symposium on Logic in Computer Science, pages 75-83. IEEE Computer Society Press, 1993.

Crossref

Google Scholar

[5]

E. BSrger, E. Gr~del, and Y. Gurevich. The Classical Decision Problem. Springer, 1997.

Google Scholar

[6]

P. Buneman, S. Davidson, M. Fernandez, and D. Suciu. Adding structure to unstructured data. In F. Afrati and Ph. Kolaitis, editors, Database TheoryDICDT'97, volume 1186 of Lecture Notes in Computer Science, pages 336-350. Springer, 1997.

Digital Library

Google Scholar

[7]

P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization techniques for unstructured data. In Proceedings of the 1996 A CM SIGMOD International Conference on Management of Data, issue 25:2 of SIGMOD Record, pages 505-516. ACM Press, 1996.

Digital Library

Google Scholar

[8]

H. Garcia-Molina, Y. Papakonstantinou, D. Quass, A. Rajaraman, Y. Sagiv, J. Ullman, V. Vassalos, and J. Widom. The TSIMMIS approach to mediation: data models and languages. Journal of Intelligent Information Systems, 8(2):117-132, 1997.

Digital Library

Google Scholar

[9]

P. Giannini, F. Honsell, and S. Ronchi della Rocca. Type inference: some results, some problems. Fundamenta Informaticae, 19:87-125, 1993.

Digital Library

Google Scholar

[10]

C.A. Gunter and J.C. Mitchell, editors. Theoretical Aspects of Object-Oriented Programming. MIT Press, 1994.

Digital Library

Google Scholar

[11]

J.R. Hindley. Basic Simple Type Theory. Cambridge University Press, 1997.

Digital Library

Google Scholar

[12]

J. Melton. Understanding SQL's Stored Procedures. Morgan Kaufmann, 1998.

Digital Library

Google Scholar

[13]

J.C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.

Digital Library

Google Scholar

[14]

A. Ohori and P. Buneman. Polymorphism and type inference in database programming. A CM Transactions on Database Systems, 21(1):30-76, 1996.

Digital Library

Google Scholar

[15]

A. Ohori, P. Buneman, and V. Breazu-Tannen. Database programming in Machiavelli--a polymorphic language with static type inference. In Proceedings of the 1989 A CM SIGMOD International Con}erence on the Management of Data, issue 18:2 of SIGMOD Record, pages 46-57. ACM Press, 1989.

Digital Library

Google Scholar

[16]

D. R~my. Type inference for records in a natural extension of ML. in Gunter and Mitchell {10}, pages 67-96.

Google Scholar

[17]

D. R~my. Typing record concatenation for free. In Gunter and Mitchell {10}, pages 351-372.

Digital Library

Google Scholar

[18]

D. Stemple et al. Exceeding the limits of polymorphism in database programming languages. In F. Bancilhon, C. Thanos, and D. Tsichritzis, editors, Advances in Database TechnologyDEDBT'90, volume 416 of Lecture Notes in Computer Science, pages 269-285. Springer- Verlag, 1990.

Digital Library

Google Scholar

[19]

J. Tiuryn. Type inference problems: a survey. In B. Rovan, edito:r, Mathematical Foundations of Computer Science, volume 452 of Lecture Notes in Computer Science, pages 105-120, 1990.

Digital Library

Google Scholar

[20]

G.S. Tseitin. On the complexity of derivation in propositional calculus, in J. Siekmann and G. Wrightson, editors, Automat:ion of Reasoning, volume 2, pages 466- 486. Springer, 1983.

Crossref

Google Scholar

[21]

J.D. Ullman. Elements of ML Programming. Prentice- Hall, 1998.

Digital Library

Google Scholar

Cited By

View all

Curcin VGhanem MGuo Y(2010)Polymorphic type framework for scientific workflows with relational data modelInternational Journal of Business Process Integration and Management10.1504/IJBPIM.2010.0331745:1(45)Online publication date: 2010
https://doi.org/10.1504/IJBPIM.2010.033174
Nagy LStansifer RMenezes R(2006)Polymorphic type inference for the relational algebra in the functional database programming language neonProceedings of the 44th annual ACM Southeast Conference10.1145/1185448.1185596(673-678)Online publication date: 10-Mar-2006
https://dl.acm.org/doi/10.1145/1185448.1185596

Index Terms

Type inference in the polymorphic relational algebra

Recommendations

Polymorphic type inference for the relational algebra in the functional database programming language neon
ACMSE '06: Proceedings of the 44th annual ACM Southeast Conference

A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and the operations of the relational algebra. We present the functional ...
Polymorphic type inference
POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

The benefits of strong typing to disciplined programming, to compile-time error detection and to program verification are well known. Strong typing is especially natural for functional (applicative) languages, in which function application is the central ...
Polymorphic type inference and abstract data types

Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

May 1999

374 pages

ISBN:1581130627

DOI:10.1145/303976

Chairmen:
Victor Vianu
Univ. of California, San Diego
,
Christos Papadimitriou
Univ. of California, Berkeley

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 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS99

Sponsor:

SIGMOD/PODS99: International Conference on Management of Data and Symposium on Principles of Database Systems

May 31 - June 3, 1999

Pennsylvania, Philadelphia, USA

Acceptance Rates

PODS '99 Paper Acceptance Rate 32 of 116 submissions, 28%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
408
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)3

Reflects downloads up to 27 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Curcin VGhanem MGuo Y(2010)Polymorphic type framework for scientific workflows with relational data modelInternational Journal of Business Process Integration and Management10.1504/IJBPIM.2010.0331745:1(45)Online publication date: 2010
https://doi.org/10.1504/IJBPIM.2010.033174
Nagy LStansifer RMenezes R(2006)Polymorphic type inference for the relational algebra in the functional database programming language neonProceedings of the 44th annual ACM Southeast Conference10.1145/1185448.1185596(673-678)Online publication date: 10-Mar-2006
https://dl.acm.org/doi/10.1145/1185448.1185596

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

Polymorphic type inference for the relational algebra in the functional database programming language neon

Polymorphic type inference

Polymorphic type inference and abstract data types