2015年3月13日金曜日

開発環境

計算機プログラムの構造と解釈[第2版](ハロルド エイブルソン (著)、ジュリー サスマン (著)、ジェラルド・ジェイ サスマン (著)、Harold Abelson (原著)、Julie Sussman (原著)、Gerald Jay Sussman (原著)、和田 英一 (翻訳)、翔泳社、原書: Structure and Interpretation of Computer Programs (MIT Electrical Engineering and Computer Science)(SICP))の2(データによる抽象の構築)、2.1(データ抽象入門)、2.1.2(抽象の壁)、問題 2.2.を解いてみる。

その他参考書籍

問題 2.2.

コード(BBEdit, Emacs)

(define make-segment
  (lambda (start end) (cons start end)))

(define start-segment
  (lambda (segment) (car segment)))

(define end-segment
  (lambda (segment) (cdr segment)))

(define make-point
  (lambda (x y) (cons x y)))

(define x-point
  (lambda (point) (car point)))

(define y-point
  (lambda (point) (cdr point)))

(define mid-point
  (lambda (p1 p2)
    (make-point (/ (+ (x-point p1)
                      (x-point p2))
                   2)
                (/ (+ (y-point p1)
                      (y-point p2))
                   2))))

(define print-point
  (lambda (p)
    (display "(")
    (display (x-point p))
    (display ",")
    (display (y-point p))
    (display ")")
    (newline)))

(define p1 (make-point 0 0))
(define p2 (make-point 1 1))
(define m (mid-point p1 p2))
(print-point p1)
(print-point p2)
(print-point m)

入出力結果(Terminal(kscheme), REPL(Read, Eval, Print, Loop))

$ kscheme < sample2.scm
In : Out: make-segment
In : Out: start-segment
In : Out: end-segment
In : Out: make-point
In : Out: x-point
In : Out: y-point
In : Out: mid-point
In : Out: print-point
In : Out: p1
In : Out: p2
In : Out: m
In : (0,0)
Out: ;undefined
In : (1,1)
Out: ;undefined
In : (1/2,1/2)
Out: ;undefined
In : $

0 コメント:

コメントを投稿