Sciweavers

1989 search results - page 160 / 398
» Set functions for functional logic programming
Sort
View
IANDC
2006
102views more  IANDC 2006»
15 years 3 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
15 years 8 months ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 8 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
ECOOP
1995
Springer
15 years 6 months ago
Interface-Based Protocol Specification of Open Systems using PSL
PSL is a framework for describing dynamic and architectural properties of open systems. PSL extends established interface-based tactics for describing the functional properties of...
Doug Lea, Jos Marlowe
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 10 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi