Filters








36,797 Hits in 3.4 sec

Polymorphism and type inference in database programming

Peter Buneman, Atsushi Ohori
1996 ACM Transactions on Database Systems  
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a database programming language.  ...  T h e detection of type errors in a program before it is executed is, we believe, of great importance in database programming, which is characterized by t h e complexity and size of t h e d a t a 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

Lajos Nagy, Ryan Stansifer
2006 Proceedings of the 44th annual southeast regional conference on - ACM-SE 44  
The type inference algorithm has been successfully implemented in Haskell. for a database programming language. Buneman and Ohori [2] mention the following: Separate Compilation.  ...  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  ...  INTRODUCTION Traditionally, database applications are programs that access data stored in a Database Management System (DBMS).  ... 
doi:10.1145/1185448.1185596 dblp:conf/ACMse/NagyS06 fatcat:dvtv54exdzevvmg2j3nx6rxhmm

Database programming in Machiavelli---a polymorphic language with static type inference

Atsushi Ohori, Peter Buneman, Val Breazu-Tannen
1989 SIGMOD record  
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  ...  When combined with a set data type and database operations including join and projection, this provides a natural medium for relational database programming.  ...  Acknowledgement We would like to thank Malcolm Atkinson for his careful reading of this paper and many helpful comments.  ... 
doi:10.1145/66926.66931 fatcat:pktjago3gjcilgckej2o6vejii

Database programming in Machiavelli---a polymorphic language with static type inference

Atsushi Ohori, Peter Buneman, Val Breazu-Tannen
1989 Proceedings of the 1989 ACM SIGMOD international conference on Management of data - SIGMOD '89  
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  ...  When combined with a set data type and database operations including join and projection, this provides a natural medium for relational database programming.  ...  Acknowledgement We would like to thank Malcolm Atkinson for his careful reading of this paper and many helpful comments.  ... 
doi:10.1145/67544.66931 dblp:conf/sigmod/OhoriBT89 fatcat:lnv36khi4vbipiuexhdymoline

Making standard ML a practical database programming language

Atsushi Ohori, Katsuhiro Ueno
2011 Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11  
In the integrated language, the type system always infers a principal type for any type consistent SQL expression.  ...  Integrating a database query language into a programming language is becoming increasingly important in recently emerging high-level cloud computing and other applications, where efficient and sophisticated  ...  SML#: Standard ML with record polymorphism and interoperability with C SML# embodies record polymorphism and infers a polymorphic type for record operations as seen in the following example: # fun getName  ... 
doi:10.1145/2034773.2034815 dblp:conf/icfp/OhoriU11 fatcat:7qaly4tinjhkplmrmwiang263y

Making standard ML a practical database programming language

Atsushi Ohori, Katsuhiro Ueno
2011 SIGPLAN notices  
In the integrated language, the type system always infers a principal type for any type consistent SQL expression.  ...  Integrating a database query language into a programming language is becoming increasingly important in recently emerging high-level cloud computing and other applications, where efficient and sophisticated  ...  SML#: Standard ML with record polymorphism and interoperability with C SML# embodies record polymorphism and infers a polymorphic type for record operations as seen in the following example: # fun getName  ... 
doi:10.1145/2034574.2034815 fatcat:e2izvav3c5bqde4a2yzegmwpgm

Dynamic constraint detection for polymorphic behavior

Nadya Kuzmina, Ruben Gamboa
2006 Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '06  
different declared and runtime types.  ...  This paper shows how this technique can be extended to detect invariants of object-oriented programs in the presence of polymorphism by examining the runtime type of a polymorphic variable, which may have  ...  In the presence of polymorphism, Turnip examines the actual runtime class of each program variable to infer properties that likely hold for the fields in the examined runtime class.  ... 
doi:10.1145/1176617.1176659 dblp:conf/oopsla/KuzminaG06 fatcat:dyau6mnwa5aj5cau6gerju42d4

Page 2858 of Mathematical Reviews Vol. , Issue 94e [page]

1994 Mathematical Reviews  
(F-INRIA; Le Chesnay) Intersection types and bounded polymorphism. (English summary) Typed lambda calculi and applications (Utrecht, 1993), 346-360, Lecture Notes in Comput.  ...  of the relevant completed database comp(REL(P)), where comp(REL(P)) is always consistent even if comp(P) is inconsistent.” 94e:68115 68Q55 Smith, Geoffrey S. (1-CRNL,; Ithaca, NY) Polymorphic type inference  ... 

Page 6278 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
Type inference is an extensively studied topic in the theory of polymorphic languages. This paper deals with type inference for relational algebra.  ...  As relational algebra is very different from the programming languages usually considered in type inference, do- ing type inference for relational algebra is not a straightforward application of existing  ... 

Static type inference for parametric classes

A. Ohori, P. Buneman
1989 Conference proceedings on Object-oriented programming systems, languages and applications - OOPSLA '89  
The type correctness of class declarations is statically checked, and a principal scheme is inferred for any type correct program containing methods and objects defined in classes.  ...  Moreover, the type system can be extended to include the structures and operations needed for database programming and therefore can serve as a basis of an object-oriented database programming language  ...  In particular, he pointed out the limitation of single sub variable mentioned above.  ... 
doi:10.1145/74877.74923 dblp:conf/oopsla/OhoriB89 fatcat:x5ldjk76wvcptavt2da5manrp4

Static type inference for parametric classes

A. Ohori, P. Buneman
1989 SIGPLAN notices  
The type correctness of class declarations is statically checked, and a principal scheme is inferred for any type correct program containing methods and objects defined in classes.  ...  Moreover, the type system can be extended to include the structures and operations needed for database programming and therefore can serve as a basis of an object-oriented database programming language  ...  In particular, he pointed out the limitation of single sub variable mentioned above.  ... 
doi:10.1145/74878.74923 fatcat:cszor2migndrletthkhcq547me

A crash course on database queries

Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren
2007 Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07  
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

Ur

Adam Chlipala
2010 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation - PLDI '10  
In particular, the ability to use functional programs as specifications enables statically-typed metaprogramming: programs write programs, and static type-checking guarantees that the generating process  ...  Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking.  ...  Acknowledgments We thank Manu Sridharan, Ryan Wisnesky, and the anonymous referees for helpful feedback on drafts of this paper.  ... 
doi:10.1145/1806596.1806612 dblp:conf/pldi/Chlipala10 fatcat:hggkctfnunb4neilqxw4sfaiau

Polymorphic type inference for the relational algebra [article]

Jan Van den Bussche, Emmanuel Waller
2001 arXiv   pre-print
Topics discussed include complexity and polymorphic expressive power.  ...  The principal type of an expression is a formula that specifies, in a clear and concise manner, all assignments of types (sets of attributes) to relation names, under which a given relational algebra expression  ...  Acknowledgment We thank Serge Abiteboul, who suggested the idea of type inference for relational algebra to the second author many years ago; Didier Rémy and Limsoon Wong, for helpful conversations; and  ... 
arXiv:cs/0106035v1 fatcat:a5wjicqi6zevtiolrb72c35bvu

Ur

Adam Chlipala
2010 SIGPLAN notices  
In particular, the ability to use functional programs as specifications enables statically-typed metaprogramming: programs write programs, and static type-checking guarantees that the generating process  ...  Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking.  ...  Acknowledgments We thank Manu Sridharan, Ryan Wisnesky, and the anonymous referees for helpful feedback on drafts of this paper.  ... 
doi:10.1145/1809028.1806612 fatcat:aetz74fdovcy3cgl4eioi7yqia
« Previous Showing results 1 — 15 out of 36,797 results