Sciweavers

14 search results - page 2 / 3
» Revised Report on the Algorithmic Language Scheme
Sort
View
ICFP
1997
ACM
13 years 9 months ago
The Effectiveness of Flow Analysis for Inlining
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
J. Michael Ashley
ICFP
2008
ACM
14 years 6 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
ICFP
2007
ACM
14 years 6 months ago
Implicit phasing for R6RS libraries
The forthcoming Revised6 Report on Scheme differs from previous reports in that the language it describes is structured as a set of libraries. It also provides a syntax for defini...
Abdulaziz Ghuloum, R. Kent Dybvig
CP
2005
Springer
13 years 11 months ago
Bounds of Graph Characteristics
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
JUCS
2010
142views more  JUCS 2010»
13 years 4 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima