Constrained matching is type safe-Reference-Cited by-同舟云学术

Constrained matching is type safe

Published:1998 Issue: Volume: Page:78-96
ISSN:0302-9743
Container-title:Database Programming Languages
language:
Short-container-title:

Author:

Alagić Suad

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-64823-2_6.pdf

Reference30 articles.

1. M. Abadi and Z. Manna, Temporal Logic Programming, Proceedings of Symposium on Logic Programming, IEEE Computer Society Press, pp. 4–16, 1987.

2. M. Abadi and L. Cardelli, On Subtyping and Matching, Proceedings of ECOOP'96, Lecture Notes in Computer Science, Springer-Verlag, Vol. 1098, pp. 145–167, 1996.

3. S. Alagić, A Temporal Constraint System for Object-Oriented Databases, Constraint Databases and Applications, Proceedings of CDB'97 and CP'96 Workshops, Lecture Notes in Computer Science Vol. 1191, pp. 208–218, Springer-Verlag, 1997.

4. S. Alagić, The ODMG Object Model: Does it Make Sense? Proceedings of the OOPSLA '97 Conference, pp. 253–270, ACM, 1997.

5. S. Alagić, M. Alagić, Order-Sorted Model Theory for Temporal Executable Specifications, Theoretical Computer Science 179, pp. 273–299, 1997.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Institutions: integrating objects, XML and databases;Information and Software Technology;2002-03

2. A Model Theory for Generic Schema Management;Database Programming Languages;2002

3. Behavioral Compatibility of Self-Typed Theories;ECOOP 2002 — Object-Oriented Programming;2002

4. Orthogonal to the Java imperative;ECOOP’98 — Object-Oriented Programming;1998