author | Alan Dipert
<alan@dipert.org> 2019-12-11 16:17:15 UTC |
committer | Alan Dipert
<alan@dipert.org> 2019-12-11 16:17:15 UTC |
parent | a2723fcedb334675a04c34022e6c22973a128f9d |
posts/when-you-wish-upon-a-tagbody.md | +0 | -22 |
diff --git a/posts/when-you-wish-upon-a-tagbody.md b/posts/when-you-wish-upon-a-tagbody.md deleted file mode 100644 index 60f5a85..0000000 --- a/posts/when-you-wish-upon-a-tagbody.md +++ /dev/null @@ -1,22 +0,0 @@ ---- -date: "2019-11-13" -keywords: ["query", "trees"] -title: "When You Wish Upon a TAGBODY" -id: "urn:uuid:29175a02-069e-11ea-b588-843a4b7c6000" -abstract: | - Something about TAGBODY. ---- - -Blah have some code. - -## Transforming - -A tree can be represented as a table of paths. For example, the following -structures have different affordances but are informationally equivalent: - -~~~{.lisp} -; Tree -(list - (eq people 1) - `(foo ,(+ 1 2))) -~~~