Results 11 
19 of
19
ObjectBased Groupware: Theory, Design and Implementation Issues (Extended Absract)
"... Document management software systems are having a wide audience at present. However, groupware as a term has a wide variety of possible definitions. Groupware classification attempt is made in this paper. Possible approaches to groupware are considered including document management, document control ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Document management software systems are having a wide audience at present. However, groupware as a term has a wide variety of possible definitions. Groupware classification attempt is made in this paper. Possible approaches to groupware are considered including document management, document control and mailing systems. Lattice theory and concept modelling are presented as a theoretical background for the systems in question. Current technologies in stateoftheart document managenent software are discussed. Design and implementation aspects for userfriendly integrate enterprise systems are described. Results for a real system to be implemented are given. Perspectives of the field in question are discussed.
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation ∗
"... This paper reviews and extends previous work on the domaintheoretic notion of Machine Development. It summarizes the concept of Developmental Computation and shows how Interactive Computation can be understood as a stepping stone in the pathway from Classical to Developmental Computation. A critica ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper reviews and extends previous work on the domaintheoretic notion of Machine Development. It summarizes the concept of Developmental Computation and shows how Interactive Computation can be understood as a stepping stone in the pathway from Classical to Developmental Computation. A critical appraisal is given of Classical Computation, showing in which ways its shortcomings tend to restrict the possible evolution of real computers, and how Interactive and Developmental Computation overcome such shortcomings. A formal conceptual framework is sketched, in order to frame the future development of the formal theory of Developmental Computation. Finally, the current frontier of the work on Developmental Computation is briefly exposed. 1
Analyse Statique Comportementale des Langages de Programmation.
"... ogy (MIT), le Professeur David K. Gifford, mon colocataire de bureau transatlantique Mark A. Sheldon, Jim O'Toole, Franklyn Turbak, Michael "Ziggy" Blair, John Lucassen et Brian Reistad. ffl Au Laboratoire de Recherche en Informatique (LRI) de Paris XI, les Professeurs JeanPierre Jouannaud qui m' ..."
Abstract
 Add to MetaCart
ogy (MIT), le Professeur David K. Gifford, mon colocataire de bureau transatlantique Mark A. Sheldon, Jim O'Toole, Franklyn Turbak, Michael "Ziggy" Blair, John Lucassen et Brian Reistad. ffl Au Laboratoire de Recherche en Informatique (LRI) de Paris XI, les Professeurs JeanPierre Jouannaud qui m'a invit'e `a pr'esenter ma th`ese d'habilitation `a Paris XI et JeanPierre Sansonnet. ffl Au Centre de Recherche Bull, mon coauteur "industriel" Babak Dehbonei, G'erard Memmi et Nadia Tawbi. ffl A l'Etablissement Technique Central de l'Armement (ETCA), Serge Petiton et Philippe Clermont, maintenant `a HyParTech. ffl Au Programme de Recherches Coordonn'ees C3, Patrice Quinton, pour son financement. ffl A la Direction Recherche Et Technique (DRET), Philippe Sarrazin. De plus, Fran¸cois Irigoin, Corinne Ancourt, Philippe Bazet, Fran¸cois Masdupuy, et Babak Dehbonei ont particip'e `a la relecture de ce manuscr
A Lattice Model for Data Display
 Proceedings Visualization '94
, 1994
"... We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce displays D(u) that effectively communicate the information content of data objects u U, we seek to define conditions on D to e ..."
Abstract
 Add to MetaCart
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce displays D(u) that effectively communicate the information content of data objects u U, we seek to define conditions on D to ensure that it does. For example, we may require that D be injective (i.e., onetoone), so that no two data objects have the same display. However, this is clearly not enough. If we let U and V both be the set of images of 512 by 512 pixels with 24 bits of color per pixel, then any permutation of U can be interpreted as an injective function D from U to V. But an arbitrary permutation of images will not effectively communicate information. Thus we need to define stronger conditions on the function D. Our investigation depends on some complex mathematics, although we will only present the conclusions in this paper. The details are available in [7].
A NEW DEFINITION OF MORPHISM ON PETRI NETS A Preliminary Version ~J\A\^ ^ S cf by
"... Petri nets are a fundamental model of concurrent processes and have a wide range of applications. They can be viewed as generalisation of transition systems in which concurrency is not simulated by nondeterministic interleaving. They were invented by C. A. Petri in the 60's. (A reference work is [Br ..."
Abstract
 Add to MetaCart
Petri nets are a fundamental model of concurrent processes and have a wide range of applications. They can be viewed as generalisation of transition systems in which concurrency is not simulated by nondeterministic interleaving. They were invented by C. A. Petri in the 60's. (A reference work is [Br].) It can be argued that the main effort and success of Petri Net Theory has been in developing techniques
MOTIVATION AND BACKGROUND
, 904
"... Abstract. The main observable quantities in Quantum Field Theory, correlation functions, are expressed by the celebrated Feynman path integrals which are not well defined mathematical objects. Perturbation formalism interprets such an integral as a formal series of finite– dimensional but divergent ..."
Abstract
 Add to MetaCart
Abstract. The main observable quantities in Quantum Field Theory, correlation functions, are expressed by the celebrated Feynman path integrals which are not well defined mathematical objects. Perturbation formalism interprets such an integral as a formal series of finite– dimensional but divergent integrals, indexed by Feynman graphs, the list of which is determined by the Lagrangian of the theory. Renormalization is a prescription that allows one to systematically “subtract infinities ” from these divergent terms producing an asymptotic series for quantum correlation functions. On the other hand, graphs treated as “flowcharts”, also form a combinatorial skeleton of the abstract computation theory and various operadic formalisms in abstract algebra. In this role of descriptions of various (classes of) computable functions, such as recursive functions, functions computable by a Turing machine with oracles etc., graphs can be used to replace standard formalisms having linguistic flavor, such as Church’s λ–calculus and various programming languages. The functions in question are generally not everywhere defined due to potentially infinite loops and/or necessity to search in an infinite haystack for a needle which is not there. In this paper I argue that such infinities in classical computation theory can be addressed in the same way as Feynman divergences, and that meaningful versions of renormalization in this context can be devised. Connections with quantum computation are also touched upon.
Algebraic Synchronization Trees and Processes
 INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2012), ROYAUMEUNI
, 2012
"... We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those ..."
Abstract
 Add to MetaCart
We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.
Algebraic Synchronization Trees and Processes ⋆ Draft dated April 26, 2012
"... Abstract. We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based ..."
Abstract
 Add to MetaCart
Abstract. We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in Caucal’s pushdown hierarchy. 1