Sciweavers

5415 search results - page 433 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ESOP
1999
Springer
15 years 11 months ago
Types and Subtypes for Client-Server Interactions
We define an extension of the π-calculus with a static type system which supports high-level specifications of extended patterns of communication, such as client-server protocol...
Simon J. Gay, Malcolm Hole
PLDI
1996
ACM
15 years 11 months ago
Representing Control in the Presence of One-Shot Continuations
Traditional first-class continuation mechanisms allow a captured continuation to be invoked multiple times. Many continuations, however, are invoked only once. This paper introduc...
Carl Bruggeman, Oscar Waddell, R. Kent Dybvig
PLDI
1993
ACM
15 years 11 months ago
Real-Time Replication Garbage Collection
We have implemented the first copying garbage collector that permits continuous unimpeded mutator access to the original objects during copying. The garbage collector incremental...
Scott Nettles, James O'Toole
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
16 years 1 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold