5377 search results - page 653 / 1076 » Programming Languages For Interactive Computing |
155
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
140
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
160
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
137
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predica...
139
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...