Sciweavers

145 search results - page 4 / 29
» A compiled implementation of strong reduction
Sort
View
AOSD
2008
ACM
13 years 9 months ago
StrongAspectJ: flexible and safe pointcut/advice bindings
AspectJ was designed as a seamless aspect-oriented extension of the Java programming language. However, unlike Java, AspectJ does not have a safe type system: an accepted binding ...
Bruno De Fraine, Mario Südholt, Viviane Jonck...

Book
296views
15 years 5 months ago
Implementing Functional Languages: a tutorial
"This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. The book is intended to be a source of pr...
Simon Peyton Jones, David Lester
AFP
2004
Springer
14 years 28 days ago
A Functional Shell That Operates on Typed and Compiled Applications
Abstract. Esther is the interactive shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, ...
Rinus Plasmeijer, Arjen van Weelden
IFL
2004
Springer
14 years 27 days ago
Shrinking Reductions in SML.NET
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
Nick Benton, Andrew Kennedy, Sam Lindley, Claudio ...
DATE
2009
IEEE
117views Hardware» more  DATE 2009»
14 years 2 months ago
Using dynamic compilation for continuing execution under reduced memory availability
—This paper explores the use of dynamic compilation for continuing execution even if one or more of the memory banks used by an application become temporarily unavailable (but th...
Ozcan Ozturk, Mahmut T. Kandemir