Sciweavers

1614 search results - page 178 / 323
» Polymorphism and Genetic Programming
Sort
View
LISP
2008
105views more  LISP 2008»
14 years 10 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
76
Voted
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 3 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
WCRE
2000
IEEE
15 years 2 months ago
Understanding the Behavior of Java Programs
To fully understand the underlying architecture of an object-oriented software system, both static and dynamic analyses are needed. Dynamic reverse engineering techniques are espe...
Tarja Systä
61
Voted
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolution of multi-loop controllers for fixed morphology with a cyclic genetic algorithm
Cyclic genetic algorithms can be used to generate single loop control programs for robots. While successful in generating controllers for individual leg movement, gait generation,...
Gary B. Parker, Ramona Georgescu
ICFP
1999
ACM
15 years 2 months ago
Representing Java Classes in a Typed Intermediate Language
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
Christopher League, Zhong Shao, Valery Trifonov