tag:blogger.com,1999:blog-10770855.post112110895043307366..comments2024-03-28T03:20:57.393-04:00Comments on The Little Calculist: Deriving an Efficient Tree Traversal, Part IIDave Hermanhttp://www.blogger.com/profile/00405190527081772997noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-10770855.post-63788552882467924352022-03-05T05:03:48.578-05:002022-03-05T05:03:48.578-05:00Good Post! Thank you so much for sharing this pret...Good Post! Thank you so much for sharing this pretty post, it was so good to read and useful to improve my knowledge as updated one, keep blogging.<br /><br /><a href="https://www.wikitechy.com/full-form/ibm-full-form" rel="nofollow">ibm full form in india</a> |<br /><a href="https://www.wikitechy.com/full-form/ssb-full-form" rel="nofollow">ssb ka full form</a> |<br /><a href="https://www.wikitechy.com/full-form/dp-full-form" rel="nofollow">what is the full form of dp</a> |<br /><a href="https://www.wikitechy.com/full-form/brics-full-form" rel="nofollow">full form of brics</a> |<br /><a href="https://www.wikitechy.com/full-form/gnm-full-form" rel="nofollow">gnm nursing full form</a> |<br /><a href="https://www.wikitechy.com/full-form/bce-full-form" rel="nofollow">full form of bce</a> |<br /><a href="https://www.wikitechy.com/full-form/php-full-form" rel="nofollow">full form of php</a> |<br /><a href="https://www.wikitechy.com/full-form/bhim-full-form" rel="nofollow">bhim full form</a> |<br /><a href="https://www.wikitechy.com/full-form/nota-full-form" rel="nofollow">nota full form in india</a> |<br /><a href="https://www.wikitechy.com/full-form/apec-full-form" rel="nofollow">apec full form</a> |periyannanhttps://www.blogger.com/profile/06659546616451492142noreply@blogger.comtag:blogger.com,1999:blog-10770855.post-1121192450398356392005-07-12T14:20:00.000-04:002005-07-12T14:20:00.000-04:00A "problem" with the analogy (which I found while ...A "problem" with the analogy (which I found while I was trying to find the derivative of the datatype describing your DOM tree) is that his one-hole contexts may not exactly match up with (y)our evaluation contexts.<BR/><BR/>For example, his (deriv (w.r.t. X) of [Listof X]) yields a [Listof X] times [Listof X]. This is appropriate for Conor's context; the one-hole context for a list-element is a pair of lists (the prefix and the suffix). See page 7. <BR/><BR/>However, the evaluation context when traversing a [Listof X] is not a pair of lists, but instead just (isomorphic to) a [Listof X]; This is because in the traversal, the "suffix" is part of the redex, not the context.<BR/><BR/>Perhaps I am making a mistake in relating these particular two problems. Reducing a whole list is different from looking only at the individual elements (since reduction allows us to combine elements together, rather than looking at them in isolation).pnkfelixhttps://www.blogger.com/profile/04222189622973190255noreply@blogger.comtag:blogger.com,1999:blog-10770855.post-1121145928843174962005-07-12T01:25:00.000-04:002005-07-12T01:25:00.000-04:00Thanks for making the connection. Another paper th...Thanks for making the connection. Another paper that seems related is Huet's <A HREF="http://pauillac.inria.fr/~huet/PUBLIC/DB.pdf" REL="nofollow">Linear Contexts and the Sharing Functor</A> (<A HREF="http://pauillac.inria.fr/~huet/PUBLIC/Automath.ps" REL="nofollow">slides</A>), which is very interesting but so far I haven't understood. Although it's not in general possible to decide when you can replace operations on a functional data structure with destructive updates (as I do in this derivation), I wonder if starting from a simple datatype, a compiler could derive efficient traversals by <I>choosing</I> to implement them linearly. This may be one of the topics in Huet's paper, but I'm not sure.Dave Hermanhttps://www.blogger.com/profile/00405190527081772997noreply@blogger.comtag:blogger.com,1999:blog-10770855.post-1121124596704666122005-07-11T19:29:00.000-04:002005-07-11T19:29:00.000-04:00Going from a traversal over a datatype to the stru...Going from a traversal over a datatype to the structure of the context frames reminds me a lot of Connor McBride's Derivatives of Regular Types.<BR/><BR/>See <A HREF="http://www.cs.nott.ac.uk/~ctm/diff.ps.gz" REL="nofollow">diff.ps.gz</A> by Connor himself, or the later <A HREF="http://lambda-the-ultimate.org/node/view/729" REL="nofollow">work</A> as discussed on LtU.pnkfelixhttps://www.blogger.com/profile/04222189622973190255noreply@blogger.com