2006 Scheme and Functional Programming Papers, University of

More documents

Recommendations

Info

4 Scheme and Functional Programming, 2006
Schedule & Table of Contents 8:30am Invited Talk: The HOP Development Kit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Manuel Serrano (Inria Sophia Antipolis) A Stepper for Scheme Macros . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 Ryan Culpepper, Matthias Felleisen (Northeastern University) 10:00am Break 10:30am An Incremental Approach to Compiler Construction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 Abdulaziz Ghuloum (Indiana University) SHard: a Scheme to Hardware Compiler . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 Xavier Saint-Mleux (Université de Montréal), Marc Feeley (Université de Montréal) and Jean-Pierre David (École Polytechnique de Montréal) Automatic construction of parse trees for lexemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 Danny Dubé (Université Laval) and Anass Kadiri (EPITA, Paris France) Rapid Case Dispatch in Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 William D. Clinger (Northeastern University) Experiences with Scheme in an Electro-Optics Laboratory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 Richard Cleis and Keith Wilson (Air Force Research Laboratory) 12:30pm Lunch 2:00pm Gradual Typing for Functional Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81 Jeremy G. Siek and Walid Taha (Rice University) Sage: Hybrid Checking for Flexible Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 Jessica Gronski (University of California, Santa Cruz (UCSC)), Kenneth Knowles (UCSC), Aaron Tomb (UCSC), Stephen N. Freund (Williams College), and Cormac Flanagan (UCSC) From Variadic Functions to Variadic Relations: A miniKanren Perspective . . . . . . . . . . . . . . 105 William E. Byrd and Daniel P. Friedman (Indiana University) 3:30pm Break 4:00pm A Self-Hosting Evaluator using HOAS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 Eli Barzilay (Northeastern University) Concurrency Oriented Programming in Termite Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 Guillaume Germain, Marc Feeley, Stefan Monnier (Université de Montréal) Interaction-Safe State for the Web . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 Jay McCarthy and Shriram Krishnamurthi (Brown University) Scheme for Client-Side Scripting in Mobile Web Browsing, or AJAX-Like Behavior Without Javascript . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147 Ray Rischpater (Rocket Mobile, Inc.) Component Deployment with PLaneT: You Want it Where? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157 Jacob Matthews (University of Chicago) 6:10pm 8:00pm 8:15pm Break for dinnner Gelato R 6 RS Status Report Kent Dybvig (Indiana University) Scheme and Functional Programming, 2006 5
Page 1: Scheme and Functional Programming 2
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 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 68 and 69:
case monster 10 literals 100 litera
Page 70 and 71:
70 Scheme and Functional Programmin
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?