samth

;; This is not the original source code. Instead, this is the code after
;; fully expanding and flattening into a single linklet.
(module expander '#%kernel
  (#%require '#%paramz '#%unsafe '#%flfxnum '#%linklet '#%extfl)
  (#%provide
  (rename boot boot)
  (rename 1/bound-identifier=? bound-identifier=?)
  (rename 1/compile compile)
  (rename compile-keep-source-locations! compile-keep-source-locations!)
  (rename 1/compiled-expression-recompile compiled-expression-recompile)

samth

#lang at-exp racket
(provide indented
         link-file
         campuswire-url campuswire campuswire-invite ; piazza-url piazza
         zoom canvas
         youtube watch-youtube
         textbook
         the-design-recipe
         bslblock
         first-day-of-break-week week

samth

;; The first three lines of this file were inserted by DrRacket. They record metadata
;; about the language level of this file in a form that our tools can easily process.
#reader(lib "htdp-intermediate-lambda-reader.ss" "lang")((modname exam-solns) (read-case-sensitive #t) (teachpacks ()) (htdp-settings #(#t constructor repeating-decimal #f #t none #f () #f)))
;; 23:11

; Problem 1

; A SplitTree is one of:
;  - Number
;  - (make-no-points)

samth

#reader(lib"read.ss""wxme")WXME0109 ## 
#|
   This file uses the GRacket editor format.
   Open this file in DrRacket version 7.7 or later to read it.

   Most likely, it was created by saving a program in DrRacket,
   and it probably contains a program with non-text elements
   (such as images or comment boxes).

            http://racket-lang.org/

samth

#lang racket

(define (convert.1 n)
  (define pling (divides? 3 n))
  (define plang (divides? 5 n))
  (define plong (divides? 7 n))
  (if (or pling plang plong)
      (string-append (if pling "Pling" "")
                     (if plang "Plang" "")
                     (if plong "Plong" ""))

samth

#lang racket/base
;;; Copyright © 2020 Jakob L. Kreuze <zerodaysfordays@sdf.org>
;;;
;;; This program is free software; you can redistribute it and/or
;;; modify it under the terms of the GNU General Public License as
;;; published by the Free Software Foundation; either version 3 of the
;;; License, or (at your option) any later version.
;;;
;;; This program is distributed in the hope that it will be useful,
;;; but WITHOUT ANY WARRANTY; without even the implied warranty of

samth

def step(expr):
  (E,redex) = find_redex(expr)
  if isinstance(redex, App):
    if redex.op == "call/cc":
      v = redex.arg
      # E[(call/cc v)] -> E[(v (lambda (w) (abort E[w])))]
      return plug(E, App(v, Lam("w", App("abort", plug(E, "w")))))

samth

--- old.s	2020-04-21 11:07:00.527082284 -0400
+++ new.s	2020-04-21 11:06:43.331026298 -0400
@@ -1,71 +1,71 @@
+#if defined(__thumb__)
+#define RETURN(x) bx x
+#else
+#define RETURN(x) mov pc, x
+#endif
+
+	.align 3

samth

racketcs 21845/21845 5184070.732380:          1 cycles:u: 
	    7fc3fee4a100 [unknown] (/usr/lib/x86_64-linux-gnu/ld-2.30.so)

racketcs 21845/21845 5184070.732386:          1 cycles:u: 
	    7fc3fee4a100 [unknown] (/usr/lib/x86_64-linux-gnu/ld-2.30.so)

racketcs 21845/21845 5184070.732390:         23 cycles:u: 
	    7fc3fee4a100 [unknown] (/usr/lib/x86_64-linux-gnu/ld-2.30.so)

racketcs 21845/21845 5184070.732394:        746 cycles:u: 

samth

#lang racket

(require math/bigfloat racket/flonum
         math/private/flonum/flonum-functions
         math/private/utils/flonum-tests
         math/private/flonum/flonum-bits
         math/private/flonum/flonum-constants)

(define-namespace-anchor ns)