ConceptSystems & CS
List
A conventional way of representing a sequence of things as a chain of pairs.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
David J. Malan
A data type that contains multiple values all in the same place and variable, represented by square brackets.Ana Bell
An indexable ordered sequence of objects denoted by square brackets that is mutable.Hal Abelson & Gerald Jay Sussman
Eric Grimson
A data object that can hold an arbitrary number of ordered items, formally defined as a sequence of pairs ending in the empty list.
Lectures that assume it
30The first 12 are shown.
- Metacircular Evaluator, Part 1 (1986)
- Streams, Part 1
- Let's Build GPT: From Scratch, in Code, Spelled Out
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Why Functional Programming Matters: Higher-Order Glue & Lazy Evaluation
- Sorting Algorithms
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Lists and Mutability in Python
- Computational Objects
- Libraries
- Logic Programming, Part 2: MIT 6.001 Structure and Interpretation (1986)
- Python Classes
Connections
44The lectures that define it or assume it, and the concepts next to it.
Lectures35
- Loops
- The Henderson Escher Example: Recursive Graphics
- Henderson Escher Example
- Data Abstraction
- Lambda Functions, Tuples, and Lists in Python
- Metacircular Evaluator, Part 1 (1986)
Show 29 moreShow fewer
- Streams, Part 1
- Let's Build GPT: From Scratch, in Code, Spelled Out
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Why Functional Programming Matters: Higher-Order Glue & Lazy Evaluation
- Sorting Algorithms
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Lists and Mutability in Python
- Computational Objects
- Libraries
- Logic Programming, Part 2: MIT 6.001 Structure and Interpretation (1986)
- Python Classes
- List Comprehension, Functions as Objects, Testing, and Debugging in Python
- Aliasing and Cloning in Python
- Object-Oriented Programming
- Streams, Part 2 (1986)
- Computational Objects
- Conflict Resolution for Eventual Consistency
- Big Oh and Theta Notation for Algorithmic Efficiency
- Naming and Ordering Natural Numbers (Mathematics Foundations 188)
- File I/O
- Plotting
- Recursion on Non-numeric Data Structures
- Category Theory 9.1: Natural Transformations
- Et Cetera
- Search: Depth-First, Hill Climbing, Beam Search
- Python
- Trustworthy Human-AI Collaboration in a Live Type-Theoretic Computational Commons
- Complexity Classes Examples
- List Access, Hashing, Simulations, and Course Wrap-Up