1 Foreword Can Object-Oriented Databases be Statically Typed? ∗ (2008)
Val Breazu-tannen, Peter Buneman, Atsushi Ohori
Can there be a database programming language with a type system that matches the data model? Can such a language be strongly typed? Can it be statically typed? A static type system for database...
Strongman: A Scalable Solution to Trust Management in Networks (2001)
Val Breazu-tannen, Angelos Dennis Keromytis, Angelos Dennis Keromytis
STRONGMAN: A Scalable Solution to Trust Management in Networks Angelos Dennis Keromytis Jonathan M. Smith The design principle of restricting local autonomy only where necessary for global robustness...
A Query Language for NC (1994)
We show that a form of divide and conquer recursion on sets together with the relational algebra expresses exactly the queries over ordered relational databases which are NC -computable. At a finer...
A Query Language for NC (1994)
We show that a form of divide and conquer recursion on sets together with the relational algebra expresses exactly the queries over ordered relational databases which are NC - computable. At a finer...
Naturally Embedded Query Languages (1992)
Val Breazu-tannen, Peter Buneman, Limsoon Wong
We investigate the properties of a simple programming language whose main computational engine is structural recursion on sets. We describe a progression of sublanguages in this paradigm that (1)...
Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference (1992)
Atsushi Ohori, Peter Buneman, Val Breazu-tannen
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...
Data structures and data types in objectoriented databases (1991)
Val Breazu-tannen, Peter Buneman, Atsushi Ohori
The possibility of finding a static type system for object-oriented programming languages was initiated by Cardelli [Car88, CW85] who showed that it is possible to express the polymorphic nature of...
Inheritance As Implicit Coercion (1991)
Val Breazu-tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
. We present a method for providing semantic interpretations for languages with a type system featuring inheritance polymorphism. Our approach is illustrated on an extension of the language Fun of...
Logical and Computational Aspects of Programming with Sets/Bags/Lists (1991)
Val Breazu-tannen, Ramesh Subrahmanyam
. We study issues that arise in programming with primitive recursion over non-free datatypes such as lists, bags and sets. Programs written in this style can lack a meaning in the sense that their...
Structural Recursion as a Query Language (1991)
Val Breazu-tannen, Peter Buneman, Shamim Naqvi
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. Its main computational...
A Study of Semantics, Types, and Languages for Databases and Object Oriented Programming (1989)
Peter Buneman, Val Breazu-tannen, Jean Gallier, Atsushi Ohori, Atsushi Ohori
The purpose of this thesis is to investigate a type system for databases and object-oriented programming and to design a statically typed programming language for these applications. Such a language...
Database programming in Machiavelli, a polymorphic language with static type inference (1989)
Atsushi Ohori, Peter Buneman, Val Breazu-tannen
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...