Sciweavers

41 search results - page 1 / 9
» On the Modularity of Deciding Call-by-Need
Sort
View
FOSSACS
2001
Springer
13 years 9 months ago
On the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
Irène Durand, Aart Middeldorp
ICFP
2009
ACM
14 years 5 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
JSC
2010
135views more  JSC 2010»
13 years 3 months ago
Deciding inseparability and conservative extensions in the description logic EL
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
Carsten Lutz, Frank Wolter
AAAI
2008
13 years 7 months ago
On the Decidability of Role Mappings between Modular Ontologies
Many semantic web applications require support for mappings between roles (or properties) defined in multiple independently developed ontology modules. Distributed Description Log...
Jie Bao, George Voutsadakis, Giora Slutzki, Vasant...
IROS
2008
IEEE
137views Robotics» more  IROS 2008»
13 years 11 months ago
Mechanical design of odin, an extendable heterogeneous deformable modular robot
— Highly sophisticated animals consist of a set of heterogenous modules decided by nature so that they can survive in a complex environment. In this paper we present a new modula...
Andreas Lyder, Ricardo Franco Mendoza Garcia, Kasp...