Sciweavers

754 search results - page 79 / 151
» Nested Expressions in Logic Programs
Sort
View
ENTCS
2007
124views more  ENTCS 2007»
13 years 8 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 9 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
ECAI
2004
Springer
14 years 1 months ago
An Argumentative Approach to Assessing Natural Language Usage based on the Web Corpus
Abstract. In spite of the significant evolution of spelling and grammar checkers for word-processing software, the problem of judging the appropriateness of language usage in diff...
Carlos Iván Chesñevar, Ana Gabriela ...
CL
2000
Springer
14 years 9 days ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
PEPM
2004
ACM
14 years 1 months ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...