Sciweavers

183 search results - page 18 / 37
» Logic Programs with Multiple Chances
Sort
View
ICFP
2010
ACM
13 years 8 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
ECOOP
2000
Springer
13 years 12 months ago
Towards a Unified Programming Language
The goal of research in programming languages should be to develop languages that integrates the best of concepts and constructs from the various programming paradigms. We do not a...
Ole Lehrmann Madsen
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
13 years 8 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 9 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
ESOP
2010
Springer
14 years 4 months ago
Precise and Automated Contract-based Reasoning for Verification and Certification of Information Flow Properties of Programs wit
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
Torben Amtoft, John Hatcliff and Edwin Rodríguez