1917 search results - page 99 / 384 » The York Abstract Machine |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
120
click to vote
LICS
2012
IEEE
13 years 2 months ago
2012
IEEE
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
80
Voted
AMAST
2004
Springer
15 years 5 months ago
2004
Springer
This abstract provides some background information about the electronic voting experiment that is planned in the Netherlands for the European Elections of 2004, and about our own i...
100
click to vote
CC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We propose a machine learning approach to action prediction in oneshot games. In contrast to the huge literature on learning in games where an agent's model is deduc...