|
|
|
- ゆりな かやぬま
- 5 years ago
- Views:
Transcription
1 Scheme Hygienic Macro stibear
2
3 1 Scheme Scheme Lisp Lisp Common Lisp Emacs Lisp Clojure Scheme 1 Lisp Lisp Lisp Lisp Homoiconicity Lisper 2 Common Lisp gensym Scheme Common Lisp Scheme Lisp-1 3 Scheme Common Lisp Hygienic Macro Scheme Hygienic Macro 1 R 5 RS Scheme Common Lisp Lisp-2 2 Lisp-2 3
4 2 Lisp CLer Common Lisp ALGOL Scheme Lisp AI 4
5 I 7 1 Lisp II syntax-rules syntax-case 15 1 syntax-rules syntax-case III SC, RSC, ER, IR 23 1 Syntactic Closure Reversed Syntactic Closure Explicit Renaming Implicit Renaming
6
7 I 1 Lisp S S Lisp 1 Lisp Lisp Lisp Lisp S S 7
8 I Common Lisp defmacro Lisp 2 R 5 RS Scheme Common Lisp defmacro Gauche define-macro On Lisp nil!1 (nil! x) (set! x ()) (define-macro (nil! x) (list set! x ())) (nil! var) (set! var ()) Lisp Common Lisp 2 1 nil Scheme #f 2 ( 8
9 I 3 swap! (let ((x 3) (y 5)) (swap! x y) (list x y)) ;=> (5 3) swap! (define-macro (swap! a b) (let ((tmp,a)) (set!,a,b) (set!,b tmp))) tmp (let ((tmp 3) (y 5)) (swap! tmp y) (list tmp y)) ;=> (3 5) Gauche macroexpand (let ((tmp 3) (y 5)) (macroexpand (swap! tmp y))) ;=> (let ((tmp tmp)) ; (set! tmp y) ; (set! y tmp)) 9
10 I gensym eq? gensym swap! (define-macro (swap! a b) (let ((tmp (gensym))) (let ((,tmp,a)) (set!,a,b) (set!,b,tmp)))) gensym Common Lisp Scheme gensym 2 syntax-rules Scheme Scheme syntax-rules R 5 RS syntax-rules 4 Scheme R 5 RS Scheme syntax-rules when (when (= a 10) (display a) (+ a 20)) syntax-rules (define-syntax when ((_ pred body...) (if pred (begin body...))))) 10
11 I define-syntax (define-syntax <keyword> <transformer spec>) 3 syntax-rules S syntax-rules (syntax-rules (<literal>...) (<pattern> <template>)...) (syntax-rules <ellipses> (<literal>...) (<pattern> <template>)...) syntax-rules syntax-rules defmacro syntax-rules defmacro syntax-rules defmacro 5 2 Scheme syntax-rules Common Lisp defmacro Scheme Lisp-1 Scheme 3 11
12 I Scheme R 6 RS syntax-case syntax-rules syntax-case 2 4 syntax-case 5 aif6 (define-syntax (aif stx) (syntax-case stx () ((aif expr then else) (with-syntax ((it (datum->syntax # aif it))) # (let ((it expr)) (if it then else)))))) 2 Scheme defmacro 4 Syntactic Closure Reversed Syntactic Closure Explicit Renaming Implicit Renaming Scheme Chibi-Scheme Syntactic Closure Reversed Syntactic Closure Explicit Renaming CHICKEN Scheme Syntactic Closure Reversed Syntactic Closure Explicit Renaming Implicit Renaming MIT/GNU Scheme Syntactic Closure Reversed Syntactic Closure Explicit Renaming 4 Common Lisp identifier-syntax 5 syntax-rules 6 (aif (member b (a b c)) (car it)) 12
13 I Picrin Syntactic Closure Reversed Syntactic Closure Explicit Renaming Implicit Renaming Sagittarius Scheme Explicit Renaming 13
14
15 II syntax-rules syntax-case 1 syntax-rules 6 syntax-rules I Scheme C C syntax-rules (syntax-rules (<literal>...) (<pattern> <template>)...) (syntax-rules <ellipses> (<literal>...) (<pattern> <template>)...) <pattern> <template> <literal> 15
16 II syntax-rules syntax-case 7 (define-syntax append-macro ((_ (x...) (y...)) (x... y...)))) (define-syntax reverse-macro ((_ (obj...)) (reverse-macro% (obj...) ())))) (define-syntax reverse-macro% ((_ () x) x) ((_ (y1 y2...) (x...)) (reverse-macro% (y2...) (y1 x...))))) (define-syntax append-reverse-macro ((_ (x...) (y...)) (append-macro (reverse-macro (x...)) (y...))))) (append-reverse-macro (1 2 3) (4 5 6)) ; => (reverse-macro (1 2 3) 4 5 6) ; expected: ( ) append-reverse-macro expected get-vars syntax-rules 16
17 II syntax-rules syntax-case CPS CPS 1 (define-syntax append-macro ((_ (x...) (y...)) (x... y...)))) (define-syntax reverse-macro-cps (syntax-rules (syntax-lambda) ((_ (syntax-lambda cont-args cont-body) (obj...)) (reverse-macro-cps% (syntax-lambda it (let-syntax ((cont-syntax ((_ cont-args) cont-body)))) (cont-syntax it))) (obj...) ())))) (define-syntax reverse-macro-cps% (syntax-rules (syntax-lambda) ((_ (syntax-lambda cont-args cont-body) () x) (let-syntax ((cont-syntax ((_ cont-args) cont-body)))) (cont-syntax x))) ((_ (syntax-lambda cont-args cont-body) (y1 y2...) (x...)) (reverse-macro-cps% (syntax-lambda it (let-syntax ((cont-syntax 1 CPS 17
18 II syntax-rules syntax-case ((_ cont-args) cont-body)))) (cont-syntax it))) (y2...) (y1 x...))))) (define-syntax append-reverse-macro-cps (syntax-rules (syntax-lambda) ((_ (syntax-lambda cont-args cont-body) (x...) (y...)) (reverse-macro-cps (syntax-lambda it (let-syntax ((cont-syntax ((_ cont-args) cont-body)))) (cont-syntax ((append-macro it (y...)))))) (x...))))) (define-syntax append-reverse-macro ((_ (x...) (y...)) (append-reverse-macro-cps (syntax-lambda (it) it) (x...) (y...))))) CPS append-reverse-macro syntax-rules it rename (append-reverse-macro-cps (syntax-lambda (it0) it0) (1 2 3) (4 5 6)) (reverse-macro-cps (syntax-lambda it1 (let-syntax ((cont-syntax ((_ (it0)) it0)))) (cont-syntax ((append-macro it1 (4 5 6)))))) (1 2 3)) (reverse-macro-cps (syntax-lambda it2 18
19 II syntax-rules syntax-case (let-syntax ((cont-syntax ((_ it1) (let-syntax ((cont-syntax ((_ (it0)) it0)))) (cont-syntax ((append-macro it1 (4 5 6))))))))) (cont-syntax it2))) (1 2 3) ()) (let-syntax ((cont-syntax ((_ it5) (let-syntax ((cont-syntax ((_ it4) (let-syntax ((cont-syntax ((_ it3) (let-syntax ((cont-syntax ((_ it2) (let-syntax ((cont-syntax ((_ it1) (let-syntax ((cont-syntax ((_ (it0)) it0)))) (cont-syntax 19
20 II syntax-rules syntax-case ((append-macro it1 (4 5 6))))))))) (cont-syntax it2)))))) (cont-syntax it3)))))) (cont-syntax it4)))))) (cont-syntax it5)))))) (cont-syntax (3 2 1))) CPS 2 syntax-case aif syntax-case 8 syntax-case (syntax-case <expression> (<literal>...) <clause>...) <clause> := (<pattern> <output-expression>) (<pattern> <fender> <output-expression>) <pattern> syntax-rules _... <fender> <pattern> syntax-case syntax # aif syntax-case aif (define-syntax aif (lambda (expr) (syntax-case expr () ((aif pred then) # (aif pred then #f)) 20
21 II syntax-rules syntax-case ((k pred then else) (with-syntax ((it (datum->syntax # k it))) # (let ((it pred)) (if it then else))))))) with-syntax quasisyntax 2 (define-syntax aif (lambda (expr) (syntax-case expr () ((aif pred then) # (aif pred then #f)) ((k pred then else) (let ((it (datum->syntax # k it))) # (let ((#,it pred)) (if #,it then else))))))) datum->syntax datum->syntax 2 with-syntax let quasisyntax quasiquote unquote unquote-splicing unsyntax unsyntax-splicing R 6 RS R 6 RS R 5 RS syntax-case 9 R 6 RS syntax-case Scheme 2 # quasisyntax 21
22 II syntax-rules syntax-case R 6 RS Scheme Scheme 1 expand run Scheme 22
23 III SC, RSC, ER, IR 1 Syntactic Closure Twitter Schemer 10 Lisper Scheme S II 2 lambda make-syntactic-closure (make-syntactic-closure <free-env> <free-vars> <expression>) ; => #<syntactic closure> sc-macro-transformer Chibi Scheme Picrin (define (sc-macro-transformer f) (lambda (expr use-env mac-env) (make-syntactic-closure mac-env () (f expr use-env)))) 23
24 III SC, RSC, ER, IR swap! (define-syntax swap! (sc-macro-transformer (lambda (form env) (let ((a (make-syntactic-closure env () (second form))) (b (make-syntactic-closure env () (third form)))) (let ((value,a)) (set!,a,b) (set!,b value)))))) sc-macro-transformer (define-syntax swap! (lambda (form use-env mac-env) (let ((a (make-syntactic-closure use-env () (second form))) (b (make-syntactic-closure use-env () (third form)))) (make-syntactic-closure mac-env () (let ((value,a)) (set!,a,b) (set!,b value)))))) define-syntax a b (swap! x y) (#mac-env#let ((#mac-env#value #use-env#x)) (#mac-env#set! #use-env#x #use-env#y) (#mac-env#set! #use-env#y #mac-env#value)) 24
25 III SC, RSC, ER, IR Stallman Join us now and share the software 11 make-syntactic-closure syntax-case SC aif (define-syntax aif (sc-macro-transformer (lambda (form env) (let ((pred (make-syntactic-closure env () (second form))) (then (make-syntactic-closure env (it) (third form))) (else (if (null? (cdddr form)) #f (make-syntactic-closure env () (fourth form))))) (let ((it,pred)) (if it,then,else)))))) aif 2 it identifier? identifier=? Lisp 12 cond else SRFI-26 cut <> <...> cut SC (define-syntax cut (sc-macro-transformer (lambda (form env) (cut% () (),@(map (lambda (ex) (make-syntactic-closure env () ex)) 25
26 III SC, RSC, ER, IR (cdr form)))))) (define-syntax cut% (sc-macro-transformer (lambda (form env) (let ((slots (cadr form)) (combi (caddr form)) (se (cdddr form))) (define (id=? x y) (and (identifier? x) (identifier=? env x env y))) (cond ((null? se) (let ((slots (reverse slots)) (combi (reverse combi))) (lambda,slots ((begin,(car combi)),@(cdr combi))))) ((id=? (car se) <...>) (let ((slots (reverse slots)) (combi (reverse combi)) (rest-slot (make-syntactic-closure env () rest-slot))) (lambda (,@slots,@rest-slot) (apply,@combi,rest-slot)))) ((id=? (car se) <>) (let ((x (make-syntactic-closure env () x))) (let ((slots (cons x slots)) (combi (cons x combi))) (cut%,slots,combi,@(cdr se))))) (else (let ((combi (cons (car se) combi))) (cut%,slots,combi,@(cdr se))))))))) SC identifier? identifier=? identifier? identifier=? (identifier? <object>) ; => #t or #f (identifier=? <environment1> <identifier1> <environment2> <identifier2>) ; => #t or #f 26
27 III SC, RSC, ER, IR cut cond 1 (define-syntax cond-simple (sc-macro-transformer (lambda (form use-env) (capture-syntactic-environment (lambda (mac-env) (define (id? x y) (and (identifier? x) (identifier=? use-env x mac-env y))) (define (close-sc x) (make-syntactic-closure use-env () x)) (let ((clauses (cdr form))) (if (null? clauses) (values) (let* ((fst (car clauses)) (rst (cdr clauses)) (test (car fst))) (if (id? test else) (begin,@(map close-sc (cdr fst))) (if,(close-sc test) (begin,@(map close-sc (cdr fst))) (cond-simple,@rst))))))))))) 2 Reversed Syntactic Closure 13 Syntactic Closure Reversed Syntactic Closure 1 capture-syntactic-environment MIT/GNU Scheme CHICKEN Scheme 27
28 III SC, RSC, ER, IR RSC rsc-macro-transformer 1 (define (rsc-macro-transformer f) (lambda (expr use-env mac-env) (make-syntactic-closure use-env () (f expr mac-env)))) sc-macro-transformer swap! (define-syntax swap! (rsc-macro-transformer (lambda (form env) (let ((a (second form)) (b (third form)) (let-r (make-syntactic-closure env () let)) (value (make-syntactic-closure env () value)) (set!-r (make-syntactic-closure env () set!))) (,let-r ((,value,a)) (,set!-r,a,b) (,set!-r,b,value)))))) 3 Explicit Renaming API 14 Explicit Renaming Rename SC RSC er-macro-transformer er-macro-transformer 2 3 swap! 28
29 III SC, RSC, ER, IR (define-syntax swap! (er-macro-transformer (lambda (form rename compare?) (let ((a (second form)) (b (third form))) (,(rename let) ((,(rename value),a)) (,(rename set!),a,b) (,(rename set!),b,(rename value))))))) RSC swap! ER SC RSC 1 Rename Rename 15 ER Rename ER aif (define-syntax aif (er-macro-transformer (lambda (form rename compare?) (let ((pred (second form)) (then (third form)) (else (if (null? (cdddr form)) #f (fourth form)))) (,(rename let) ((it,pred)) (,(rename if) it,then,else)))))) Rename it aif 29
30 III SC, RSC, ER, IR good better best bad worse worst 16 ER cond-simple cut CHICKEN identifier? symbol? (define-syntax cond-simple (er-macro-transformer (lambda (form rename compare?) (define (cmp? x y) (and (identifier? x) (compare? x y))) (let ((clauses (cdr form))) (if (null? clauses) (,(rename values)) (let* ((fst (car clauses)) (rst (cdr clauses)) (test (car fst))) (if (cmp? test else) (,(rename begin),@(cdr fst)) (,(rename if),test (,(rename begin),@(cdr fst)) (,(rename cond-simple),@rst))))))))) cut (define-syntax cut-er (er-macro-transformer (lambda (form rename compare?) (,(rename cut%-er) () (),@(cdr form))))) (define-syntax cut%-er (er-macro-transformer 30
31 III SC, RSC, ER, IR (lambda (form rename compare?) (define (cmp? x y) (and (identifier? x) (compare? x y))) (let ((slots (cadr form)) (combi (caddr form)) (se (cdddr form))) (cond ((null? se) (let ((slots (reverse slots)) (combi (reverse combi))) (,(rename lambda),slots ((,(rename begin),(car combi)),@(cdr combi))))) ((cmp? (car se) (rename <...>)) (let ((slots (reverse slots)) (combi (reverse combi)) (rest-slot (rename rest-slot))) (,(rename lambda) (,@slots,@rest-slot) (,(rename apply),@combi,rest-slot)))) ((cmp? (car se) (rename <>)) (,(rename cut%-er),(cons (rename x) slots),(cons (rename x) combi),@(cdr se))) (else (,(rename cut%-er),slots,(cons (car se) combi),@(cdr se)))))))) 4 Implicit Renaming gensym with-gensym 17 31
32 III SC, RSC, ER, IR ER Implicit Renaming IR Rename ir-macro-transformer Rename IR swap! (define-syntax swap! (ir-macro-transformer (lambda (form inject compare?) (let ((a (second form)) (b (third form))) (let ((value,a)) (set!,a,b) (set! value,b)))))) ir-macro-transformer 2 IR aif (define-syntax aif (ir-macro-transformer (lambda (form inject compare?) (let ((pred (second form)) (then (third form)) (else (if (null? (cdddr form) #f (fourth form))))) (let ((,(inject it),pred)) (if,(inject it),then,else)))))) IR Rename 32
33 Lisp Scheme Scheme Scheme Schemer 33
34
35 [1] anonymous. syntactic closure. September [2] The Chicken Team, User s Manual. The CHICKEN User s Manual. [3] William Clinger. Hygienic macros through explicit renaming. SIGPLAN Lisp Pointers, Vol. IV, No. 4, pp , October [4] Chris Hanson. MIT/GNU Scheme Reference Manual. October [5] Shiro Kawai. Scheme. scheme-macro, April [6] kei. Yet another syntax-case explanation. May [7] Richard Kelsey, William Clinger, and Jonathan (eds.) Rees. The revised 5 report on the algorithmic language scheme. Technical report, Scheme Steering Committee, August [8] Oleg Kiselyov. Low- and high-level macro programming in scheme. July [9] leque. hygienic macro. May [10] Sari Sakaue and Kenichi Asai.. 10 (PPL2008), March [11] Alex Shinn. [chicken-users] macro systems and chicken (long). April [12] Alex Shinn, John Cowan, and Arthur A. Gleckler (eds.). The revised 7 report on the algorithmic language scheme. Technical report, Scheme Steering Committee, July [13] Michael Sperber, R. Kent Dybvig, Matthew Flatt, and Anton Van Straaten (eds.). The revised 6 report on the algorithmic language scheme. Technical report, Scheme Steering Committee, September
36 [14] Philip Wadler. Call-by-value is dual to call-by-name. SIGPLAN Not., Vol. 38, No. 9, pp , August [15] wasabiz. syntactic closure. March
(CC Attribution) Lisp 2.1 (Gauche )
http://www.flickr.com/photos/dust/3603580129/ (CC Attribution) Lisp 2.1 (Gauche ) 2 2000EY-Office 3 4 Lisp 5 New York The lisps Sammy Tunis flickr lisp http://www.flickr.com/photos/dust/3603580129/ (CC
shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..
![shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..](/thumbs/93/111616220.jpg "shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..")
arisa@pllab.is.ocha.ac.jp asai@is.ocha.ac.jp shift / reset CPS shift / reset CPS CPS 1 [3, 5] goto try/catch raise call/cc [17] control/prompt [8], shift/reset [5] control/prompt, shift/reset call/cc (continuationpassing
つくって学ぶプログラミング言語 RubyによるScheme処理系の実装
Ruby Scheme 2013-04-16 ( )! SICP *1 ;-) SchemeR SICP MIT * 1 Structure and Interpretaion of Computer Programs 2nd ed.: 2 i SchemeR Ruby Ruby Ruby Ruby & 3.0 Ruby ii https://github.com/ichusrlocalbin/scheme_in_ruby
r3.dvi
2012 3 / Lisp(2) 2012.4.19 1 Lisp 1.1 Lisp Lisp (1) (setq) (2) (3) setq defun (defun (... &aux...)...) ( ) ( nil ) [1]> (defun sisoku (x y &aux wa sa sho seki) (setq wa (+ x y)) (setq sa (- x y)) (setq
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A, B Z Z m, n Z m n m, n A m, n B m=n (1) A, B (2) A B = A B = Z/ π : Z Z/ (3) A B Z/ (4) Z/ A, B (5) f : Z Z f(n) = n f = g π g : Z/ Z A, B (6)
r3.dvi
/ 94 2 (Lisp ) 3 ( ) 1994.5.16,1994.6.15 1 cons cons 2 >(cons a b) (A. B).? Lisp (S ) cons 2 car cdr n A B C D nil = (A B C D) nil nil A D E = (A (B C) D E) B C E = (A B C D. E) A B C D B = (A. B) A nil.
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A B f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
SCM (v0201) ( ) SCM 2 SCM 3 SCM SCM 2.1 SCM SCM SCM (1) MS-DOS (2) Microsoft(R) Windows 95 (C)Copyright Microsoft Corp
SCM (v0201) ( ) 14 4 20 1 SCM 2 SCM 3 SCM 4 5 2 SCM 2.1 SCM SCM 2 1 2 SCM (1) MS-DOS (2) Microsoft(R) Windows 95 (C)Copyright Microsoft Corp 1981-1996. 1 (3) C:\WINDOWS>cd.. C:\>cd scm C:\SCM> C:\SCM>
1153006 JavaScript try-catch JavaScript JavaScript try-catch try-catch try-catch try-catch try-catch 1 2 2 try-catch try-catch try-catch try-catch 25 1153006 26 2 12 1 1 1 2 3 2.1... 3 2.1.1... 4 2.1.2
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
org/ghc/ Windows Linux RPM 3.2 GHCi GHC gcc javac ghc GHCi(ghci) GHCi Prelude> GHCi :load file :l file :also file :a file :reload :r :type expr :t exp
3 Haskell Haskell Haskell 1. 2. 3. 4. 5. 1. 2. 3. 4. 5. 6. C Java 3.1 Haskell Haskell GHC (Glasgow Haskell Compiler 1 ) GHC Haskell GHC http://www.haskell. 1 Guarded Horn Clauses III - 1 org/ghc/ Windows
1 May 2011
1 May 2011 2 May 2011 3 May 2011 4 May 2011 5 June 2011 6 June 2011 7 June 2011 8 June 2011 9 July 2011 10 July 2011 11 July 2011 12 July 2011 13 August 2011 14 August 2011 15 August 2011 16 August 2011
listings-ext
(6) Python (2) ( ) ohsaki@kwansei.ac.jp 5 Python (2) 1 5.1 (statement)........................... 1 5.2 (scope)......................... 11 5.3 (subroutine).................... 14 5 Python (2) Python 5.1
Autumn 2007 1 5 8 12 14 14 15 %!SASROOT/sassetup SAS Installation Setup Welcome to SAS Setup, the program used to install and maintain your SAS software. SAS Setup guides you through a series of menus
November 13 June 1 April 23 October 1 December 22 August 6 September 5 July 2 May 2 8 6 11 1 7 01 1516 4 23 4 1995 4 23 1999 4 23 19 2 02 88 5 2 3 03 6 1 6 1 300 4 04 100 7 2 7 2 706 15 2 5 05 8 6 86
Microsoft PowerPoint - IntroAlgDs-06-8.ppt
アルゴリズムとデータ構造入門 2006 年 11 月 21 日 アルゴリズムとデータ構造入門 2. データによる抽象の構築 2.2 階層データ構造と閉包性 奥乃博大学院情報学研究科知能情報学専攻知能メディア講座音声メディア分野 http://winnie.kuis.kyoto-u.ac.jp/~okuno/lecture/06/introalgds/ okuno@i.kyoto-u.ac.jp 12
Microsoft PowerPoint - IntroAlgDs-05-2.ppt
アルゴリズムとデータ構造入門 2005 年 10 月 11 日 アルゴリズムとデータ構造入門 1. 手続きによる抽象の構築 1.1 プログラムの要素 奥乃 博 1. TUT Schemeが公開されました. Windowsは動きます. Linux, Cygwin はうまく行かず. 調査中. 2. 随意課題 7の追加 友人の勉学を助け,TAの手伝いをする. 支援した内容を毎回のレポート等で詳細に報告.
Revised 5 Report on the Algorithmic Language Scheme [ Scheme ] RICHARD KELSEY, WILLIAM CLINGER, AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C.
![Revised 5 Report on the Algorithmic Language Scheme [ Scheme ] RICHARD KELSEY, WILLIAM CLINGER, AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C.](/thumbs/94/118211866.jpg "Revised 5 Report on the Algorithmic Language Scheme [ Scheme ] RICHARD KELSEY, WILLIAM CLINGER, AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C.")
Revised 5 Report on the Algorithmic Language Scheme [ Scheme ] RICHARD KELSEY, WILLIAM CLINGER, AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C. T. HAYNES G. J. ROZAS N. I. ADAMS IV D. P. FRIEDMAN
6-1
6-1 (data type) 6-2 6-3 ML, Haskell, Scala Lisp, Prolog (setq x 123) (+ x 456) (setq x "abc") (+ x 456) ; 6-4 ( ) subtype INDEX is INTEGER range -10..10; type DAY is (MON, TUE, WED, THU, FRI, SAT, SUN);
ld-2.dvi
Ld-2 Common Lisp TR-98-19 1998 8 19 1 3 2 4 2.1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
untitled
Interfaculty Initiative in Information Studies, The University of Tokyo 2 Interfaculty Initiative in Information Studies, The University of Tokyo > > 517587 82 > > > > > 3 Interfaculty Initiative in Information
2
2011.11.11 1 2 MapReduce 3 4 5 6 Functional Functional Programming 7 8 9 10 11 12 13 [10, 20, 30, 40, 50] 0 n n 10 * 0 + 20 * 1 + 30 * 2 + 40 * 3 + 50 *4 = 400 14 10 * 0 + 20 * 1 + 30 * 2 + 40 * 3 + 50
5 IO Haskell return (>>=) Haskell Haskell Haskell 5.1 Util Util (Util: Tiny Imperative Language) 1 UtilErr, UtilST, UtilCont, Haskell C
5 IO Haskell return (>>=) Haskell Haskell Haskell 5.1 Util Util (Util: Tiny Imperative Language) 1 UtilErr, UtilST, UtilCont,... 5.1.1 5.1.2 Haskell C LR ( ) 1 (recursive acronym) PHP, GNU V - 1 5.1.1
Web Web Web Web i
28 Research of password manager using pattern lock and user certificate 1170369 2017 2 28 Web Web Web Web i Abstract Research of password manager using pattern lock and user certificate Takuya Mimoto In
Microsoft PowerPoint - 2-LispProgramming-full
2013 年 5 月 31 日 Lisp プログラミング入門 西田豊明 Copyright 2013 Toyoaki Nishida All Rights Reserved. 今回あらすじ 1. Lisp の実践的な使い方を学習する. 2. Lisp インタープリタの動かし方, 電卓的使い方, 関数定義, 条件分岐,S 式の基本操作, プログラミング手法, プロトタイピング法などを中心に解説する.
44 4 I (1) ( ) (10 15 ) ( 17 ) ( 3 1 ) (2)
(1) I 44 II 45 III 47 IV 52 44 4 I (1) ( ) 1945 8 9 (10 15 ) ( 17 ) ( 3 1 ) (2) 45 II 1 (3) 511 ( 451 1 ) ( ) 365 1 2 512 1 2 365 1 2 363 2 ( ) 3 ( ) ( 451 2 ( 314 1 ) ( 339 1 4 ) 337 2 3 ) 363 (4) 46
i ii i iii iv 1 3 3 10 14 17 17 18 22 23 28 29 31 36 37 39 40 43 48 59 70 75 75 77 90 95 102 107 109 110 118 125 128 130 132 134 48 43 43 51 52 61 61 64 62 124 70 58 3 10 17 29 78 82 85 102 95 109 iii
2 2.1 NPCMJ ( (Santorini, 2010) (NPCMJ, 2016) (1) (, 2016) (1) (2) (1) ( (IP-MAT (CONJ ) (PP (NP (D ) (N )) (P )) (NP-SBJ *
Emacs Emacs : Emacs 1 Emacs Emacs ( ) (NPCMJ ) 1 Emacs NPCMJ 2 1 2 2.1 NPCMJ (http://npcmj.ninjal.ac.jp/) (Santorini, 2010) (NPCMJ, 2016) (1) (, 2016) (1) (2) (1) ( (IP-MAT (CONJ ) (PP (NP (D ) (N )) (P
jssst-ocaml.mgp
Objective Caml Jacques Garrigue Kyoto University garrigue@kurims.kyoto-u.ac.jp Objective Caml? 2 Objective Caml GC() Standard MLHaskell 3 OCaml () OCaml 5 let let x = 1 + 2 ;; val x : int = 3 ;; val-:
2011上宮太子_高校_学校案内
UENOMIYA TAISHI SENIOR HIGH SCHOOL GUIDE BOOK 2011 www.uenomiya-taishi.ed.jp Curriculum Curriculum Letʼs enjoy school life at UT! 01 02 4 April 5 May 6 June 7 July 03 8 9 10 11 August September October
美唄市広報メロディー2014年1月号
1 2014 E-mailkouhoujouhou@city.bibai.lg.jp January May September October November December February March June July August April BIBAI CITY INFORMATION http://db.net-bibai.co.jp/bibai/
( ) [2] H 4 4! H 4 4! (5 4 3 )= = Fortran C 0 #include <stdio.h> 1 #include
![( ) [2] H 4 4! H 4 4! (5 4 3 )= = Fortran C 0 #include <stdio.h> 1 #include](/thumbs/89/99166837.jpg "( ) [2] H 4 4! H 4 4! (5 4 3 )= = Fortran C 0 #include <stdio.h> 1 #include")
J.JSSAC (2006) Vol. 12, No. 3, pp. 3-16 IIJ 2000 8 bit TULIPS KING KISS WINK 1 ( ) Ackermann GC [1] CPU 6502 wada@u-tokyo.ac.jp c 2006 Japan Society for Symbolic and Algebraic Computation 4 12 3 2006 (1943-05-16
memo ii
memo ii iii iv 1 2 3 4 5 6 7 8 1. 2. memo 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 1 2 3 47 1 2 3 48 memo 49 50 51 memo 52 memo 54
Parametric Polymorphism
ML 2 2011/04/19 Parametric Polymorphism Type Polymorphism ? : val hd_int : int list - > int val hd_bool : bool list - > bool val hd_i_x_b : (int * bool) list - > int * bool etc. let hd_int = function (x
syspro-0405.ppt
3 4, 5 1 UNIX csh 2.1 bash X Window 2 grep l POSIX * more POSIX 3 UNIX. 4 first.sh #!bin/sh #first.sh #This file looks through all the files in the current #directory for the string yamada, and then prints
CX-Checker CX-Checker (1)XPath (2)DOM (3) 3 XPath CX-Checker. MISRA-C 62%(79/127) SQMlint 76%(13/17) XPath CX-Checker 3. CX-Checker 4., MISRA-C CX- Ch
CX-Checker: C 1 1 2 3 4 5 1 CX-Checker CX-Checker XPath DOM 3 CX-Checker MISRA-C CX-Checker: A Customizable Coding Checker for C TOSHINORI OSUKA, 1 TAKASHI KOBAYASHI, 1 JUNICHI MASE, 2 NORITOSHI ATSUMI,
Microsoft PowerPoint - IntroAlgDs-05-7.ppt
アルゴリズムとデータ構造入門 2005 年 11 月 15 日 アルゴリズムとデータ構造入門 2. データによる抽象の構築 2 Building Abstractions with Data 奥乃 博 具体から抽象へは行けるが 抽象から具体へは行けない ( 畑村洋太郎 直観でわかる数学 岩波書店 ) 1 11 月 15 日 本日のメニュー 2 Building Abstractions with Data
2012年夏のプログラミング・シンポジウム.indd
IIJ eiii.wada@nify.com,,.,,, Life Game, Hash.,,,,, [1]. P-1,,,.....,. Programming should be fun. Programs should be beauiful., 2 Paul Graham Lisp ANSI ommon Lisp [2]. P-1 Fourier,. P-1.. 0.1+, (0.00011001100...)
mmuship_vol04.indd
MU SH P vol.04 2 3 PART1 4 5 6 7 PART2 9 8 11 10 12 13 @MIYAZAKI MMU Students with iyazaki 14 15 9 MMU NEWS PLUS 3 7 March April May June July Pickup News H25.3 ~ H25.9 8 4 5 6 2 CIRCLE DE GOSHiP No.4
2 Mar Java (2) Java 3 Java (1) Java 19),20) Scheme Java car public static void Lcar(BCI bci) { Object x = bci.vs[bci.vsbase + 1]; if (!(x instan
![2 Mar Java (2) Java 3 Java (1) Java 19),20) Scheme Java car public static void Lcar(BCI bci) { Object x = bci.vs[bci.vsbase + 1]; if (!(x instan](/thumbs/92/108203049.jpg "2 Mar Java (2) Java 3 Java (1) Java 19),20) Scheme Java car public static void Lcar(BCI bci) { Object x = bci.vs[bci.vsbase + 1]; if (!(x instan")
Vol. 44 No. SIG 4(PRO 17) Mar. 2003 Java Lisp Java Lisp (1) Lisp Java (2) (3) Java Java Lisp Lisp Lisp IEEE Scheme 3,500 100 K A Lisp Driver to Be Embedded in Java Applications Taiichi Yuasa We present
2
2011 8 6 2011 5 7 [1] 1 2 i ii iii i 3 [2] 4 5 ii 6 7 iii 8 [3] 9 10 11 cf. Abstracts in English In terms of democracy, the patience and the kindness Tohoku people have shown will be dealt with as an exception.
Jacques Garrigue
Jacques Garrigue Garrigue 1 Garrigue 2 $ print_lines () > for i in $1; do > echo $i > done $ print_lines "a b c" a b c Garrigue 3 Emacs Lisp (defun print-lines (lines) (dolist (str lines) (insert str)
MORALITY LEARNING AMBITION 2 KASUMIGAOKA
KASUMIGAOKA MORALITY LEARNING AMBITION 2 KASUMIGAOKA KASUMIGAOKA 3 4 KASUMIGAOKA KASUMIGAOKA 5 Super Science High School 6 KASUMIGAOKA School Life 4 April 5 May 6 June 7 July 8 August 9 September 10 October
Microsoft PowerPoint - IntroAlgDs pptx
アルゴリズムとデータ構造入門 -14 2012 年 1 月 8 日 大学院情報学研究科知能情報学専攻 http://winnie.kuis.kyoto-u.ac.jp/~okuno/lecture/11/introalgds/ okuno@i.kyoto-u.ac.jp,okuno@nue.org if mod( 学籍番号の下 3 桁,3) 0 if mod( 学籍番号の下 3 桁,3) 1 if
2004 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 2
Living with Mac OS X in Lambda 21 2004 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 1 2004 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 2 2004
MacOSXLambdaJava.aw
Living with Mac OS X in Lambda 21 2005 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 1 2005 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 2 2005
51 Lego MindStorms Lisp XS Lego MindStorms 8 CPU RCX RCX Lisp XS XS RCX PC Scheme Lego MindStorms is a robot development kit which makes it possible t
51 Lego MindStorms Lisp XS Lego MindStorms 8 CPU RCX RCX Lisp XS XS RCX PC Scheme Lego MindStorms is a robot development kit which makes it possible to control one s own robot by attaching various sensors
1.indd
14 15 6 april 6 16 17 18 april 18 april 18 19 28 april 20 21 28 april 22 23 21 may 24 25 10 june 21 may 26 27 10 june 28 29 12 june 30 31 12 25 june 32 33 25 34 35 4 july 37 36 38 39 25 july 25 july 40
,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
26 Web 1353001 27 2 10
1353001 Web Gmail Google Maps Web. Web. Web,,. Web,. Web. Web Web. Web Web. Web Web Web ( ).,.. Web,...,,.,.,... Web,,.. 26 Web 1353001 27 2 10 1 1 3 2 5 2.1 Web... 5 2.2 Web... 6 2.3 Web..................
リコー工業所有権紹介｜リコーテクニカルレポートNo.23
138 Ricoh Technical Report No.23, SEPTEMBER, 1997 Ricoh Technical Report No.23, SEPTEMBER, 1997 139 140 Ricoh Technical Report No.23, SEPTEMBER, 1997 Ricoh Technical Report No.23, SEPTEMBER, 1997 141 142
i
14 i ii iii iv v vi 14 13 86 13 12 28 14 16 14 15 31 (1) 13 12 28 20 (2) (3) 2 (4) (5) 14 14 50 48 3 11 11 22 14 15 10 14 20 21 20 (1) 14 (2) 14 4 (3) (4) (5) 12 12 (6) 14 15 5 6 7 8 9 10 7
untitled
PPL 2006 MinCaml (myth) vs. vs. vs. Haskell (www.haskell.org) ML (www.standardml.org, caml.inria.fr) Standard ML (SML), Objective Caml (OCaml) Scheme (www.schemers.org) low level GCC C GCJ Java
「プログラミング言語」 SICP 第4章 ～超言語的抽象～ その6
SICP 4 6 igarashi@kuis.kyoto-u.ac.jp July 21, 2015 ( ) SICP 4 ( 6) July 21, 2015 1 / 30 4.3: Variations on a Scheme Non-deterministic Computing 4.3.1: amb 4.3.2: 4.3.3: amb ( ) SICP 4 ( 6) July 21, 2015
GOVERNOR'S No.1 JULY 2 GOVERNOR'S No.1 JULY 3 GOVERNOR'S No.1 JULY 4 GOVERNOR'S No.1 JULY 5 GOVERNOR'S No.1 JULY 6 GOVERNOR'S No.1 JULY 7 GOVERNOR'S No.1 JULY 8 GOVERNOR'S No.1 JULY 9 GOVERNOR'S No.1 JULY
Autumn 06 1 2005 100 100 1 100 1 2003 2005 10 2003 2005 2
2005 25-2 17 395.6 149.1 1 2004 2 2003p.13 3 Autumn 06 1 2005 100 100 1 100 1 2003 2005 10 2003 2005 2 Vol. 42 No. 2 2 100 20052005 2002 20052005 3 2005 10 1 II III IV 1 1 1 2 1 4 15-2 30 4,091 54.5 2
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/97/134738565.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 1, 2 of 14 ( RD S ) I 1, 2 of 14 1 / 44 Ruby Ruby ( RD S ) I 1, 2 of 14 2 / 44 7 5 9 2 9 3 3 2 6 5 1 3 2 5 6 4 7 8 4 5 2 7 9 6 4 7 1 3 ( RD S ) I 1, 2
Kaplan-Meierプロットに付加情報を追加するマクロの作成
Kaplan-Meier 1, 2,3 1 2 3 A SAS macro for extended Kaplan-Meier plots Kengo Nagashima 1, Yasunori Sato 2,3 1 Department of Parmaceutical Technochemistry, Josai University 2 School of Medicine, Chiba University
第１部 一般的コメント
(( 2000 11 24 2003 12 31 3122 94 2332 508 26 a () () i ii iii iv (i) (ii) (i) (ii) (iii) (iv) (a) (b)(c)(d) a) / (i) (ii) (iii) (iv) 1996 7 1996 12
I? 3 1 3 1.1?................................. 3 1.2?............................... 3 1.3!................................... 3 2 4 2.1........................................ 4 2.2.......................................
20 15 14.6 15.3 14.9 15.7 16.0 15.7 13.4 14.5 13.7 14.2 10 10 13 16 19 22 1 70,000 60,000 50,000 40,000 30,000 20,000 10,000 0 2,500 59,862 56,384 2,000 42,662 44,211 40,639 37,323 1,500 33,408 34,472
- 2 -
- 2 - - 3 - (1) (2) (3) (1) - 4 - ~ - 5 - (2) - 6 - (1) (1) - 7 - - 8 - (i) (ii) (iii) (ii) (iii) (ii) 10 - 9 - (3) - 10 - (3) - 11 - - 12 - (1) - 13 - - 14 - (2) - 15 - - 16 - (3) - 17 - - 18 - (4) -
2 1980 8 4 4 4 4 4 3 4 2 4 4 2 4 6 0 0 6 4 2 4 1 2 2 1 4 4 4 2 3 3 3 4 3 4 4 4 4 2 5 5 2 4 4 4 0 3 3 0 9 10 10 9 1 1
1 1979 6 24 3 4 4 4 4 3 4 4 2 3 4 4 6 0 0 6 2 4 4 4 3 0 0 3 3 3 4 3 2 4 3? 4 3 4 3 4 4 4 4 3 3 4 4 4 4 2 1 1 2 15 4 4 15 0 1 2 1980 8 4 4 4 4 4 3 4 2 4 4 2 4 6 0 0 6 4 2 4 1 2 2 1 4 4 4 2 3 3 3 4 3 4 4
1 (1) (2)
1 2 (1) (2) (3) 3-78 - 1 (1) (2) - 79 - i) ii) iii) (3) (4) (5) (6) - 80 - (7) (8) (9) (10) 2 (1) (2) (3) (4) i) - 81 - ii) (a) (b) 3 (1) (2) - 82 - - 83 - - 84 - - 85 - - 86 - (1) (2) (3) (4) (5) (6)
Rotem Meter View Software
Rotem Meter View (RMV) Version 2.05 Rotem Meter View Software PRIR42X9.DOC Page 1 1... 3 2... 3 3... 3 4... 4 5... 4 5.1 PC COM... 4 5.2 Excel... 5 5.3... 5 5.3.1... 5 5.3.2 Lost Contact Interval... 6
e ::= c op(e 1,..., e n ) if e 1 then e 2 else e 3 let x = e 1 in e 2 x let rec x y 1... y n = e 1 in e 2 e e 1... e n (e 1,..., e n ) let (x 1,..., x
e ::= c op(e 1,..., e n ) if e 1 then e 2 else e 3 let x = e 1 in e 2 x let rec x y 1... y n = e 1 in e 2 e e 1... e n (e 1,..., e n ) let (x 1,..., x n ) = e 1 in e 2 Array.create e 1 e 2 e 1.(e 2 ) e
25 II :30 16:00 (1),. Do not open this problem booklet until the start of the examination is announced. (2) 3.. Answer the following 3 proble
25 II 25 2 6 13:30 16:00 (1),. Do not open this problem boolet until the start of the examination is announced. (2) 3.. Answer the following 3 problems. Use the designated answer sheet for each problem.
MEISEI HEROES HERO HERO HERO MEISEI HEROES
MEISEI HEROES MEISEI HEROES HERO HERO HERO MEISEI HEROES 04 INDEX 06 28 08 24 26 10 14 16 22 18 20 MEISEI HEROES 05 04 MEISEI HEROES 2014 SCHOOL GUIDE MEISEI HEROES 1 2 3 4 5 06 MEISEI HEROES 2014 SCHOOL
蜷咲ｧｰ譛ｪ險ｭ螳・3
2011. October vol.606 2 3 2011. October vol.606 4 5 ' 2011. October vol.606 6 7 2011. October vol.606 8 毎 月 18 日 は 9 2011. October vol.606 10 4 4 11 2011. October vol.606 12 39 12 254 13 2011. October
第１章 国民年金における無年金
1 2 3 4 ILO ILO 5 i ii 6 7 8 9 10 ( ) 3 2 ( ) 3 2 2 2 11 20 60 12 1 2 3 4 5 6 7 8 9 10 11 12 13 13 14 15 16 17 14 15 8 16 2003 1 17 18 iii 19 iv 20 21 22 23 24 25 ,,, 26 27 28 29 30 (1) (2) (3) 31 1 20
新コンフィギュレータのフレームワークについて
: 2007 12 7 6: 2009 5 9 TOPPERS 1.... 4 1.1... 4 1.2 TOPPERS... 4 2.... 4 2.1... 4 3.... 8 4.... 9 4.1... 9 4.2... 10 4.3... 10 4.3.1... 11 4.3.2 INCLUDE... 11 4.3.3 C... 12 4.4 API... 14 4.2.1 API...
9 2008 September VOL.160
Vol.160 9 2008 September VOL.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160 Vol.160
「計算と論理」 Software Foundations その3
Software Foundations 3 cal17@fos.kuis.kyoto-u.ac.jp October 24, 2017 ( ) ( 3) October 24, 2017 1 / 47 Lists.v ( ) ( ) ( ) ( 3) October 24, 2017 2 / 47 ( ) Inductive natprod : Type := pair : nat nat natprod.
表1票4.qx4
iii iv v 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 22 23 10 11 24 25 26 27 10 56 28 11 29 30 12 13 14 15 16 17 18 19 2010 2111 22 23 2412 2513 14 31 17 32 18 33 19 34 20 35 21 36 24 37 25 38 2614
「計算と論理」 Software Foundations その4
Software Foundations 4 cal17@fos.kuis.kyoto-u.ac.jp http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/class/cal/ November 7, 2017 ( ) ( 4) November 7, 2017 1 / 51 Poly.v ( ) ( 4) November 7, 2017 2 / 51 : (
Microsoft PowerPoint Lisp.ppt [互換モード]
![Microsoft PowerPoint Lisp.ppt [互換モード]](/thumbs/95/122814430.jpg "Microsoft PowerPoint Lisp.ppt [互換モード]")
櫻井彰人 プログラム言語論 (8) Lisp, 1960 Historical Lisp 展望 古いアイデアには古いものもある 古いアイデアには新しいものもある エレガントな 極めてコンパクトな言語 C とは異世界 : 別の考え方をするよい機会 言語設計における多くの一般的課題を含む 参考文献 McCarthy, Recursive functions of symbolic expressions
2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN
![2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN](/thumbs/93/113095957.jpg "2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN")
PenFlowchart 1,a) 2,b) 3,c) 2015 3 4 2015 5 12, 2015 9 5 PEN & PenFlowchart PEN Evaluation of the Effectiveness of Programming Education with Flowcharts Using PenFlowchart Wataru Nakanishi 1,a) Takeo Tatsumi
: gettoken(1) module P = Printf exception End_of_system (* *) let _ISTREAM = ref stdin let ch = ref ( ) let read () = (let c =!ch in ch := inp
7 OCaml () 1. 2. () (compiler) (interpreter) 2 OCaml (syntax) (BNF,backus normal form ) 1 + 2; let x be 2-1 in x; ::= ; let be in ; ::= + - ::= * / ::= 7.1 ( (printable characters) (tokens) 1 (lexical
soturon.dvi
12 Exploration Method of Various Routes with Genetic Algorithm 1010369 2001 2 5 ( Genetic Algorithm: GA ) GA 2 3 Dijkstra Dijkstra i Abstract Exploration Method of Various Routes with Genetic Algorithm