Sciweavers

4835 search results - page 53 / 967
» Refactoring Functional Programs
Sort
View
ICALP
2004
Springer
14 years 3 months ago
The Complexity of Partition Functions
Andrei A. Bulatov, Martin Grohe
GECCO
2005
Springer
14 years 3 months ago
Function choice, resiliency and growth in genetic programming
In this paper we examine how the choice of functions in a genetic program (GP) affects the rate of code growth and the development of resilient individuals. We find that functio...
Sireesha Besetti, Terence Soule
PPDP
2009
Springer
14 years 4 months ago
Model-checking higher-order functions
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
Naoki Kobayashi
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 3 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
ASWEC
2004
IEEE
14 years 1 months ago
Obstacles to a Totally Functional Programming Style
"Totally Functional Programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practi...
Paul A. Bailes, Colin J. M. Kemp