Sciweavers

1194 search results - page 103 / 239
» A Calculus for Predicative Programming
Sort
View
ICFP
2003
ACM
16 years 4 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
LPNMR
2009
Springer
15 years 11 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
FSEN
2007
Springer
15 years 11 months ago
A Model of Component-Based Programming
Abstract. Component-based programming is about how to create application programs from prefabricated components with new software that provides both glue between the components, an...
Xin Chen, Jifeng He, Zhiming Liu, Naijun Zhan
KBSE
2007
IEEE
15 years 11 months ago
The eureka tool for software model checking
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...
Alessandro Armando, Massimo Benerecetti, Dario Car...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 6 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