1264 search results - page 47 / 253 » Abstract machines for programming language implementation |
POPL
2009
ACM
14 years 9 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
APLAS
2006
ACM
14 years 3 months ago
2006
ACM
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
JAVA
2001
Springer
14 years 1 months ago
2001
Springer
Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a. the ‘Grid’ Computing a reality. Sinc...
WCFLP
2005
ACM
14 years 2 months ago
2005
ACM
There exist several implementations of the functional logic language Curry: a transformation to Prolog and implementations of machines for C and Java. We show that there are many ...
FAC
2010
13 years 7 months ago
2010
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...