Skip to main content

Categorial graphs

Extended abstract

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 965))

Included in the following conference series:

Abstract

In this paper we present a denotational semantics for a class of database definition languages. We present a language, called categorial graph language, that combines both graphical and textual phrases and is tailored to define databases. The categorial graph language is modeled after a number of practical languages. Its semantics is based on a variant of linear logic, and incorporates directly the notions expressed in the language. We emphasize on the fact that in the semantics presented here, we directly axiomatize the behavior of complex objects, instead of encoding it with help of the traditional mathematical notions. We will argue that this is desirable regarding clearness of semantics and matters of complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Atkonson, F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier, S. Zdonik, The Object Oriented Database System Manifesto; in: first International Conference on Deductive and Object Oriented Database Systems, Dec. 1989, pp. 40–57.

    Google Scholar 

  2. Serge Abiteboul, Richard Hull, IFO: A Formal Semantic Database Model, In: ACM proc. of Principles of Database Systems (PODS'84), 1984, pp. 119–132.

    Google Scholar 

  3. Serge Abiteboul, Victor Vianu, Computing on Structures, in: Automata, Languages an Programming (ICALP'93), Springer LNCS 700, 1993, pp.606–620.

    Google Scholar 

  4. Anna Bucalo, Modalities in Linear Logic Weaker then the Exponential ”of Course”: Algebraic and Relational Semantics, in: Journal of Logic, Language and information 3, pp. 211–232, 1994.

    Google Scholar 

  5. D. de Champeaux, A comparative study of Object Oriented Analysis Methods, Research Report, HP Laboratories, April 1991.

    Google Scholar 

  6. Dov Gabbay, An irreflexive lemma with applications to axiomatizations of conditions on linear frames, In: U. Mönnich (ed.), Aspects of Philosophical Logic, Reidel, Dordrect, 1981, pp.67–89.

    Google Scholar 

  7. Jean-Yves Girard, Linear Logic, In: Theoretical Computer Science 50 (1987), pp. 10–102.

    Google Scholar 

  8. Marc Gyssens, Jan Parendaens, Dirk van Gucht, A Graph-Oriented Object Model for Database End-User Interfaces, in: H. Garciamolina, H.V. Jagadish (eds.), ACM Int. Conf. on Management of Data (SIGMOD), 1990, pp. 24–33.

    Google Scholar 

  9. Erik de Haas, Categorial graphs: The logical approach, in: Arthur Nieuwendijk (ed.), AC-COLADE'94 proceedings, Dutch Graduate School in Logic, Department of Philosophy, University of Amsterdam, The Netherlands.

    Google Scholar 

  10. M. Kifer, G. Lausen, F-Logic: A higher-order language for reasoning about objects, inheritance and schema, in: Proceedings ACM-SIGMOD int. conf. on Management of Data, June 1989, pp. 134–146.

    Google Scholar 

  11. Gabriel M. Kuper, Moshe Y. Vardi, The Logical Data Model, in: ACM Transactions on Database Systems, Vol. 18, No. 3, September 1993, pp. 379–413.

    Google Scholar 

  12. Michael Kifer, James Wu, A Logic for Programming with Complex Objects, in: Journal of Computer and System Sciences 47, 1993, pp. 77–120.

    Google Scholar 

  13. John C. Mitchell, Type systems for programming languages, in: J. van Leeuwen (ed.), Hand-book of Theoretical Computer Science, Elsevier Science Publ., 1990, pp. 365–458.

    Google Scholar 

  14. Maarten de Rijke, Extending Modal Logic, PhD Thesis, University of Amsterdam, ILLC Dissertation Series 1993–4.

    Google Scholar 

  15. Bill Rounds, Situation Theoretic Aspects of Databases, in: Jon Barwise, Mark Gawron, Gordon Plotkin, Syun Tutiya (eds.), Situation Theory and its Applications, vol. 2, CSLI, 1991, pp. 229–255.

    Google Scholar 

  16. A.S. Troelstra, Lectures on Linear Logic, CSLI lecture notes 29, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Haas, E. (1995). Categorial graphs. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

  • Online ISBN: 978-3-540-44770-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics