This paper generalizes adaptive subdivision algorithms by introducing an applicationdependent Degree of Interest function. Therefore, geometry-related as well as geometry-independ...
We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional in...
We study, from a classical point of view, how the truth of a statement about higher type functionals depends on the underlying model. The models considered are the classical set-t...
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Sc...
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...