2006 Scheme and Functional Programming Papers, University of

More documents

Recommendations

Info

case monster 10 literals 100 literals 1000 literals 577 literals fixnum symbol fixnum symbol fixnum symbol mixed Compiler A .04 .05 .04 .08 .11 .13 .16 Compiler B .04 .05 .07 .21 .14 3.94 3.04 Compiler C .04 .04 .18 .17 3.80 4.61 8.33 Compiler D .09 .09 .24 .22 — — 15.94 Compiler E .06 .12 .02 .50 — — 15.11 Compiler F .05 .70 .04 6.03 — — 26.95 Interpreter G 1.52 1.30 10.00 7.80 96.81 78.03 26.21 Interpreter H 1.79 1.76 10.65 10.91 115.52 119.67 Interpreter I 3.48 3.48 15.62 15.38 188.12 186.38 33.50 Interpreter J 6.00 6.33 20.99 21.63 193.17 196.21 60.26 Interpreter K 5.00 5.00 21.00 24.00 211.00 256.00 59.00 Interpreter L 5.36 5.38 29.09 28.30 280.22 289.58 147.43 Interpreter M 6.12 4.48 49.48 30.42 447.08 301.53 338.78 Interpreter N 13.82 13.88 77.68 78.18 757.16 776.75 459.51 Table 1. Timings in seconds for the case and monster micro-benchmarks casing lexing parsing reading HotSpot (array of char) 11.05 HotSpot (StringBuilder) 12.21 Compiler C 7.36 10.67 13.27 2.23 Compiler F 2.83 5.39 14.48 2.60 Compiler B 6.93 12.84 21.17 14.67 HotSpot (StringBuffer) 24.95 Compiler D 13.53 22.65 27.20 17.78 Compiler E 45.67 63.88 84.46 72.53 Interpreter G 79.93 108.44 128.95 13.88 Interpreter H 82.80 116.12 214.82 18.98 Interpreter I 180.64 237.37 297.96 Interpreter L 257.13 383.77 432.13 Interpreter J 436.19 566.83 645.31 Interpreter M 479.36 589.17 701.70 Interpreter K 468.00 628.00 745.00 Interpreter N 1341.93 1572.89 1793.64 Table 2. Timings in seconds for parsing and related benchmarks 68 Scheme and Functional Programming, 2006
References [1] Clinger, William D, and Hansen, Lars Thomas. Lambda, the ultimate label, or a simple optimizing compiler for Scheme. In Proc. 1994 ACM Conference on Lisp and Functional Programming, 1994, pages 128–139. [2] Clinger, William D. Source code for the benchmarks described in this paper are online at www.ccs.neu.edu/home/will/Research/SW2006/ [3] Clinger, William D. SRFI 6: Basic String Ports. http://srfi.schemers.org/srfi-6/. [4] Clinger, William D., et cetera. The Larceny Project. http://www.ccs.neu.edu/home/will/Larceny/ [5] Kelsey, Richard, Clinger, William, and Rees, Jonathan (editors). Revised 5 report on the algorithmic language Scheme. ACM SIGPLAN Notices 33(9), September 1998, pages 26–76. [6] Fischer, Charles N., and LeBlanc Jr, Richard J. Crafting a Compiler with C. Benjamin/Cummings, 1991. [7] Kranz, David, Adams, Norman, Kelsey, Richard, Rees, Jonathan, Hudak, Paul, and Philbin, James. ORBIT: an optimizing compiler for Scheme. In Proc. 1986 SIGPLAN Symposium on Compiler Construction, 1986, pages 219– 233. A. Notes on Benchmarking The benchmarked systems: HotSpot is the Java HotSpot(TM) Client VM of Sun Microsystems (build 1.5.0 01-b08, mixed mode, sharing). A is Larceny v0.92. B is Larceny v0.91. C is Chez Scheme v6.1. D is Gambit 4.0b17. E is Chicken Version 1, Build 89. F is Bigloo 2.7a. G is MzScheme v352. H is MzScheme v301. I is the Larceny v0.92 interpreter. J is the Gambit 4.0b17 interpreter. K is the Bigloo 2.7a interpreter. L is the MIT Scheme 7.3.1 interpreter. M is the Scheme 48 1.3 interpreter. N is the Chicken 1,89 interpreter. Except for MzScheme, the interpreters were benchmarked with no declarations and with the default settings. The compilers and MzScheme were benchmarked as in Chez Scheme’s (optimize-level 2): safe code, generic arithmetic, inlining the usual procedures. Specifically: A was compiled with (compiler-switches ’fast-safe) and (benchmark-mode #f). B was compiled the same as A. C was compiled with (optimize-level 2). D was compiled with -prelude "(declare (extended-bindings))" -cc-options "-O2" -dynamic. E was compiled with -no-trace -optimize-level 2 -block -lambda-lift. F was compiled as a module with -O6 -copt -O2. G was interpreted as a module. H was interpreted the same as G. Scheme and Functional Programming, 2006 69
Page 1:
Scheme and Functional Programming 2
Page 4 and 5:
4 Scheme and Functional Programming
Page 6 and 7:
6 Scheme and Functional Programming
Page 8 and 9:
• A web browser that plays the ro
Page 10 and 11:
and requests. When a client request
Page 12 and 13:
above prevents pages from these dom
Page 14 and 15:
14 Scheme and Functional Programmin
Page 16 and 17:
2. Explaining Macros Macro expansio
Page 18 and 19: For completeness, here is the macro
Page 20 and 21: onment is extended in the original
Page 22 and 23: expand-term(term, env, phase) = emi
Page 24 and 25: Derivation ::= (make-mrule Syntax S
Page 26 and 27: True derivation (before macro hidin
Page 28 and 29: We assume that the reader has basic
Page 30 and 31: the value of the %eax register by 4
Page 32 and 33: Code generation for the new forms i
Page 34 and 35: we introduced in 3.11. The only dif
Page 36 and 37: the user code from interfering with
Page 38 and 39: 38 Scheme and Functional Programmin
Page 40 and 41: mization and on creating efficient
Page 42 and 43: (a) stage (b) fifo (c) split (d) me
Page 44 and 45: This tagging is used later in the c
Page 46 and 47: (let ((clo_25 (%closure (lambda (y)
Page 48 and 49: nb. cycles per element 1400 1200 10
Page 52 and 53: a ∗ ❅ left right · b ❅ a S
Page 54 and 55: T ([spec], w) = { {w}, if w ∈ L([
Page 56 and 57: A([spec]): ✓✏ (where L([spec])
Page 58 and 59: construction commands. It is possib
Page 60 and 61: ; Regular expression for Scheme num
Page 62 and 63: References [1] A. V. Aho, R. Sethi,
Page 64 and 65: (let ((n (cond ((char? var0) ) ((sy
Page 66 and 67: 3. Survey An incomplete survey of a
Page 72 and 73: modest programming requirements, an
Page 74 and 75: development of incomplete subsystem
Page 76 and 77: the previous request. This method a
Page 78 and 79: could be run indefinitely. This fun
Page 80 and 81: programmers reject Scheme without r
Page 82 and 83: (define interp (λ (env e) (case e
Page 84 and 85: Before describing the run-time sema
Page 86 and 87: Figure 5. Cast Insertion Figure 6.
Page 88 and 89: Figure 7. Evaluation Figure 8. Eval
Page 90 and 91: catching type errors, as we do here
Page 92 and 93: [34] J. C. Reynolds. Types, abstrac
Page 94 and 95: let id (T:*) (x:T) : T = x; The tra
Page 96 and 97: Figure 3: Regular Expressions and N
Page 98 and 99: Figure 5: Evaluation Rules Evaluati
Page 100 and 101: 5. Exact Substitution: E, (x = v :
Page 102 and 103: Figure 9: Subtyping Algorithm Algor
Page 104 and 105: for most type variables, and that m
Page 106 and 107: 2. miniKanren Overview This section
Page 108 and 109: 3. Pseudo-Variadic Relations Just a
Page 110 and 111: Replacing run 10 with run ∗ cause
Page 112 and 113: As might be expected, we could use
Page 114 and 115: Of course there are still infinitel
Page 116 and 117: To ensure that streams produced by
Page 118 and 119:
118 Scheme and Functional Programmi
Page 120 and 121:
On the other hand, we can use a hig
Page 122 and 123:
(ev* (Q (lambda (x) (+ x 1)))) # >
Page 124 and 125:
(term ’lam (lambda (x) (if (equal
Page 126 and 127:
a message: there is no guarantee th
Page 128 and 129:
(! (self) 3) (?) =⇒ 1 (?? odd?) =
Page 130 and 131:
(define new-server (spawn (lambda (
Page 132 and 133:
The abstraction shown in this secti
Page 134 and 135:
Erlang Termite List length (µs) (
Page 136 and 137:
Page 138 and 139:
page of j contains the URL of the p
Page 140 and 141:
4. Solution The failed attempts abo
Page 142 and 143:
· ; · ; · :: Store × Frame Stac
Page 144 and 145:
logically creates a sub-session of
Page 146 and 147:
on this work, including Ryan Culpep
Page 148 and 149:
ing application operation. 1 As a r
Page 150 and 151:
such as image glyphs corresponding
Page 152 and 153:
Phone For clarity, this code pr
Page 154 and 155:
A. Porting TinyScheme to Qualcomm B
Page 156 and 157:
Page 158 and 159:
ware installers have to install any
Page 160 and 161:
defines a module named circle-lib i
Page 162 and 163:
Figure 2. Sometimes special cases a
Page 164 and 165:
Considering all of these issues tog
show all

2006 Scheme and Functional Programming Papers, University of

Create successful ePaper yourself

Delete template?

Save as template?