Sciweavers

11909 search results - page 20 / 2382
» The Scheme Programming Language
Sort
View
FOSSACS
2010
Springer
14 years 19 hour ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
LOPSTR
2007
Springer
14 years 2 months ago
Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
Abstract. The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of function...
Sebastian Fischer, Josep Silva, Salvador Tamarit, ...
ECOOP
2008
Springer
13 years 10 months ago
Safe Cross-Language Inheritance
Inheritance is a standard means for reuse and for interfacing with external libraries. In a multi-language software product, extending a class written in a statically-typed languag...
Kathryn E. Gray
ICALP
2007
Springer
14 years 2 months ago
Labeling Schemes for Vertex Connectivity
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Amos Korman
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 3 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...