4757 search results - page 401 / 952 » Monads for Functional Programming |
194
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
159
click to vote
ECOOP
1992
Springer
15 years 11 months ago
1992
Springer
Multiple dispatching provides increased expressive power over single dispatching by guiding method lookup using the values of all arguments instead of only the receiver. However, ...
156
Voted
ECOOP
2006
Springer
15 years 10 months ago
2006
Springer
A variety of application domains are interactive in nature: a primary task involves responding to external actions. In this paper, we introduce explicit programming language suppor...
179
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
158
click to vote
TPDS
1998
15 years 6 months ago
1998
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...