{"version":"1.0","type":"rich","description":"\u9806\u5e8f\u4ed8\u304d2\u5206\u6728\u3067\u8868\u73fe\u3055\u308c\u305f\u96c6\u5408\u3092\u5bfe\u8c61\u306b\u3001\u306eunion-set\u3068intersection-set\u3092\u5b9a\u7fa9\u3057\u308d\u3063\u3066\u554f\u984c\u3067\u3059\u3051\u3069\u30012-61\u30012-63\u30012-64\u3092\u7d44\u307f\u5408\u308f\u305b\u308b\u3068\u304b\u306a\u308a\u5c0f\u3055\u304f\u3067\u304d\u308b\u4e88\u611f\u3002tree->list-2\u304c\u3067\u3042\u308b\u304b\u3069\u3046\u304b\u3068\u304b\u306e\u53b3\u5bc6\u306a\u89e3\u6790\u306f\u3057\u3066\u306a\u3044\u3067\u3059\u3051\u3069\u3075\u3044\u3093\u304d\uff08\u306a\u305c\u304b\u5909\u63db\u3067\u304d\u306a\u3044\uff09\u3067\u3002 union\u3002 (define (union-ordered-list list1 list2) (cond ((null? list1) list2) ((null? list2) list1) (else (let ((x1 (car list1)) (x2 (car list2))) (cond\u2026","title":"\u554f\u984c2-65 (2.3.3  Example: Representing Sets) ","blog_url":"https://kiririmode.hatenablog.jp/","image_url":null,"published":"2007-12-31 00:00:01","provider_url":"https://hatena.blog","url":"https://kiririmode.hatenablog.jp/entry/20071231/p2","height":"190","blog_title":"\u7406\u7cfb\u5b66\u751f\u65e5\u8a18","categories":["SICP"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkiririmode.hatenablog.jp%2Fentry%2F20071231%2Fp2\" title=\"\u554f\u984c2-65 (2.3.3  Example: Representing Sets)  - \u7406\u7cfb\u5b66\u751f\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/kiririmode/","author_name":"kiririmode","width":"100%"}