<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Scheme 2: Basics - pairs and lists</title>
        <link>https://diode.zone/videos/watch/39be7c8b-6bbf-422d-b9b5-6657dae920d5</link>
        <description>Some of the things you will need to understand to be able to write programs in the Scheme programming language, which is a type of Lisp.  Andy Balaam introduces pairs, lists, and navigation through lists using recursive procedures, before discussing the map and foldr procedures, which you will use in most programs.  If you're new to Scheme, it's probably worth watching http://youtu.be/byofGyW2L10 first.  The slides are here: http://www.artificialworlds.net/blog/2012/05/25/scheme-2-basics-pairs-and-lists-video/</description>
        <lastBuildDate>Tue, 20 Oct 2026 14:35:57 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>PeerTube - https://diode.zone</generator>
        <image>
            <title>Scheme 2: Basics - pairs and lists</title>
            <url>https://diode.zone/lazy-static/avatars/61b689b7-84d5-43c7-9fa8-e63a7fd1d952.png</url>
            <link>https://diode.zone/videos/watch/39be7c8b-6bbf-422d-b9b5-6657dae920d5</link>
        </image>
        <copyright>All rights reserved, unless otherwise specified in the terms specified at https://diode.zone/about and potential licenses granted by each content's rightholder.</copyright>
        <atom:link href="https://diode.zone/feeds/video-comments.xml?videoId=39be7c8b-6bbf-422d-b9b5-6657dae920d5" rel="self" type="application/rss+xml"/>
    </channel>
</rss>