Type Inference in a Database Programming Language

Atsushi Ohori; Peter Buneman

doi:10.1145/62678.62700

Type Inference in a Database Programming Language

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Publisher	ACM
Pages	174-183
Number of pages	10
ISBN (Print)	0-89791-273-X
DOIs	https://doi.org/10.1145/62678.62700
Publication status	Published - 1988

Access to Document

10.1145/62678.62700

http://dl.acm.org/citation.cfm?doid=62678.62700

Cite this

@inproceedings{eb81b594ecb34c3a9eb1dd9ee391fa65,

title = "Type Inference in a Database Programming Language",

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.",

author = "Atsushi Ohori and Peter Buneman",

year = "1988",

doi = "10.1145/62678.62700",

language = "English",

isbn = "0-89791-273-X",

pages = "174--183",

booktitle = "LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming",

publisher = "ACM",

}

TY - GEN

T1 - Type Inference in a Database Programming Language

AU - Ohori, Atsushi

AU - Buneman, Peter

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

U2 - 10.1145/62678.62700

DO - 10.1145/62678.62700

M3 - Conference contribution

SN - 0-89791-273-X

SP - 174

EP - 183

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

PB - ACM

ER -

Type Inference in a Database Programming Language

Abstract

Access to Document

Fingerprint

Cite this