kmicinski

#lang racket

;; CIS352 'S26 -- 1/29 through 2/3
;; (There is a lot of material here, we will not cover it all today.)
;; □ -- More practice with lambdas
;; □ -- Mapping
;; □ -- Explaining recursion and why it matters
;; □ -- Our first non-list recursive type: trees
;; □ -- Pattern matching

kmicinski

#lang racket

;; Project 0 Tic-tac-toe with Racket
;; 
;; Please immediately read README.md

(provide board?
         next-player
          valid-move?
          make-move

kmicinski

#lang racket

;; Define a function that evaluates to #t if
;; the list l contains the number 7
;;
;; - what do we do when l is '()
;; - what do we do when l is (cons hd tl)
(define (contains-7 l)
  (if (empty? l)
      #f

kmicinski

#lang racket

;; Notes, 1/22
;; f is a function from α → bool (i.e., a predicate)
;; l is list of αs
;; we return the number of elements in l such that
;; they satisfy the predicate f

;; (count even? '(0 1 2 3 4)) ;; => 3
#;(define (count f l)

kmicinski

#lang racket

(define x 22)

;; □ -- List introduction: literals, basic operations
'()
'foo
'(x y z) ;; homoiconicity -- the language uses the same
         ;; representation for syntax / expressions as it does
         ;; for data.

kmicinski

#lang racket
;; CIS352 -- Spring '26
;; Lecture 2

;; Forms

;; All forms are surrounded by parens, they form S-expressions


;; Here's something to remember from today's class

kmicinski

;; CIS352 notes -- 01/13
#lang racket

;; I can use define to define both values, and also functions
;; this is a value
(define foo 42)

;; Racket is expression-based, meaning that functions evaluate
;; their body expressions, and the result of evaluating any expression
;; is the computation's whole result...

kmicinski

#lang racket

;; Closure Conversion
(define (map f l)
  (match l
    ['() '()]
    [`(,hd . ,tl) (cons
                   (let ([clo-f (vector-ref f 0)]) (clo-f f hd)) ;; (f hd)
                   (map f tl))]))

kmicinski

#lang racket

;; CIS531 Fall '25 Project 1
;; Compiling LVar -> x86-64
(require "irs.rkt") ;; Definition of each IR (please read)
(require "system.rkt") ;; System-specific details
(require "interpreters.rkt")

(provide
 typecheck

kmicinski

#lang racket

(define (atom? a)
  (match a
    [(? integer? i) #t]
    [(? symbol? x) #t]
    [_ #f]))

(define (anf-transform e)
  ;; e is the expression to be converted