Results 1  10
of
24
From Structured Documents to Novel Query Facilities
, 1994
"... Structured documents (e.g., SGML) can benefit a lot from database support and more specifically from objectoriented database (OODB) management systems. This paper describes a natural mapping from SGML documents into OODB's and a formal extension of two OODB query languages (one SQLlike and th ..."
Abstract

Cited by 227 (34 self)
 Add to MetaCart
Structured documents (e.g., SGML) can benefit a lot from database support and more specifically from objectoriented database (OODB) management systems. This paper describes a natural mapping from SGML documents into OODB's and a formal extension of two OODB query languages (one SQLlike and the other calculus) in order to deal with SGML document retrieval. Although motivated by structured documents, the extensions of query languages that we present are general and useful for a variety of other OODB applications. A key element is the introduction of paths as first class citizens. The new features allow to query data (and to some extent schema) without exact knowledge of the schema in a simple and homogeneous fashion. 1 Introduction Structured documents are central to a wide class of applications such as software engineering, libraries, technical documentation, etc. They are often stored in file systems and document access tools are somewhat limited. We believe that (objectoriented) d...
The Discrete Time ToolBus  a software coordination architecture
, 1998
"... . The notion of "time" plays an important role when coordinating ..."
Abstract

Cited by 57 (13 self)
 Add to MetaCart
. The notion of "time" plays an important role when coordinating
An Axiomatics for Categories of Coalgebras
, 1998
"... We give an axiomatic account of what structure on a category C and an endofunctor H on C yield similar structure on the category H0Coalg of Hcoalgebras. We give conditions under which completeness, cocompleteness, symmetric monoidal closed structure, local presentability, and subobject classifiers ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
We give an axiomatic account of what structure on a category C and an endofunctor H on C yield similar structure on the category H0Coalg of Hcoalgebras. We give conditions under which completeness, cocompleteness, symmetric monoidal closed structure, local presentability, and subobject classifiers lift. Our proof of the latter uses a general result about the existence of a subobject classifier in a category containing a small dense subcategory. Our leading example has C = Set with H the endofunctor for which a coalgebra is a finitely branching (labelled) transition system. We explain that example in detail. 1 Introduction Given an endofunctor H on the category Set, an Hcoalgebra is a set X together with a function x : X 0! HX. A leading example of such an H is given by the functor P ! that takes a set X to the set of finite subsets of X , with the behaviour of H on maps given by direct image. An Hcoalgebra is then a finitely branching transition system. A variant, is given by sta...
Interaction as a Framework for Modeling
"... The irreducibility of interactive to algorithmic computing requires fundamental questions concerning models of computation to be reexamined. This paper reviews singlestream and multiplestream interaction machines, extensions of set theory and algebra for models of sequential interaction, and int ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
The irreducibility of interactive to algorithmic computing requires fundamental questions concerning models of computation to be reexamined. This paper reviews singlestream and multiplestream interaction machines, extensions of set theory and algebra for models of sequential interaction, and interactive extensions of the Turing test. It motivates the use of interactive models as a basis for applications to computer architecture, software engineering, and artificial intelligence.
Mathematical Models of Interactive Computing
, 1999
"... : Finite computing agents that interact with an environment are shown to be more expressive than Turing machines according to a notion of expressiveness that measures problemsolving ability and is specified by observation equivalence. Sequential interactive models of objects, agents, and embedded s ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
: Finite computing agents that interact with an environment are shown to be more expressive than Turing machines according to a notion of expressiveness that measures problemsolving ability and is specified by observation equivalence. Sequential interactive models of objects, agents, and embedded systems are shown to be more expressive than algorithms. Multiagent (distributed) models of coordination, collaboration, and true concurrency are shown to be more expressive than sequential models. The technology shift from algorithms to interaction is expressed by a mathematical paradigm shift that extends inductive definition and reasoning methods for finite agents to coinductive methods of set theory and algebra. An introduction to models of interactive computing is followed by an account of mathematical models of sequential interaction in terms of coinductive methods of nonwellfounded set theory, coalgebras, and bisimulation. Models of distributed information flow and multiagent inter...
Semantic Verification of Web Sites Using Natural Semantics
 PROCEEDINGS OF THE 6TH RIAO CONFERENCE  CONTENTBASED MULTIMEDIA INFORMATION ACCESS
, 2000
"... The huge amount of information and knowledge available on the Web leads to the fact that it is more and more difficult to manage this information. Two different ways are commonly explored: giving a syntactical structure to Web sites, and annotating their content to facilitate Web mining. In this pap ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The huge amount of information and knowledge available on the Web leads to the fact that it is more and more difficult to manage this information. Two different ways are commonly explored: giving a syntactical structure to Web sites, and annotating their content to facilitate Web mining. In this paper we explore a different approach inherited from software engineering: specifying the semantics of Web sites, allowing semantic verifications that will help both the conception and the maintenance of Web sites. To achieve this goal, we have experimented with the application of Natural Semantics (traditionally used to specify the semantics of programming languages) to Web sites specification and verification.
Distributivity for a Monad and a Comonad
"... We give a systematic treatment of distributivity for a monad and a comonad as arises in incorporating category theoretic accounts of operational and denotational semantics, and in giving an intensional denotational semantics. We do this axiomatically, in terms of a monad and a comonad in a 2categor ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We give a systematic treatment of distributivity for a monad and a comonad as arises in incorporating category theoretic accounts of operational and denotational semantics, and in giving an intensional denotational semantics. We do this axiomatically, in terms of a monad and a comonad in a 2category, giving accounts of the EilenbergMoore and Kleisli constructions. We analyse the eight possible relationships, deducing that two pairs are isomorphic, but that the other pairs are all distinct. We develop those 2categorical definitions necessary to support this analysis. 1 Introduction In recent years, there has been an ongoing attempt to incorporate operational semantics into a category theoretic treatment of denotational semantics. The denotational semantics is given by starting with a signature 6 for a language without variable binding, and considering the category 6Alg of 6algebras [4]. The programs of the language form the initial 6algebra. For operational semantics, one starts ...
A Document Architecture for Integrated Software Development
, 1994
"... The software development process generates a wide variety of artifacts. Supporting the management and editing of these artifacts in a single, tightlyintegrated development environment is a widely shared goal. To support a software object means not only managing its evolution, representation and sto ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The software development process generates a wide variety of artifacts. Supporting the management and editing of these artifacts in a single, tightlyintegrated development environment is a widely shared goal. To support a software object means not only managing its evolution, representation and storage, but also its display and user interaction. To integrate support for the representation, display, and editing of all the objects in the development process, we regard objects as documents  structured compositions of primitive types. We present a document model for software development that accommodates textual documents in natural and formal languages, multimedia documents, and the results of programmatic analysis. We also present an architecture that supports presentation and editing of these documents, in such a way that the services for each primitive type are reusable in all classes of documents. This document architecture is implemented in a working prototype system, Ensemble. Our experiences with Ensemble provide solutions to some of the key architectural problems in integrated environments.
Dialgebraic Specification and Modeling
"... corecursive functions COALGEBRA state model constructors destructors data model recursive functions reachable hidden abstraction observable hidden restriction congruences invariants visible abstraction ALGEBRA visible restriction!e Swinging Cube ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
corecursive functions COALGEBRA state model constructors destructors data model recursive functions reachable hidden abstraction observable hidden restriction congruences invariants visible abstraction ALGEBRA visible restriction!e Swinging Cube