Sciweavers

18 search results - page 3 / 4
» The size-change principle for program termination
Sort
View
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
13 years 11 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
SCP
2011
255views Communications» more  SCP 2011»
13 years 22 days ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 9 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
APLAS
2007
ACM
13 years 9 months ago
Mixed Inductive/Coinductive Types and Strong Normalization
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Andreas Abel
COMPSAC
2000
IEEE
13 years 10 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang