Sciweavers

632 search results - page 69 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ML
2008
ACM
13 years 7 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
APLAS
2008
ACM
13 years 9 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae
SOCO
2005
Springer
14 years 1 months ago
Stateful Aspects in JAsCo
Aspects that trigger on a sequence of join points instead of on a single join point are not explicitly supported in current AspectOriented approaches. Explicit protocols are howeve...
Wim Vanderperren, Davy Suvée, María ...
FOSSACS
2003
Springer
14 years 26 days ago
A Monadic Multi-stage Metalanguage
We describe a metalanguage MMML, which makes explicit the order of evaluation (in the spirit of monadic metalanguages) and the staging of computations (as in languages for multi-l...
Eugenio Moggi, Sonia Fagorzi
ASPLOS
1991
ACM
13 years 11 months ago
Code Generation for Streaming: An Access/Execute Mechanism
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
Manuel E. Benitez, Jack W. Davidson