Sciweavers

136 search results - page 2 / 28
» The Category Theoretic Solution of Recursive Program Schemes
Sort
View
CALCO
2009
Springer
162views Mathematics» more  CALCO 2009»
14 years 28 days ago
Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
Jirí Adámek, Stefan Milius, Jiri Vel...
LREC
2010
207views Education» more  LREC 2010»
13 years 7 months ago
A Recursive Annotation Scheme for Referential Information Status
We provide a robust and detailed annotation scheme for information status, which is easy to use, follows a semantic rather than cognitive motivation, and achieves reasonable inter...
Arndt Riester, David Lorenz, Nina Seemann
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 10 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
PPDP
2009
Springer
14 years 27 days 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
FOCS
1991
IEEE
13 years 10 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein