331 search results - page 12 / 67 » HOLCF: Higher Order Logic of Computable Functions |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
BSL
2006
14 years 9 months ago
2006
We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...
80
Voted
AGP
1999
IEEE
15 years 1 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
JELIA
1990
Springer
15 years 1 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...