17298 search results - page 157 / 3460 » Abstract computing machines |
179
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Writing an optimizing back end is expensive, in part because it requires mastery of both a target machine and a compiler's internals. We separate these concerns by i...
283
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
166
click to vote
OOPSLA
2010
Springer
2010
Springer
Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?
15 years 4 months ago
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
156
click to vote
IFL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
144
click to vote
ICDT
2007
ACM
16 years 15 days ago
2007
ACM
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...