5863 search results - page 857 / 1173 » Calculating Functional Programs |
185
click to vote
TLDI
2003
ACM
15 years 12 months ago
2003
ACM
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
213
click to vote
TLDI
2003
ACM
15 years 12 months ago
2003
ACM
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
187
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
187
click to vote
FPCA
1989
15 years 10 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
183
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...