Re: breadth-first relabelling in a functional language

Article View: comp.lang.functional

Article #942

Back to comp.lang.functional Previous Next

#942

From: Geraint Jones
Date: Sun, 13 Dec 1992 14:01

18 lines
1413 bytes

A short (four page) paper by Jeremy Gibbons and myself and containing a less
buggy account of linear-time breadth-first searching and labelling than my /
original postings is available (as about 47kb of compressed postscript)   /
from our anonymous ftp server.                                           / g
___

host:     ftp.comlab.ox.ac.uk

file:     Documents/techpapers/Geraint.Jones/PRG-TR-31-92

title:    Linear-time breadth-first tree algorithms
                -- an exercise in the arithmetic of folds and zips

abstract: This is a paper about an application of the mathematics
          of zip, fold (reduce) and accumulate (scan) operations on
          lists.  It gives an account of the derivation of a linear-
	  time breadth-first enumeration function, and of a subtle 
	  and efficient breadth-first tree labelling function.

Technical Details

Message-ID: <1992Dec13.140121.20837@pierrot.comlab.ox.ac.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!comlab.ox.ac.uk!geraint

References: <1992Dec7.202523.8081@cs.yale.edu> <ByvHpv.435@comp.vuw.ac.nz>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!comlab.ox.ac.uk!geraint
From: Geraint.Jones@comlab.oxford.ac.uk (Geraint Jones)
Newsgroups: comp.lang.functional
Subject: Re: breadth-first relabelling in a functional language
Message-ID: <1992Dec13.140121.20837@pierrot.comlab.ox.ac.uk>
Date: 13 Dec 92 14:01:21 GMT
References: <1992Dec7.202523.8081@cs.yale.edu> <ByvHpv.435@comp.vuw.ac.nz>
Sender: geraint@comlab.ox.ac.uk (Geraint Jones)
Organization: The Imperial Aerated Doughnut and Steamship Company Limited
Lines: 18
Originator: geraint@pierrot.comlab

Reply to Parent Message