33:41

L19: Closure-Creating Interpreters (P3)

17:11

L3: Textual Reduction (Spring 2022)

17:38

L0: Racket Basics

16:36

CIS352 Spring 2022 Course Intro

24:46

L22: Continuations

29:54

L21: Fixed Points

13:07

P4: Church Encoding

20:12

L20: Church Numerals

11:51

L18: Reduction Strategies

33:55

L17: Lambda Calculus Reductions and Substitution

15:35

L16: Lambda Calculus Introduction

19:03

Project 1: PageRank

30:10

L15: Small Step Semantics of IfArith

19:37

L14: Natural Deduction for IfArith

23:58

L13: Interpreting IfArith

07:26

Plumbing an Espresso Machine to a 5 Gallon Jug

27:16

L12: Folding over Lists

18:13

L11: Practicing Tail Recursion

32:12

L10: Tail Calls and Tail Recursion

23:47

L9: Quasiquoting and Pattern Matching

15:09

Project 1: Tic-Tc-Toe

22:15

Declarative, Demand-Driven Reverse Engineering (BAR 2021)

10:22

L8: Mapping over Lists

22:31

L7: Cons Diagrams and Boxes

25:38

L6: Lambdas

12:03

CIS352 Course Intro and Logistics

19:47

L4: Case Splitting and Lists Intro

21:10

L3: Textual Reduction

14:29

L2: Definitions and the Environment

26:38

L1: Racket Forms and Callsites

27:51

L5: Recursion Over Lists

23:06

(OLD: 2021) L0: Introduction to Racket and Dr. Racket

37:22

Introduction to Continuations

59:28

Church Encoding: Programming in the Lambda Calculus

50:23

Benchmarking Textual Substitution vs. Closure-Creating Interpreters

16:33

Racket Functions over Lists (Coding Exam 1 Practice)

42:46

Stories about Computation: Folds in Functional Programming

06:16

Program Analysis Foundations and Applications (Syracuse U, Fall 2019)

00:25

The Wumbopixel