Computer and information sciences topic list of research papers
-
Preface2007 / Ganesh Gopalakrishnan, John O'Leary
-
Expressiveness of Process Algebras
Abstract We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
2008 / Joachim Parrow -
ML Module Mania: A Type-Safe, Separately Compiled, Extensible Interpreter
Abstract To illustrate the utility of a powerful modules language, this paper presents the embedded interpreter Lua-ML. The interpreter combines extensibility and separate compilation without compromising type safety. Its types are extended by...
2006 / Norman Ramsey -
Handling Left-Quadratic Rules When Completing Tree Automata
Abstract This paper addresses the following general problem of tree regular model-checking: decide whether R ∗ ( ...
2008 / Y. Boichut, R. Courbis, P.-C. Héam, O. Kouchnarenko -
An Operational Domain-theoretic Treatment of Recursive Types
Abstract We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we do not produce the recursive types via the usual inverse...
2006 / Weng Kin Ho -
Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions
Abstract Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individual agents. These “mentalistic” approaches are, when...
2006 / Matthias Nickles, Felix Fischer, Gerhard Weiss -
Preface2009 / Nigel Thomas, Jeremy Bradley, William Knottenbelt
-
A Framework for Defining Logical Frameworks
Abstract In this paper, we introduce a General Logical Framework, called GLF, for defining Logical Frameworks, based on dependent types, in the style of the well known Edinburgh Logical Framework LF. The framework GLF features a generalized form of...
2007 / Furio Honsell, Marina Lenisa, Luigi Liquori -
Token-Passing Nets: Call-by-Need for Free
Abstract Recently, encodings in interaction nets of the call-by-name and call-by-value strategies of the λ-calculus have been proposed. The purpose of these encodings was to bridge the gap between interaction nets and traditional abstract machines,...
2006 / François-Régis Sinot -
Connecting Logical Representations and Efficient Computations
Abstract When combining logic level theorem proving with computational methods it is important to identify both functions that can be efficiently computed and the objects they can be applied to. This is generally achieved by mappings of logic level...
2006 / Martin Pollet, Volker Sorge -
Coalgebraising Subsequential Transducers
Abstract Subsequential transducers generalise both classic deterministic automata and Mealy/Moore type state machines by combining (input) language recognition with transduction. In this paper we show that normalisation and taking differentials of...
2008 / Helle Hvid Hansen -
as Authoring Tool for Formal Developments2004 / Philippe Audebaud, Laurence Rideau
-
A Calculus of Global Interaction based on Session Types
Abstract This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. The formalism, called global calculus, aims at representing...
2007 / Marco Carbone, Kohei Honda, Nobuko Yoshida -
ArcAngelC: a Refinement Tactic Language for Circus
Abstract Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement...
2008 / M.V.M. Oliveira, A.L.C. Cavalcanti -
Semantic Determinism and Functional Logic Program Properties
Abstract In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and non-terminating rewrite systems, defining possibly non-deterministic non-strict functions. Therefore, equational reasoning is not valid for...
2007 / José Miguel Cleva, Francisco J. López-Fraguas -
Locality of Corner Transformation for Multidimensional Spatial Access Methods
Abstract The geometric structural complexity of spatial objects does not render an intuitive distance metric on the data space that measures spatial proximity. However, such a metric provides a formal basis for analytical work in...
2008 / H.K. Dai, K.-Y. Whang, H.C. Su -
A Survey of Collaborative Filtering Techniques2009 / Xiaoyuan Su, Taghi M. Khoshgoftaar
-
Adessowiki - Collaborative platform for writing executable papers
Abstract Adessowiki is a collaborative platform for scientific programming and document writing. It is a wiki environment that carries simultaneously documentation, programming code and results of its execution without any software con- figuration...
2011 / Rubens C. Machado, Leticia Rittner, Roberto A. Lotufo -
Extraction of flower regions in color images using ant colony optimization
Abstract Extraction of flower regions from complex background is a difficult task and it is an important part of a flower image retrieval and recognition. In this article, we propose an Ant Colony Optimization (ACO) algorithm as a general color...
2011 / Doğan Aydın, Aybars Uğur -
Internet enabled digital photography2002 / P.M. Corcoran, P. Bigioi, E. Steinberg, Y. Prilutsky