Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference.

Atsushi Ohori, Peter Buneman, Val Tannen: Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference. SIGMOD Conference 1989: 46-57

@inproceedings{DBLP:conf/sigmod/OhoriBT89,
  author    = {Atsushi Ohori and
               Peter Buneman and
               Val Tannen},
  editor    = {James Clifford and
               Bruce G. Lindsay and
               David Maier},
  title     = {Database Programming in Machiavelli - a Polymorphic Language
               with Static Type Inference},
  booktitle = {Proceedings of the 1989 ACM SIGMOD International Conference on
               Management of Data, Portland, Oregon, May 31 - June 2, 1989},
  publisher = {ACM Press},
  year      = {1989},
  pages     = {46-57},
  ee        = {http://doi.acm.org/10.1145/67544.66931, db/conf/sigmod/OhoriBT89.html},
  crossref  = {DBLP:conf/sigmod/89},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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 selects a field f of a records is polymorphic in the sense that it can be applied to any record which contains a field f with the appropriate type. When combined with a set data type and database operations including join and projection, this provides a natural medium for relational database programming. Moreover, by implementing database objects as reference types and generating the appropriate views - sets of structures with "identity" - we can achieve a degree of static type checking for object-oriented databases.

Copyright © 1989 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/smod7592 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

James Clifford, Bruce G. Lindsay, David Maier (Eds.): Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May 31 - June 2, 1989. ACM Press 1989

, SIGMOD Record 18(2), June 1989
Contents

Online Edition: ACM Digital Library

References

[AB87]: Malcolm P. Atkinson, Peter Buneman: Types and Persistence in Database Programming Languages. ACM Comput. Surv. 19(2): 105-190(1987)
[ABC*83]: Malcolm P. Atkinson, Peter J. Bailey, Kenneth Chisholm, W. Paul Cockshott, Ronald Morrison: An Approach to Persistent Programming. Comput. J. 26(4): 360-365(1983)
[ACO85]: Antonio Albano, Luca Cardelli, Renzo Orsini: Galileo: A Strongly-Typed, Interactive Conceptual Language. ACM Trans. Database Syst. 10(2): 230-260(1985)
[AH87]: Serge Abiteboul, Richard Hull: IFO: A Formal Semantic Database Model. ACM Trans. Database Syst. 12(4): 525-565(1987)
[BBKV88]: François Bancilhon, Ted Briggs, Setrag Khoshafian, Patrick Valduriez: FAD, a Powerful and Simple Database Language. VLDB 1987: 97-105
[BCGS]: ...
[BO88]: Peter Buneman, Achim Jung, Atsushi Ohori: Using Powerdomains to Generalize Relational Databases. Theor. Comput. Sci. 91(1): 23-55(1991)
[Car84a]: ...
[Car84b]: ...
[CDJS86]: Michael J. Carey, David J. DeWitt, Joel E. Richardson, Eugene J. Shekita: Object and File Management in the EXODUS Extensible Database System. VLDB 1986: 91-100
[CM84]: George P. Copeland, David Maier: Making Smalltalk a Database System. SIGMOD Conference 1984: 316-325
[Cou83]: Bruno Courcelle: Fundamental Properties of Infinite Trees. Theor. Comput. Sci. 25: 95-169(1983)
[CW85]: Luca Cardelli, Peter Wegner: On Understanding Types, Data Abstraction, and Polymorphism. ACM Comput. Surv. 17(4): 471-522(1985)
[Eli82]: ...
[HK87]: Richard Hull, Roger King: Semantic Database Modeling: Survey, Applications, and Research Issues. ACM Comput. Surv. 19(3): 201-260(1987)
[HMT88]: ...
[JM88]: ...
[Mai89]: ...
[Mil78]: Robin Milner: A Theory of Type Polymorphism in Programming. J. Comput. Syst. Sci. 17(3): 348-375(1978)
[OB88]: ...
[OBS86]: Patrick O'Brien, Bruce Bullis, Craig Schaffert: Persistent and Shared Objects in Trellis/Owl. OODBS 1986: 113-123
[Oho88]: Atsushi Ohori: Semantics of Types for Database Objects. ICDT 1988: 239-251
[Oho89]: ...
[Sch77]: Joachim W. Schmidt: Some High Level Language Constructs for Data of Type Relation. ACM Trans. Database Syst. 2(3): 247-261(1977)
[Sta88]: Ryan Stansifer: Type Inference with Subtypes. POPL 1988: 88-97
[Tur85]: ...
[Wan87]: Mitchell Wand: Complete Type Inference for Simple Objects. LICS 1987: 37-44