2016 search results - page 95 / 404 » Megamaps: Construction and Examples |
110
click to vote
FAC
2000
15 years 4 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
126
click to vote
ENTCS
2002
15 years 4 months ago
2002
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
130
click to vote
ITA
2002
15 years 4 months ago
2002
Abstract. We investigate the density of critical factorizations of infinte sequences of words. The density of critical factorizations of a word is the ratio between the number of p...
171
click to vote
CN
1999
15 years 4 months ago
1999
Recently, the ITU-standardised specification language Message Sequence Chart has been extended with constructs for more complete and structured specifications. The new version of ...
120
click to vote
JAL
1998
15 years 4 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...