Sciweavers

367 search results - page 28 / 74
» Adapting functional programs to higher order logic
Sort
View
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
14 years 4 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
PPDP
2007
Springer
14 years 4 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
13 years 10 months ago
Fitness importance for online evolution
To complement standard fitness functions, we propose "Fitness Importance" (FI) as a novel meta-heuristic for online learning systems. We define FI and show how it can be...
Philip Valencia, Raja Jurdak, Peter Lindsay
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 4 months ago
Extensional Collapse Situations I: non-termination and unrecoverable errors
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
Antonio Bucciarelli