5255 search results - page 475 / 1051 » Formal Methods for Privacy |
183
click to vote
IFL
1997
Springer
15 years 11 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
182
click to vote
FTRTFT
1994
Springer
15 years 11 months ago
1994
Springer
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
190
click to vote
IMPERIAL
1993
15 years 11 months ago
1993
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
179
click to vote
SAS
1993
Springer
15 years 11 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
201
click to vote
SAS
1993
Springer
15 years 11 months ago
1993
Springer
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...