Type inference in a database programming language

Atsushi Ohori, Peter Buneman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

41 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the 1988 ACM Conference on LISP and Functional Programming, LFP 1988
PublisherAssociation for Computing Machinery, Inc
Pages174-183
Number of pages10
ISBN (Electronic)089791273X, 9780897912730
DOIs
Publication statusPublished - 1988 Jan 1
Externally publishedYes
Event1988 ACM Conference on LISP and Functional Programming, LFP 1988 - Snowbird, United States
Duration: 1988 Jul 251988 Jul 27

Publication series

NameProceedings of the 1988 ACM Conference on LISP and Functional Programming, LFP 1988

Other

Other1988 ACM Conference on LISP and Functional Programming, LFP 1988
CountryUnited States
CitySnowbird
Period88/7/2588/7/27

ASJC Scopus subject areas

  • Modelling and Simulation
  • Software
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Type inference in a database programming language'. Together they form a unique fingerprint.

Cite this