Sciweavers

4757 search results - page 48 / 952
» Monads for Functional Programming
Sort
View
GECCO
2005
Springer
14 years 1 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 2 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 26 days 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
13 years 11 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
DATE
2004
IEEE
174views Hardware» more  DATE 2004»
13 years 11 months ago
Graph-Based Functional Test Program Generation for Pipelined Processors
Functional verification is widely acknowledged as a major bottleneck in microprocessor design. While early work on specification driven functional test program generation has prop...
Prabhat Mishra, Nikil Dutt