Sciweavers

632 search results - page 34 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ICFP
1998
ACM
14 years 29 days ago
Recycling Continuations
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be recycled." Once they have served their purpose...
Jonathan Sobel, Daniel P. Friedman
ICFP
2004
ACM
14 years 8 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
ESOP
2006
Springer
14 years 11 days ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost
PPDP
2000
Springer
14 years 8 days ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman
CONCURRENCY
2004
124views more  CONCURRENCY 2004»
13 years 8 months ago
Checking ownership and confinement
Abstract. A number of formal proposals to manage aliasing in Java-like programming languages have been advanced over the last five years. Unfortunately, it is not clear how practic...
Alex Potanin, James Noble, Robert Biddle