4340 search results - page 365 / 868 » Formal Methods and Cryptography |
178
click to vote
AFP
1995
Springer
15 years 10 months ago
1995
Springer
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
169
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
145
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
158
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
181
click to vote
TYPES
2000
Springer
15 years 10 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...