Sciweavers

745 search results - page 61 / 149
» The Functional Side of Logic Programming
Sort
View
POPL
2000
ACM
15 years 8 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
PKDD
2007
Springer
146views Data Mining» more  PKDD 2007»
15 years 10 months ago
A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions
This paper presents a novel method for multi-relational classification via an aggregation-based Inductive Logic Programming (ILP) approach. We extend the classical ILP representati...
Richard Frank, Flavia Moser, Martin Ester
122
Voted
ICFP
2006
ACM
16 years 3 months ago
Design patterns as higher-order datatype-generic programs
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
Jeremy Gibbons
DAC
2003
ACM
16 years 5 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
PPDP
2009
Springer
15 years 10 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reï...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...