Sciweavers

1631 search results - page 72 / 327
» Observing Functional Logic Computations
Sort
View
CEC
2008
IEEE
14 years 4 months ago
Fitness functions for the unconstrained evolution of digital circuits
— This work is part of a project that aims to develop and operate integrated evolvable hardware systems using unconstrained evolution. Experiments are carried out on an evolvable...
Tüze Kuyucu, Martin Trefzer, Andrew J. Greens...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 11 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 1 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
LFCS
2007
Springer
14 years 4 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
WCFLP
2005
ACM
14 years 3 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal