Sciweavers

441 search results - page 68 / 89
» The logical approach to stack typing
Sort
View
APAL
2008
104views more  APAL 2008»
14 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
PUC
2002
150views more  PUC 2002»
14 years 9 months ago
New Active Tools for Supporting Narrative Structures
: Constructing stories is a type of playing that involves mobilizing the storyteller's imagination and finding original ways to convey narrative intentions. When a child inven...
Françoise Decortis, Antonio Rizzo
FOSSACS
2005
Springer
15 years 3 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
ICPR
2008
IEEE
15 years 10 months ago
Incremental machine learning techniques for document layout understanding
In real-world Digital Libraries, Artificial Intelligence techniques are essential for tackling the automatic document processing task with sufficient flexibility. The great variab...
Floriana Esposito, Marenglen Biba, Stefano Ferilli...
ICFP
2002
ACM
15 years 9 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy