Sciweavers

1055 search results - page 100 / 211
» Enumerations in computable structure theory
Sort
View
SAC
2010
ACM
15 years 6 months ago
A heterogeneous approach to service-oriented systems specification
Service-oriented architecture (SOA) is a relatively new approach to software system development. It divides system functionality to independent, loosely coupled, interoperable ser...
Alexander Knapp, Grzegorz Marczynski, Martin Wirsi...
NDJFL
2010
14 years 11 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
TLCA
2009
Springer
15 years 11 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
IFIP
2004
Springer
15 years 9 months ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
SEAAI
1998
Springer
15 years 8 months ago
On theoretical backgrounds of CAD
Abstract. In the past, some information technologies (IT) have quickly been adopted by the engineering practice while the implementation of others has been slower. In the paper, th...
Ziga Turk