Sciweavers

5415 search results - page 251 / 1083
» The Implementation of Functional Programming Languages
Sort
View
CC
2006
Springer
118views System Software» more  CC 2006»
15 years 5 months ago
Lightweight Lexical Closures for Legitimate Execution Stack Access
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa
POPL
2007
ACM
16 years 1 months ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
ESOP
2010
Springer
15 years 8 months ago
Amortized Resource Analysis with Polynomial Potential
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
Jan Hoffmann 0002, Martin Hofmann
FSTTCS
2007
Springer
15 years 7 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
POPL
2007
ACM
16 years 1 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...