Computer and information sciences topic list of research papers
-
Stochastic Lambek Categorial Grammars
Abstract We present here a stochastic point of vue on Lambek Categorial Grammars which have shown their utility in Natural Language Processing. The key point comes from the fact that the parsing in the Lambek Calculus is based on an essentially...
2005 / Guillaume Bonfante, Philippe de Groote -
Type Two Theory of Effectivity and Real PCF
Abstract There have been many suggestions for what should be a computable real number or function. Some of these exhibited pathological properties [16]. Presently, research concentrates on domain theoretic approaches [4, 9] based on an idea of Scott ...
2005 / Holger Schulz -
Incompleteness of Behavioral Logics
Abstract Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not recursively enumerable, which means that there are no...
2005 / Samuel Buss, Grigore Roşu -
Preface
Abstract This volume contains the Proceedings of the REFINE 2002 workshop. The Workshop was held in Copenhagen, Denmark on July 20 and 21, 2002, as a satellite event to FLoC'02 as an FME-affiliated workshop. Refinement is one of...
2005 / John Derrick, Eerke Boiten, Jim Woodcock, Joakim von Wright -
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Abstract Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We give a new presentation and a new algorithmic proof of these...
2004 / Thierry Cachat -
An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems
Abstract A formal approach for the specification and analysis of concurrent systems is proposed which integrates two different orthogonal aspects of time: (i) real-time, concerning the expression of time constraints and the verification of exact...
2004 / Mario Bravetti -
State-based Components Made Generic
Abstract Genericity is a topic which is not sufficiently developed in state-based systems modelling, mainly due to a myriad of approaches and behaviour models which lack unification. This paper adopts coalgebra theory to...
2004 / L.S. Barbosa, J.N. Oliveira -
Failure and Equality in Functional Logic Programming1 1Work partially supported by the Spanish project TIC2002-01167 ‘MELODIAS’
Abstract Constructive failure has been proposed recently as a programming construct useful for functional logic programming, playing a role similar to that of constructive negation in logic programming. On the other hand, almost any functional logic ...
2004 / F.J. López-Fraguas, J. Sánchez-Hernández -
“Honeycomb” vs Square and Cubic Models
Abstract In this paper we summarize some observations about the advantages of using hexagonal grids in raster graphics. We initiate a study of honeycomb graphics, whose 2D version is based on a hexagonal grid, while in its 3D counterpart the voxels...
2004 / Valentin E. Brimkov, Reneta P. Barneva -
A Superposition Operator for the Refinement of Algebraic Models
Abstract The development of computer languages or software artefacts from basic concepts to the final product is usually a process starting with an abstract model of a key concept and extending this by adding more detailed functionality for extended ...
2005 / Claus Pahl -
Remarks on Isomorphisms of Simple Inductive Types
Abstract We study isomorphisms of types in the system of simply-typed λ-calculus with inductive types and recursion operators. It is shown that in some cases (multiproducts, copies of types), it is possible to add new reductions in such a way that...
2004 / David Chemouil, Sergei Soloviev -
Three approaches to partiality in the sketch data model1 1Research partially supported by the Australian Research Council and NSERC Canada.
Abstract Partial information is common in real-world databases. Yet the theoretical foundations of data models are not designed to support references to missing data (often termed nulls). Instead, we usually analyse a clean data model based on...
2004 / Michael Johnson, Robert Rosebrugh -
Fixed Points in Metric Semantics
Abstract We present a brief tutorial on the use of metric spaces in semantics, with special attention for the role of fixed points. In traditional semantic modelling, one is primarily interested in the I/O behaviour of a program....
2005 / J.W. de Bakker -
Chapter 102005 /
-
VOTE
Abstract We present an initial version of a tool VOTE 1 for detecting copies inconsistency in group editors. As input, our tool takes an algorithmic-description which consists of...
2004 / Abdessamad Imine, Pascal Molli, Gérald Oster, Pascal Urso -
Specifying Real-Time Finite-State Systems in Linear Logic (Extended Abstract)
Abstract Abstract Real-time finite-state systems may be specified in linear logic by means of linear implications between conjunctions of fixed finite length. In this setting, where time is treated as a dense linear ordering,...
2005 / Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov -
Combinator Parsers: From Toys to Tools
Abstract We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the ...
2005 / S.D. Swierstra -
Typed Closure Conversion for Recursively-Defined Functions
Abstract Much recent work on the compilation of statically typed languages such as ML relies on the propagation of type information from source to object code in order to increase the reliability and maintainabilty of the compiler itself and to...
2005 / Greg Morrisett, Robert Harper -
Interlinking Documents based on Semantic Graphs
Abstract Connectivity and relatedness of Web resources are two concepts that define to what extent different parts are connected or related to one another. Measuring connectivity and relatedness between Web resources is a growing field of research,...
2013 / Bernardo Pereira Nunes, Ricardo Kawase, Besnik Fetahu, Stefan Dietze, Marco A. Casanova, et al. -
Coinductive Counting
Abstract The recently developed coinductive calculus of streams finds here a further application in enumerative combinatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: (1) the objects to ...
2004 / J.J.M.M. Rutten