891 search results - page 3 / 179 » Full Abstraction for PCF |
APAL
2004
13 years 7 months ago
2004
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
APAL
2002
13 years 7 months ago
2002
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
MSCS
2006
13 years 7 months ago
2006
We show that the extensional ordering of the sequential functionals of pure type 3, e.g. as defined via game semantics [2, 4], is not cpo-enriched. ws that this model does not equ...
IFM
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
ACIVS
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...