2607 search results - page 141 / 522 » Complete Functional Synthesis |
115
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
123
Voted
VTS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we identify two main bottlenecks in the functional diagnosis flow and propose new ways to overcome these. Our approach completely eliminates the “Primary Input (P...
128
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
181
click to vote
ALP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
132
Voted
WSC
2008
15 years 6 months ago
2008
This paper presents an exact approach of calculating float for each activity in linear schedules. It is based on singularity functions, which have been used previously to determin...