MFCS
1995
Springer
13 years 11 months ago
1995
Springer
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement aris...
HOA
1995
13 years 11 months ago
1995
L.J. Steggles
HOA
1995
13 years 11 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
GI
1995
Springer
13 years 11 months ago
1995
Springer
In the past decade, the programming languages C++, FORTRAN 90 and Oberon-2 allevolved from their ancestors. This invites to reflect upon the suitability ofthese modern programming...
GI
1995
Springer
13 years 11 months ago
1995
Springer
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...