Sciweavers

32 search results - page 3 / 7
» Recursion Schemes and Logical Reflection
Sort
View
123
Voted
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 2 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
131
Voted
PLDI
2011
ACM
14 years 4 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
124
Voted
ESOP
2008
Springer
15 years 2 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
115
Voted
IJCAI
1993
15 years 2 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
108
Voted
ICFP
2008
ACM
16 years 1 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume