2333 search results - page 104 / 467 » Recursive Computational Depth |
115
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
85
Voted
RT
2000
Springer
15 years 6 months ago
2000
Springer
This paper reviews recent psychophysical methods that have been developed for measuring the perceived shape of objects. We discuss two types of shape ambiguities that exist for man...
99
Voted
ACL
1989
15 years 3 months ago
1989
the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The a...
111
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
115
Voted
CSL
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...