Sciweavers

525 search results - page 90 / 105
» Composing Programs in a Rewriting Logic for Declarative Prog...
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
ICFP
2008
ACM
14 years 7 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg
ICFP
2005
ACM
14 years 7 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
JLP
2007
159views more  JLP 2007»
13 years 7 months ago
Reasoning about interaction protocols for customizing web service selection and composition
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
EUROSSC
2007
Springer
14 years 1 months ago
Capturing Context Requirements
Context-aware applications require context information to adapt their behaviour to the current situation. When developing context-aware applications, application developers need to...
Tom Broens, Dick A. C. Quartel, Marten van Sindere...