dbgroup-admin

1994
1993
Breazu-Tannen V, Kesner D, Puel L.  1993.  A Typed Pattern Calculus. Proceedings of 8th IEEE Symposium on Logic in Computer Science. :262-274.
1992
Breazu-Tannen V, Buneman P, Wong L.  1992.  Naturally Embedded Query Languages. LNCS 646: Proceedings of 4th International Conference on Database Theory, Berlin, Germany, October, 1992. :140-154.
1991
Breazu-Tannen V, Coquand T, Gunter CA, Scedrov A.  1991.  Inheritance and explicit coercion. Information and Computation. 93:172-221.
Breazu-Tannen V, Buneman P, Naqvi S.  1991.  Structural Recursion as a Query Language. Proceedings of 3rd International Workshop on Database Programming Languages, Naphlion, Greece. :9-19.
Breazu-Tannen V, Subrahmanyam R.  1991.  Logical and Computational Aspects of Programming with Sets/Bags/Lists. LNCS 510: Proceedings of 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991. :60-75.
1989
Breazu-Tannen V, Buneman P, Ohori A.  1989.  Can Object-Oriented Databases Be Statically Typed? Proceedings of 2nd International Workshop on Database Programming Languages, Gleneden Beach, Oregon. :226-237.
Ohori A, Buneman P, Breazu-Tannen V.  1989.  Database Programming in Machiavelli, a Polymorphic Language with Static Type Inference. Proceedings of ACM-SIGMOD International Conference on Management of Data. :46-57.
Ohori A, Buneman P, Breazu-Tannen V.  1989.  Database Programming in Machiavelli: A Polymorphic Language with Static Type Inference. Proceedings of ACM-SIGMOD International Conference on Management of Data. :46-57.
Breazu-Tannen V, Coquand T, Gunter CA, Scedrov A.  1989.  Inheritance and explicit coercion. Proceedings of 4th IEEE Symposium on Logic in Computer Science. :112-129.
1988
Breazu-Tannen V.  1988.  Combining algebra and higher-order types. Proceedings of 3rd IEEE Symposium on Logic in Computer Science. :82-90.
1987
Breazu-Tannen V, Meyer AR.  1987.  Polymorphism is conservative over simple types. Proceedings of 2nd IEEE Symposium on Logic in Computer Science. :7–17.
Breazu-Tannen V, Meyer AR.  1987.  Computable values can be classical. Proceedings of 14th Symposium on Principles of Programming Languages. :238–245.
Breazu-Tannen V, Coquand T.  1987.  Extensional models for polymorphism. LNCS 250: Proceedings of TAPSOFT - Colloquium on Functional and Logic Programming and Specifications, Pisa, March 1987. :291–307.
1985
Breazu-Tannen V, Meyer AR.  1985.  Lambda calculus with constrained types (Extended abstract). LNCS 193: Proceedings of the Conference on Logics of Programs, Brooklyn, June 1985. :23–40.