Find:
Searching for wrapl.
Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
2 documents found. Order: number of citations.

Deriving Tidy Drawings of Trees - Gibbons (1995)   (Correct)   (1 citation)
In this paper, all lists are non-empty. We write `wrapl 'for the function taking a to #a# and write
# h #b# h #c# If h is to#promotable and h wrapl =f ,then we write h as lh #f, lh 'stands
then h lh #f, lh #h f, Since lh #wrapl, id ,this gives us a vehicle for proving the

www.cs.auckland.ac.nz/CDMTCS//researchreports/003drawing.pdf

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC