Research Repository

See what's under the surface


Three dimensional visualization of the World Wide Web (1999)
Journal Article
Benford, S., Taylor, I., Brailsford, D. F., Koleva, B., Craven, M. P., Fraser, M., …Greenhalgh, C. (1999). Three dimensional visualization of the World Wide Web. ACM Computing Surveys, 31(4es),

Although large-scale public hypermedia structures such as the World Wide Web are popularly referred to as "cyberspace", the extent to which they constitute a space in the everyday sense of the word is questionable. This paper reviews recent work in t... Read More

Separable Hyperstructure and Delayed Link Binding (1999)
Journal Article
Brailsford, D. F. (1999). Separable Hyperstructure and Delayed Link Binding. ACM Computing Surveys, 31(4es),

As the amount of material on the World Wide Web continues to grow, users are discovering that the Web's embedded, hard-coded, links are difficult to maintain and update. Hyperlinks need a degree of abstraction in the way they are specified together w... Read More

A Tutorial on the Universality and Expressiveness of Fold (1999)
Journal Article
Hutton, G. (1999). A Tutorial on the Universality and Expressiveness of Fold. Journal of Functional Programming, 9(4),

In functional programming, fold is a standard operator that encapsulates a simple pattern of recursion for processing lists. This article is a tutorial on two key aspects of the fold operator for lists. First of all, we emphasize the use of the uni... Read More

Using a Generalisation Critic to find Bisimulations for Coinductive Proofs (1999)
Conference Proceeding
Dennis, L. A., Bundy, A., & Green, I. (1999). Using a Generalisation Critic to find Bisimulations for Coinductive Proofs. In W. McCune (Ed.),

Coinduction is a method of growing importance in reasoning about functional languages, due to the increasing prominence of lazy data structures. Through the use of bisimulations and proofs that bisimilarity is a congruence in various domains it can... Read More

Proof methods for structured corecursive programs (1999)
Conference Proceeding
Gibbons, J., & Hutton, G. (1999). Proof methods for structured corecursive programs

Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, which consume values of least fixpoint types. There are a number of widely used methods for proving properties of corecursive programs, including fixp... Read More