Type inference in a database programming language

  • Authors:
  • Atsushi Ohori;Peter Buneman

  • Affiliations:
  • Department of Computer and Information Science/D2, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science/D2, University of Pennsylvania, Philadelphia, PA

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

Quantified Score

Hi-index 0.00

Visualization

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.