A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Database programming in Machiavelli---a polymorphic language with static type inference
1989
SIGMOD record
Preserved Fulltext
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 ...
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. ...
The form of polymorphism available in languages such as ML [HMT88] is intimately connected with a type inference system; and we regard type inference as a strategy for re-alizing this polymorphism. ...
doi:10.1145/66926.66931
fatcat:pktjago3gjcilgckej2o6vejii
Database programming in Machiavelli---a polymorphic language with static type inference
1989
Proceedings of the 1989 ACM SIGMOD international conference on Management of data - SIGMOD '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
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 ...
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. ...
The form of polymorphism available in languages such as ML [HMT88] is intimately connected with a type inference system; and we regard type inference as a strategy for re-alizing this polymorphism. ...
doi:10.1145/67544.66931
dblp:conf/sigmod/OhoriBT89
fatcat:lnv36khi4vbipiuexhdymoline
Polymorphism and type inference in database programming
1996
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a database programming language. ...
The combination provides a statically typed language in which relational databases may be cleanly represented as typed structures. ...
He has contributed to many of the ideas in this paper and has greatly helped us in our understanding of type systems. ...
doi:10.1145/227604.227609
fatcat:3tpv3te5jnb4lcgdxruqppd7uy
Polymorphic type inference for the relational algebra in the functional database programming language neon
2006
Proceedings of the 44th annual southeast regional conference on - ACM-SE 44
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present the functional database programming language Neon along with a polymorphic type inference algorithm that can infer a 'type formula', that is, a type together with type constraints, for any valid ...
A database programming language is a programming language extended with database operations. ...
There are several advantages of having a static, polymorphic type-system
Note on Terminology Both database theory and programming languages have their own terminology for quite similar concepts. ...
doi:10.1145/1185448.1185596
dblp:conf/ACMse/NagyS06
fatcat:dvtv54exdzevvmg2j3nx6rxhmm
Making standard ML a practical database programming language
2011
Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The type system of our language is largely based on Machiavelli, which demonstrates that ML with record polymorphism can represent type structure of SQL. ...
In the integrated language, the type system always infers a principal type for any type consistent SQL expression. ...
In our development, we adopt polymorphic typing of Machiavelli [30] , where the authors suggested that the programming language ML can be extended with an SQL-style declarative query language. ...
doi:10.1145/2034773.2034815
dblp:conf/icfp/OhoriU11
fatcat:7qaly4tinjhkplmrmwiang263y
Making standard ML a practical database programming language
2011
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The type system of our language is largely based on Machiavelli, which demonstrates that ML with record polymorphism can represent type structure of SQL. ...
In the integrated language, the type system always infers a principal type for any type consistent SQL expression. ...
In our development, we adopt polymorphic typing of Machiavelli [30] , where the authors suggested that the programming language ML can be extended with an SQL-style declarative query language. ...
doi:10.1145/2034574.2034815
fatcat:e2izvav3c5bqde4a2yzegmwpgm
On type systems for object-oriented database programming languages
2002
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The concept of an object-oriented database programming language (OODBPL) is appealing because it has the potential of combining the advantages of object orientation and database programming to yield a ...
The purpose of this article is to answer two questions: "What are the requirements that a modern type system for an object-oriented database programming language should satisfy?" ...
Languages with explicit typing require the programmer to insert type annotations in the program. Languages with implicit typing infer the types of expressions without any help from the programmer. ...
doi:10.1145/592642.592643
fatcat:mz2t56cf6vcpzisqgsckkgy77a
Page 1582 of Mathematical Reviews Vol. , Issue 92c
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The construction should support the development of a strongly typed programming language sufficient for database work and which supports static type inference and polymorphism. ...
Database programming has traditionally been weak in its support of static type-checking and polymorphism, while existing polymorphic systems cannot rep- resent even the relational model—being unable, for ...
A crash course on database queries
2007
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Complex database queries, like programs in general, can 'crash', i.e., can raise runtime errors. ...
We show how concepts and techniques from programming language theory, notably type systems and reflection, can be adapted to this end. ...
Fischer and Daniel Friedman who introduced him to the nested relational data model (more than twenty years ago) and to reflection in programming languages (more than fifteen years ago), respectively. ...
doi:10.1145/1265530.1265551
dblp:conf/pods/BusscheGV07
fatcat:rcsi7us5tjglbpgde6xdpcg2cm
A FAD for data intensive applications
1992
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Abstruct-FAD is a strongly-typed database programming language designed for uniformly manipulating transient and persistent data on Bubba, a parallel database system developed at MCC. ...
Comparisons with other database programming languages are provided. Index Terms-Complex objects, data model, database programming language, parallel database system, query optimization. ...
A unification-based algorithm for strong static typechecking is used in conjunction with abstract interpretation to infer unstated types and identify type errors in a FAD program at compile time [28] ...
doi:10.1109/69.124896
fatcat:qfykkw4yjrgjxkoptsar5wulku
Strong types for relational databases
2006
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell - Haskell '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we present a strongly typed embedding of a significant subset of SQL in Haskell. ...
We explain how type-level programming can be exploited to define a strongly-typed model of relational databases and operations on them. ...
Based on this type system, the experimental Machiavelli language for database programming was developed [22, 4] . ...
doi:10.1145/1159842.1159846
dblp:conf/haskell/SilvaV06
fatcat:4rrfu4rmbzfqhhnt7hsllcoxby
A polymorphic calculus for views and object sharing (extended abstract)
1994
Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed calculus uniformly integrates views and classes in a polymorphic type system of a database programming language similar to Machiavelli. ...
Through these properties, the programmer can enjoy full advantages of polymorphism and type inference when writing objectoriented database programs. ...
We hope that the framework presented here will serve as a typed foundation for statically typed polymorphic object-oriented database programming languages. ...
doi:10.1145/182591.182623
dblp:conf/pods/OhoriT94
fatcat:f37sxzhfonfcxnh3swy5foldni
A Functional Object Database Language
[chapter]
1994
Database Programming Languages (DBPL-4)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The language BCOOL is formally de ned using a denotational semantics approach. BCOOL is a functional object database language with a very exible, yet strong and statically checked, type system. ...
Originally, B C O O L w as used as a formal basis for a more traditional (relational algebra-style) database language, COOL. In this paper, though, BCOOL is presented on its own. ...
For this purpose, BCOOL serves as a formal basis for the integration of functional (database) languages supporting polymorphism, static type inferencing, and orthogonality (e.g., as in Machiavelli 16] ...
doi:10.1007/978-1-4471-3564-7_9
fatcat:22hreh62ovgvvexqf7sc2vbwpa
Bulk Types: Built-in or Add-On?
[chapter]
2000
Fully Integrated Data Environments
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The issues of bulk type definition and implementation as well as their integration into database programming languages are, therefore, key topics in current DBPL research. ...
; base predicates in deductive databases or extensionally defined functions in functional databases), one can distinguish two fundamentally different approaches to bulk type support within a language framework ...
like to thank Malcolm Atkinson, Catrieel Beeri and Peter Buneman for stimulating comments on this work and the referees for their constructive remarks on an earlier version of this paper that helped in ...
doi:10.1007/978-3-642-59623-0_16
fatcat:t6qmrfzzabhnhfrz5yb56f6754
Semantics of types for database objects
[chapter]
1983
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
systems of programming languages including static type inference and ML polymorphism. ...
As a result, database programming cannot share the benefits of recent developments in type theories of programming languages such as static type inference [40, 20] and polymorphism [40, 47] , which ...
doi:10.1007/3-540-50171-1_15
fatcat:jk2iqqjca5cyniux56ihevh23y
« Previous
Showing results 1 — 15 out of 30 results