Sciweavers

4767 search results - page 524 / 954
» Structures for Abstract Rewriting
Sort
View
CADE
2006
Springer
16 years 7 months ago
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Abstract. The inverse method is a generalization of resolution that can be applied to non-classical logics. We have recently shown how Andreoli's focusing strategy can be adap...
Kaustuv Chaudhuri, Frank Pfenning, Greg Price
ICFP
2005
ACM
16 years 6 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones
ICFP
2003
ACM
16 years 6 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
ALT
2006
Springer
16 years 3 months ago
Towards a Better Understanding of Incremental Learning
Abstract. The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requi...
Sanjay Jain, Steffen Lange, Sandra Zilles
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
16 years 3 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...