Augmented . Automatic . Automating . Axioms .

A Complete Bibliography of Publications in Higher-Order

Symbolic Computation

Nelson H.F.Beebe

Center for Scienti?c Computing

University of Utah

Department of Mathematics,110LCB

155S1400E RM233

Salt Lake City,UT84112-0090

USA

Tel:+18015815254

FAX:+18015814148

E-mail:beebe@c368ef2fed630b1c59eeb583,beebe@c368ef2fed630b1c59eeb583,

beebe@c368ef2fed630b1c59eeb583(Internet)

WWW URL:c368ef2fed630b1c59eeb583/~beebe/

06July2005

Version2.00

Title word cross-reference 5[3].p[8].

-Calculus[8].

1960s[42].

Abstract[52,70,119].Abstraction[40]. Accumulating[112].Act[43].

Actor[11,90].Adaptation[111]. Algebraic[119].Algorithm[25,59]. Algorithmic[3].Analysis[79,104,119]. Applications[23].

Approach[7,35,69,110].APTS[96]. Arithmetics[97].Assignment[1,107].

Augmented[109].Automatic[105,106]. Automating[77].Axioms[87]. Barrelled[83].Based[29,30,72,116].

Be[20].Beyond[23].Binding[10]. Bisimilarity[120].

Calculating[73].Calculi[49].

Calculus[8,16,21,58,59,80,101,120]. Call[19,20,87].Call-by-Value[87].

Call/CC[19,20].Cambridge[42,48]. Can[20].CC[19,20].Certifying[33]. Christopher[39,41,44,47,48,51]. Circular[112].Class[18,79].Code[33]. Collection[76].Coloured[115]. Combining[32].Comparing[83,100]. Compilation[33,56].

1

2

Compiler[35,48,114].

Compiler-Compiler[35].Compiling[21]. Completeness[80].Composable[11]. Computation[34,35].

Computational[97].Computer[66]. Computing[24].Concepts[37,38,46,51]. Constraint[111].Construction[62]. Constructs[83].Contexts[24]. Continuation[19,29,30,85].

Continuation-Based[29,30]. Continuation-Passing[85]. Continuations[18,21,53,54,86,118]. Contributions[49].Control[83]. Conversion[1,84,107].

Correctness[89,114].Corrigendum[107]. Cost[109].Cost-Augmented[109].

CPL[42,48].CPS[1,7,23,83,84,107]. Cube[23].Cut[89].

Data[32].Declaring[110]. Decomposition[77].De?nitional[13,14]. Deforest[112].Dependent[81,104]. Diagrams[90].Di?erence[97].

Di?erencing[97].Di?erentiation[66]. Direct[8].Directed[71].

Distributed[76].Divided[97].

Divided-Di?erence[97].Domain[70]. Domains[49].Double[83].

Double-Barrelled[83].

Dynamic[10,56,95].

Early[21].

Editorial[2,12,17,26,31,36,55,60,64,68, 74,78,82,88,92,98,102,108,113,117].

E?ciency[61].Elimination[72]. Engineering[49].Environment[59]. Euclidean[25].

Evaluation[21,25,34,35,63,69,71,76,109]. Exceptions[20].Explicit[80]. Expressive[19].Extended[16].

First[15,18,21].First-Class[18].

First-Order[21].Flow[67,86].

Follow[43].Foreword[37].Formal[96,99].Formalised[80]. Formalization[79].Foundations[99]. Full[54].Functional[66,91,100,109,115]. Fundamental[37,38,51].Fusion[89]. Futamura[71].

Garbage[76].Generalization[5,6,89]. Generation[33,105,106].Generic[65]. Geometric[105,106].Geometry[91]. Glossary[63].Growing[27].

Handling[54].Hard[43].Higher[14,57]. Higher-Order[14,57].Hybrid[69]. Implementation[18,46,76]. Implementing[115].Implications[19]. Incrementalization[61,95].

Induction[49].Inference[59].

In?uence[41].Information[67,86]. Interpretation[58,119].

Interpreter[16,56].

Interpreters[13,14,77].

Introduction[4,5,22,61].

Java[79].Jumps[5,6,54].

Labels[5,6].Lambda[16,58,80,101]. Lambda-Calculus[80].

Lambda-I-Calculus[101].Landin[5]. Language[3,27,46,49,115].

Languages[14,37–39,65,70,100].

Linear[58,85,86].Linear-Time[58]. Loading[79].Local[84].

Logic[104,109,114].Loops[84]. Macrogeneration[40].

Management[116].Mathematical[54]. Memory[116].ML[9,75].Model[62,67]. Models[11,52].Multiprocessing[29,30]. My[45].

Nested[84].Nets[115].Network[75]. Non[103].Non-Standard[103]. Normalization[101].

REFERENCES3

Object[65].Object-Oriented[65].

O?ine[69].Online[69].Operational[99]. Optimal[28].Optimization[114]. Optimizing[84].Order[14,21,57]. Oriented[65].Output[111].

Output-Constraint[111].

Parallel[100].Parameters[112].

Partial[21,25,34,35,63,69,71,109]. Passing[85].Path[94,104].

Performance[76,100].Personal[44].

Petri[115].Polymorphic[1,28,59,107]. Power[19,119].Powerful[20].

Pragmatic[110].Predicate[21]. Predicates[105,106].Process[34,35]. Program[32,56,70,81,96,103,110,111]. Programming[14,37–39,49,95,100,115]. Programming-Language[49].

Programs[66,67,104,109,112].

Projection[71].Proof[77,80,89]. Protocol[75].Pure[58].

Queries[94].

Recollection[44].Recollections[41]. Recursion[87].Re?ections[50].

Re?ective[65].Region[116,120].

Region-Based[116].Regular[70,94].

Rei?cation[65].Related[63]. Reminiscences[47].Report[3,15]. Representations[28].Requirements[96]. Rerooting[76].Research[93].

Retraction[7].Retrospective[93,116]. Revised[3].

Revisited[13,15,25,29,34,53].Rules[21]. Run[33].Run-Time[33].

Safe[9].Safe-for-Space[9].

Scenarios[110].Scheme[3,15,16]. Second[71].Secure[67,86].Self[58].

Self-Interpretation[58].Semantic[11]. Semantics[54,99,103].Sequential[67]. Servers[118].Short[89].Short-Cut[89]. Simply[80].Sized[73].Slicing[62,103].Software[62].Some[50].Soundness[80]. Space[9].Specialisation[70]. Specialization[32,56,110,111].

Speci?cation[90].Speci?cations[96]. Stack[75].Staged[105,106].

Standard[9,75,103].Static[56,95]. Storage[52].

Strachey[39,41,44,45,47–51].

Strategies[18].Strictly[20].Strong[101]. Style[8].Substitutions[80].

Subtyping[28].Syntactic[10,40,77]. Synthesis[96].Systems[90].

Technique[65].Temporal[114]. Termination[81].Theories[11,77]. Theory[10].Threads[9].Time[33,58]. Topics[63].Transform[7].

Translation[101].Translations[23].

Tree[70,76].Twice[19].

Type[1,59,71,72,107].Type-Based[72]. Type-Directed[71].Type-Inference[59]. Typed[80].Types[28,73,81].

Unchecked[20].UnCurrying[57]. Understanding[39].Unique[77]. Universal[94].Use[21].Useless[72]. Useless-Variable[72].

Using[19,84,96,112,115].

Value[87].Variable[72].

Veri?cation[81].via[86,95,111].

Weak[101].Web[118].Work[50].

Written[21].

Years[45].

References

Harper:1993:PTA [1]Robert W.Harper and Mark Lillibridge.

Polymorphic type assignment and CPS

conversion.Lisp and Symbolic Compu-

REFERENCES4

tation,6(3/4):361–380,November1993.

CODEN LSCOEX.ISSN0892-4635.See corrigendum[107].

Kessler:1998:E [2]Bob Kessler and Carolyn Talcott.Edi-

torial.Higher-Order and Symbolic Com-putation,11(1):5,August1998.CO-DEN LSCOEX.ISSN1388-3690(print), 1573-0557(electronic).URL http: //c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690& volume=11&issue=1&spage=5;http:/ /wkap.nl/oasis.htm/182522.

Abelson:1998:RRA [3]H.Abelson,R.K.Dybvig, C.T.

Haynes,G.J.Rozas,N.I.Adams IV, D.P.Friedman, E.Kohlbecker,

G.L.Steele Jr.,D.H.Bartley,R.Hal-

stead, D.Oxley,G.J.Sussman,

G.Brooks, C.Hanson,K.M.Pit-

man,and M.Wand.Revised5report on the algorithmic language Scheme.

Higher-Order and Symbolic Computa-tion,11(1):7–105,August1998.CO-DEN LSCOEX.ISSN1388-3690(print), 1573-0557(electronic).URL http: //c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690& volume=11&issue=1&spage=7;http:/ /wkap.nl/oasis.htm/168705.

Danvy:1998:I [4]Olivier Danvy and Carolyn L.Tal-

cott.Introduction.Higher-Order and Symbolic Computation,11(2): 115–116,December1998.CODEN LSCOEX.ISSN1388-3690(print), 1573-0557(electronic).URL http: //c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=2&spage=115;http: //wkap.nl/oasis.htm/187565.

Thielecke:1998:ILG [5]Hayo Thielecke.An introduction

to Landin’s“A Generalization of

Jumps and Labels”.Higher-Order

and Symbolic Computation,11(2):

117–123,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=2&spage=117;http: //wkap.nl/oasis.htm/187566.

Landin:1998:GJL [6]Peter c368ef2fed630b1c59eeb583ndin.A generalization

of jumps and labels.Higher-Order

and Symbolic Computation,11(2):

125–143,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=2&spage=125;http: //wkap.nl/oasis.htm/188501.

Kucan:1998:RAC [7]Jakov Kucan.Retraction approach

to CPS transform.Higher-Order

and Symbolic Computation,11(2):

145–175,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=2&spage=145;http: //wkap.nl/oasis.htm/187567.

Boudol:1998:CDS [8]G′e rard Boudol.The p-calculus

in direct style.Higher-Order and

REFERENCES5

Symbolic Computation,11(2):177–

208,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=2&spage=177;http:

//wkap.nl/oasis.htm/187568.

Biagioni:1998:SST [9]Edoardo Biagioni,Ken Cline,Pe-

ter Lee,Chris Okasaki,and Chris

Stone.Safe-for-space threads in

Standard ML.Higher-Order and

Symbolic Computation,11(2):209–

225,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=2&spage=209;http:

//wkap.nl/oasis.htm/187569.

Moreau:1998:STD [10]Luc Moreau.A syntactic theory

of dynamic binding.Higher-Order

and Symbolic Computation,11(3):

233–279,September1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=3&spage=233;http:

//wkap.nl/oasis.htm/188358.

Talcott:1998:CSM [11]Carolyn c368ef2fed630b1c59eeb583posable seman-

tic models for actor theories.Higher-

Order and Symbolic Computation,11

(3):281–343,September1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=3&spage=281;http:

//wkap.nl/oasis.htm/188360.

Danvy:1998:E [12]Olivier Danvy and Carolyn Tal-

cott.Editorial.Higher-Order

and Symbolic Computation,11(4):

353–354,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=4&spage=353;http:

//wkap.nl/oasis.htm/193814.

Reynolds:1998:DIR [13]John C.Reynolds.De?nitional in-

terpreters revisited.Higher-Order

and Symbolic Computation,11(4):

355–361,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=4&spage=355;http:

//wkap.nl/oasis.htm/193815.

Reynolds:1998:DIH [14]John C.Reynolds.De?nitional in-

terpreters for higher-order program-

ming languages.Higher-Order and

Symbolic Computation,11(4):363–

397,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=4&spage=363;http:

//wkap.nl/oasis.htm/193816.

REFERENCES6

Sussman:1998:FRS [15]Gerald Jay Sussman and Guy L.

Steele Jr.The?rst report on

Scheme revisited.Higher-Order

and Symbolic Computation,11(4):

399–404,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=4&spage=399;http:

//wkap.nl/oasis.htm/193819.

Sussman:1998:SIE [16]Gerald Jay Sussman and Guy L.

Steele Jr.Scheme:An interpreter

for extended lambda calculus.Higher-

Order and Symbolic Computation,11

(4):405–439,December1998.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=11&issue=4&spage=405;http:

//wkap.nl/oasis.htm/193825.

Danvy:1999:Ea [17]Olivier Danvy and Carolyn Talcott.Edi-

torial.Higher-Order and Symbolic Com-

putation,12(1):5,April1999.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=1&spage=5;http:/

/wkap.nl/oasis.htm/202966.

Clinger:1999:ISF [18]William D.Clinger,Anne H.Hartheimer,

and Eric M.Ost.Implementation

strategies for?rst-class continuations.

Higher-Order and Symbolic Computa-

tion,12(1):7–45,April1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=1&spage=7;http:/

/wkap.nl/oasis.htm/202967.

Thielecke:1999:UCT [19]Hayo c368ef2fed630b1c59eeb583ing a continu-

ation twice and its implications for

the expressive power of call/cc.

Higher-Order and Symbolic Computa-

tion,12(1):47–73,April1999.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=1&spage=47;http:

//wkap.nl/oasis.htm/202968.

Lillibridge:1999:UEC [20]Mark Lillibridge.Unchecked excep-

tions can be strictly more powerful

than call/cc.Higher-Order and Sym-

bolic Computation,12(1):75–104,April

1999.CODEN LSCOEX.ISSN1388-

3690(print),1573-0557(electronic).

URL c368ef2fed630b1c59eeb583/

openurl.asp?genre=article&issn=

1388-3690&volume=12&issue=1&spage=

75;wkap.nl/oasis.htm/

202969.

Sandewall:1999:EUC [21]Erik Sandewall.An early use of

continuations and partial evaluation

for compiling rules written in?rst-

order predicate calculus.Higher-

Order and Symbolic Computation,12

(1):105–113,April1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

REFERENCES7

asp?genre=article&issn=1388-3690&

volume=12&issue=1&spage=105;http:

//wkap.nl/oasis.htm/202970.

Danvy:1999:I [22]Olivier Danvy and Carolyn Tal-

cott.Introduction.Higher-Order

and Symbolic Computation,12(2):

123–124,September1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=2&spage=123;http:

//wkap.nl/oasis.htm/234968.

Barthe:1999:CTA [23]Gilles Barthe,John Hatcli?,and

Morten Heine B.S?rensen.CPS

translations and applications:The

cube and beyond.Higher-Order

and Symbolic Computation,12(2):

125–170,September1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=2&spage=125;http:

//wkap.nl/oasis.htm/234969.

Mason:1999:CC [24]Ian c368ef2fed630b1c59eeb583puting with con-

texts.Higher-Order and Symbolic

Computation,12(2):171–201,September

1999.CODEN LSCOEX.ISSN1388-

3690(print),1573-0557(electronic).

URL c368ef2fed630b1c59eeb583/

openurl.asp?genre=article&issn=

1388-3690&volume=12&issue=2&spage=

171;wkap.nl/oasis.htm/

234970.

Lee:1999:PEE [25]C.S.Lee.Partial evaluation of the

Euclidean algorithm,revisited.Higher-

Order and Symbolic Computation,12

(2):203–212,September1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=2&spage=203;http:

//wkap.nl/oasis.htm/234971.

Danvy:1999:Eb [26]Olivier Danvy and Carolyn Talcott.Edi-

torial.Higher-Order and Symbolic Com-

putation,12(3):219,October1999.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=3&spage=219;http:

//wkap.nl/oasis.htm/237511.

Steele:1999:GL [27]Guy L.Steele Jr.Growing a language.

Higher-Order and Symbolic Computa-

tion,12(3):221–236,October1999.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=3&spage=221;http:

//wkap.nl/oasis.htm/237513.

Aiken:1999:ORP [28]Alexander Aiken,Edward L.Wim-

mers,and Jens Palsberg.Opti-

mal representations of polymorphic

types with subtyping.Higher-Order

and Symbolic Computation,12(3):

237–282,October1999.CODEN

LSCOEX.ISSN1388-3690(print),

REFERENCES8

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=3&spage=237;http:

//wkap.nl/oasis.htm/237515.

Wand:1999:CBMa [29]Mitchell Wand.Continuation-based

multiprocessing revisited.Higher-

Order and Symbolic Computation,12

(3):283,October1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=3&spage=283;http:

//wkap.nl/oasis.htm/237519.

Wand:1999:CBMb [30]Mitchell Wand.Continuation-based

multiprocessing.Higher-Order and

Symbolic Computation,12(3):285–299,

October1999.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557

(electronic).URL

c368ef2fed630b1c59eeb583/openurl.asp?genre=

article&issn=1388-3690&volume=12&

issue=3&spage=285;wkap.

nl/oasis.htm/237518.

Danvy:1999:Ec [31]Olivier Danvy and Carolyn Tal-

cott.Editorial.Higher-Order

and Symbolic Computation,12(4):

307–308,December1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=4&spage=307;http:

//wkap.nl/oasis.htm/247760.

Chiroko?:1999:CPD [32]Sandrine Chiroko?,Charles Consel,

and Renaud c368ef2fed630b1c59eeb583bining pro-

gram and data specialization.Higher-

Order and Symbolic Computation,12

(4):309–335,December1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=4&spage=309;http:

//wkap.nl/oasis.htm/247762.

Hornof:1999:CCR [33]Luke Hornof and Trevor Jim.Cer-

tifying compilation and run-time

code generation.Higher-Order and

Symbolic Computation,12(4):337–

375,December1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=4&spage=337;http:

//wkap.nl/oasis.htm/247764.

Futamura:1999:PECa [34]Yoshihiko Futamura.Partial eval-

uation of computation process,re-

visited.Higher-Order and Symbolic

Computation,12(4):377–380,December

1999.CODEN LSCOEX.ISSN1388-

3690(print),1573-0557(electronic).

URL c368ef2fed630b1c59eeb583/

openurl.asp?genre=article&issn=

1388-3690&volume=12&issue=4&spage=

377;wkap.nl/oasis.htm/

247765.

Futamura:1999:PECb [35]Yoshihiko Futamura.Partial evalua-

tion of computation process—an ap-

proach to a compiler-compiler.Higher-

REFERENCES9

Order and Symbolic Computation,12

(4):381–391,December1999.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=12&issue=4&spage=381;http:

//wkap.nl/oasis.htm/247768.

Danvy:2000:Ea [36]Olivier Danvy and Carolyn Talcott.Edi-

torial.Higher-Order and Symbolic Com-

putation,13(1–2):5–6,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=5;http:/

/wkap.nl/oasis.htm/257991.

Mosses:2000:FFC [37]Peter D.Mosses.A foreword

to“Fundamental Concepts in Pro-

gramming Languages”.Higher-

Order and Symbolic Computation,13

(1–2):7–9,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=7;http:/

/wkap.nl/oasis.htm/257992.

Strachey:2000:FCP [38]Christopher Strachey.Fundamental

concepts in programming languages.

Higher-Order and Symbolic Computa-

tion,13(1–2):11–49,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=11;http:

//wkap.nl/oasis.htm/257993.

Burstall:2000:CSU [39]Rod Burstall.Christopher Strachey—

understanding programming languages.

Higher-Order and Symbolic Computa-

tion,13(1–2):51–55,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=51;http:

//wkap.nl/oasis.htm/258012.

Dybvig:2000:MSA [40]R.Kent Dybvig.From macrogenera-

tion to syntactic abstraction.Higher-

Order and Symbolic Computation,13

(1–2):57–63,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=57;http:

//wkap.nl/oasis.htm/258015.

Gordon:2000:CSR [41]Mike Gordon.Christopher Strachey:

Recollections of his in?uence.Higher-

Order and Symbolic Computation,13

(1–2):65–67,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=65;http:

//wkap.nl/oasis.htm/258017.

Hartley:2000:CC [42]David Hartley.Cambridge and

CPL in the1960s.Higher-Order

REFERENCES10

and Symbolic Computation,13(1–

2):69–70,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=69;http:

//wkap.nl/oasis.htm/258018.

Hoare:2000:HAF [43]C.A.R.Hoare.A hard act to follow.

Higher-Order and Symbolic Computa-

tion,13(1–2):71–72,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=71;http:

//wkap.nl/oasis.htm/258019.

Jackson:2000:CSP [44]Michael Jackson.Christopher Stra-

chey:A personal recollection.Higher-

Order and Symbolic Computation,13

(1–2):73–74,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=73;http:

//wkap.nl/oasis.htm/258020.

Landin:2000:MYS [45]Peter c368ef2fed630b1c59eeb583ndin.My years with Strachey.

Higher-Order and Symbolic Computa-

tion,13(1–2):75–76,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=75;http:

//wkap.nl/oasis.htm/258021.

Milne:2000:LCI [46]Robert Milne.From language concepts

to implementation concepts.Higher-

Order and Symbolic Computation,13

(1–2):77–81,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=77;http:

//wkap.nl/oasis.htm/258022.

Penrose:2000:RCS [47]Roger Penrose.Reminiscences of

Christopher Strachey.Higher-Order

and Symbolic Computation,13(1–

2):83–84,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=83;http:

//wkap.nl/oasis.htm/258023.

Richards:2000:CSC [48]Martin Richards.Christopher Stra-

chey and the Cambridge CPL compiler.

Higher-Order and Symbolic Computa-

tion,13(1–2):85–88,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=85;http:

//wkap.nl/oasis.htm/258024.

Schmidt:2000:IDC [49]David A.Schmidt.Induction,do-

mains,calculi:Strachey’s contributions

to programming-language engineering.

Higher-Order and Symbolic Computa-

tion,13(1–2):89–101,April2000.CO-

DEN LSCOEX.ISSN1388-3690(print),

REFERENCES11

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=89;http:

//wkap.nl/oasis.htm/258025.

Scott:2000:SRS [50]Dana Scott.Some re?ections on

Strachey and his work.Higher-

Order and Symbolic Computation,13

(1–2):103–114,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=103;http:

//wkap.nl/oasis.htm/258026.

Stoy:2000:CSF [51]Joe Stoy.Christopher Strachey

and fundamental concepts.Higher-

Order and Symbolic Computation,13

(1–2):115–117,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=115;http:

//wkap.nl/oasis.htm/258027.

Tennent:2000:AMS [52]Robert D.Tennent and Dan R.Ghica.

Abstract models of storage.Higher-

Order and Symbolic Computation,13

(1–2):119–129,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=119;http:

//wkap.nl/oasis.htm/258028.

Wadsworth:2000:CR [53]Christopher P.Wadsworth.Con-

tinuations revisited.Higher-Order

and Symbolic Computation,13(1–

2):131–133,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=131;http:

//wkap.nl/oasis.htm/258029.

Strachey:2000:CMS [54]Christopher Strachey and Christo-

pher P.Wadsworth.Continua-

tions:A mathematical semantics

for handling full jumps.Higher-

Order and Symbolic Computation,13

(1–2):135–152,April2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=1&spage=135;http:

//wkap.nl/oasis.htm/258030.

Danvy:2000:Eb [55]Olivier Danvy and Carolyn Tal-

cott.Editorial.Higher-Order

and Symbolic Computation,13(3):

159–160,September2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=3&spage=159;http:

//wkap.nl/oasis.htm/272138.

Thibault:2000:SDP [56]Scott Thibault,Charles Consel,Ju-

lia c368ef2fed630b1c59eeb583wall,Renaud Marlet,and

Gilles Muller.Static and dy-

REFERENCES12

namic program compilation by inter-

preter specialization.Higher-Order

and Symbolic Computation,13(3):

161–178,September2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=3&spage=161;http:

//wkap.nl/oasis.htm/272057.

Hannan:2000:HOU [57]John Hannan and Patrick Hicks.

Higher-order UnCurrying.Higher-

Order and Symbolic Computation,13

(3):179–216,September2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=3&spage=179;http:

//wkap.nl/oasis.htm/272058.

Mogensen:2000:LTS [58]Torben?.Mogensen.Linear-

time self-interpretation of the pure

lambda calculus.Higher-Order and

Symbolic Computation,13(3):217–

237,September2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=3&spage=217;http:

//wkap.nl/oasis.htm/272059.

Nishizaki:2000:PEC [59]Shin-Ya Nishizaki.A polymorphic

environment calculus and its type-

inference algorithm.Higher-Order

and Symbolic Computation,13(3):

239–278,September2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=3&spage=239;http:

//wkap.nl/oasis.htm/272061.

Danvy:2000:Ec [60]Olivier Danvy and Carolyn Tal-

cott.Editorial.Higher-Order

and Symbolic Computation,13(4):

287–288,December2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=4&spage=287;http:

//wkap.nl/oasis.htm/278950.

Liu:2000:EII [61]Yanhong A.Liu.E?ciency by incre-

mentalization:An introduction.Higher-

Order and Symbolic Computation,13

(4):289–313,December2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=4&spage=289;http:

//wkap.nl/oasis.htm/278951.

Hatcli?:2000:SSM [62]John Hatcli?,Matthew B.Dwyer,

and Hongjun Zheng.Slicing soft-

ware for model construction.Higher-

Order and Symbolic Computation,13

(4):315–353,December2000.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=13&issue=4&spage=315;http:

//wkap.nl/oasis.htm/278952.

REFERENCES13

Mogensen:2000:GPE [63]Torben?.Mogensen.Glossary for

partial evaluation and related top-

ics.Higher-Order and Symbolic Com-

putation,13(4):355–368,December

2000.CODEN LSCOEX.ISSN1388-

3690(print),1573-0557(electronic).

URL c368ef2fed630b1c59eeb583/

openurl.asp?genre=article&issn=

1388-3690&volume=13&issue=4&spage=

355;wkap.nl/oasis.htm/

278953.

Danvy:2001:Ea [64]Olivier Danvy and Carolyn Talcott.Edi-

torial.Higher-Order and Symbolic Com-

putation,14(1):5,March2001.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=1&spage=5;http:/

/wkap.nl/oasis.htm/323056.

Douence:2001:GRT [65]R′e mi Douence and Mario S¨u dholt.A

generic rei?cation technique for object-

oriented re?ective languages.Higher-

Order and Symbolic Computation,14

(1):7–34,March2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=1&spage=7;http:/

/wkap.nl/oasis.htm/323057.

Karczmarczuk:2001:FDC [66]Jerzy Karczmarczuk.Functional dif-

ferentiation of computer programs.

Higher-Order and Symbolic Computa-

tion,14(1):35–57,March2001.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=1&spage=35;http:

//wkap.nl/oasis.htm/323058.

Sabelfeld:2001:PMS

[67]Andrei Sabelfeld and David Sands.

A per model of secure information

?ow in sequential programs.Higher-

Order and Symbolic Computation,14

(1):59–91,March2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=1&spage=59;http:

//wkap.nl/oasis.htm/323060.

Danvy:2001:Eb [68]Olivier Danvy and Julia c368ef2fed630b1c59eeb583wall.Edi-

torial.Higher-Order and Symbolic Com-

putation,14(2–3):99–100,September

2001.CODEN LSCOEX.ISSN1388-

3690(print),1573-0557(electronic).

URL c368ef2fed630b1c59eeb583/

openurl.asp?genre=article&issn=

1388-3690&volume=14&issue=2&spage=

99;wkap.nl/oasis.htm/

323060.

Sumii:2001:HAO

[69]Eijiro Sumii and Naoki Kobayashi.

A hybrid approach to online and of-

?ine partial evaluation.Higher-Order

and Symbolic Computation,14(2–3):

101–142,September2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=2&spage=101;http:

//wkap.nl/oasis.htm/323060.

REFERENCES14

Gallagher:2001:RTL [70]John P.Gallagher and Julio C.

Peralta.Regular tree languages

as an abstract domain in program

specialisation.Higher-Order and

Symbolic Computation,14(2–3):143–

172,September2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=2&spage=143;http:

//wkap.nl/oasis.htm/323060.

Grobauer:2001:SFP [71]Bernd Grobauer and Zhe Yang.The

second Futamura projection for type-

directed partial evaluation.Higher-

Order and Symbolic Computation,14

(2–3):173–219,September2001.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=2&spage=173;http:

//wkap.nl/oasis.htm/323060.

Kobayashi:2001:TBU [72]Naoki Kobayashi.Type-based useless-

variable elimination.Higher-Order

and Symbolic Computation,14(2–3):

221–260,September2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=2&spage=221;http:

//wkap.nl/oasis.htm/323060.

Chin:2001:CST [73]Wei-Ngan Chin and Siau-Cheng Khoo.

Calculating sized types.Higher-Order

and Symbolic Computation,14(2–3):

261–300,September2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=14&issue=2&spage=261;http:

//wkap.nl/oasis.htm/323060.

Danvy:2001:Ec [74]Olivier Danvy,Takayasu Ito,and Car-

olyn Talcott.Editorial.Higher-

Order and Symbolic Computation,14

(4):307,December2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:/

/c368ef2fed630b1c59eeb583/content/

getfile/4979/18/1/abstract.htm;

c368ef2fed630b1c59eeb583/

content/getfile/4979/18/1/fulltext.

pdf;springerlink.

com/openurl.asp?genre=article&issn=

1388-3690&volume=14&issue=4&spage=

307.

Biagioni:2001:NPS [75]Edoardo Biagioni,Robert Harper,

and Peter Lee.A network proto-

col stack in Standard ML.Higher-

Order and Symbolic Computation,14

(4):309–356,December2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:/

/c368ef2fed630b1c59eeb583/content/

getfile/4979/18/2/abstract.htm;

c368ef2fed630b1c59eeb583/

content/getfile/4979/18/2/fulltext.

pdf;springerlink.

com/openurl.asp?genre=article&issn=

1388-3690&volume=14&issue=4&spage=

309.

Moreau:2001:TRD [76]Luc Moreau.Tree rerooting in dis-

REFERENCES15

tributed garbage collection:Imple-

mentation and performance evaluation.

Higher-Order and Symbolic Computa-

tion,14(4):357–386,December2001.

CODEN LSCOEX.ISSN1388-3690

(print),1573-0557(electronic).URL

c368ef2fed630b1c59eeb583/

content/getfile/4979/18/3/abstract.

htm;ipsapp007.lwwonline.

com/content/getfile/4979/18/3/fulltext.

pdf;springerlink.

com/openurl.asp?genre=article&issn=

1388-3690&volume=14&issue=4&spage=

357.

Xiao:2001:STI [77]Yong Xiao,Amr Sabry,and Zena M.

Ariola.From syntactic theories to

interpreters:Automating the proof

of unique decomposition.Higher-

Order and Symbolic Computation,14

(4):387–409,December2001.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:/

/c368ef2fed630b1c59eeb583/content/

getfile/4979/18/4/abstract.htm;

c368ef2fed630b1c59eeb583/

content/getfile/4979/18/4/fulltext.

pdf;springerlink.

com/openurl.asp?genre=article&issn=

1388-3690&volume=14&issue=4&spage=

387.

Danvy:2002:Ea [78]Olivier Danvy,Takayasu Ito,and Car-

olyn Talcott.Editorial.Higher-

Order and Symbolic Computation,15

(1):5,March2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/19/1/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/19/1/fulltext.pdf;c368ef2fed630b1c59eeb583/openurl. asp?genre=article&issn=1388-3690& volume=15&issue=1&spage=5.

Tozawa:2002:F AC

[79]Akihiko Tozawa and Masami Hagiya.

Formalization and analysis of class load-

ing in Java.Higher-Order and Sym-

bolic Computation,15(1):7–55,March

2002.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/19/2/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/19/2/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=1&spage=7.

Coquand:2002:FPS [80]Catarina Coquand.A formalised proof

of the soundness and completeness of

a simply typed lambda-calculus with

explicit substitutions.Higher-Order

and Symbolic Computation,15(1):57–

90,March2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/19/3/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/19/3/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=1&spage=57.

Xi:2002:DTP [81]Hongwei Xi.Dependent types for pro-

gram termination veri?cation.Higher-

Order and Symbolic Computation,15(1):

91–131,March2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

REFERENCES16

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/19/4/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/19/4/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=1&spage=91.

Danvy:2002:Eb [82]Olivier Danvy and Amr Sabry.Ed-

itorial.Higher-Order and Symbolic

Computation,15(2–3):139–140,Septem-

ber2002.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/20/1/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/20/1/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=2&spage=139.

Thielecke:2002:CCC [83]Hayo c368ef2fed630b1c59eeb583paring control

constructs by double-barrelled CPS.

Higher-Order and Symbolic Compu-

tation,15(2–3):141–160,September

2002.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/20/2/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/20/2/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=2&spage=141.

Reppy:2002:ONL [84]John Reppy.Optimizing nested

loops using local CPS conversion.

Higher-Order and Symbolic Compu-

tation,15(2–3):161–180,September

2002.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/20/3/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/20/3/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=2&spage=161.

Berdine:2002:LCP [85]Josh Berdine,Peter O’Hearn,Uday

Reddy,and Hayo Thielecke.Lin-

ear continuation-passing.Higher-Order

and Symbolic Computation,15(2–3):

181–208,September2002.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL

c368ef2fed630b1c59eeb583/content/

getfile/4979/20/4/abstract.htm;

c368ef2fed630b1c59eeb583/

content/getfile/4979/20/4/fulltext.

pdf;springerlink.

com/openurl.asp?genre=article&issn=

1388-3690&volume=15&issue=2&spage=

181.

Zdancewic:2002:SIF [86]Steve Zdancewic and Andrew C.My-

ers.Secure information?ow via linear

continuations.Higher-Order and Sym-

bolic Computation,15(2–3):209–234,

September2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/20/5/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/20/5/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

REFERENCES17

asp?genre=article&issn=1388-3690&

volume=15&issue=2&spage=209.

Hasegawa:2002:ARC [87]Masahito Hasegawa and Yoshihiko

Kakutani.Axioms for recursion in

call-by-value.Higher-Order and Sym-

bolic Computation,15(2–3):235–264,

September2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/20/6/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/20/6/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=2&spage=235.

Danvy:2002:Ec [88]Olivier Danvy and Carolyn Talcott.

Editorial.Higher-Order and Sym-

bolic Computation,15(4):271,Decem-

ber2002.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/21/1/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/21/1/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=4&spage=271.

Johann:2002:GSC [89]Patricia Johann.A generalization

of short-cut fusion and its correct-

ness proof.Higher-Order and Sym-

bolic Computation,15(4):273–300,De-

cember2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/21/2/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/21/2/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=4&spage=273.

Smith:2002:SDA [90]Scott F.Smith and Carolyn L.Tal-

cott.Speci?cation diagrams for ac-

tor systems.Higher-Order and Sym-

bolic Computation,15(4):301–348,De-

cember2002.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/21/3/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/21/3/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=4&spage=301.

Henderson:2002:FG [91]Peter Henderson.Functional geom-

etry.Higher-Order and Symbolic

Computation,15(4):349–365,Decem-

ber2002.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/21/4/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/21/4/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=15&issue=4&spage=349.

Danvy:2003:Ea [92]Olivier Danvy,Fritz Henglein,Harry

Mairson,and Alberto Pettorossi.Ed-

itorial.Higher-Order and Symbolic

Computation,16(1–2):5–6,March–June

REFERENCES18

2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/22/1/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/22/1/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=1&spage=5.

Paige:2003:RR [93]Bob Paige.Research retrospec-

tive.Higher-Order and Symbolic Com-

putation,16(1–2):7–13,March–June

2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/22/2/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/22/2/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=1&spage=7.

deMoor:2003:URP [94]Oege de Moor,David Lacey,and

Eric Van Wyk.Universal regular path

queries.Higher-Order and Symbolic

Computation,16(1–2):15–35,March–

June2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/22/3/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/22/3/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=1&spage=15.

Liu:2003:DPS [95]Yanhong A.Liu and Scott D.Stoller.

Dynamic programming via static in-

crementalization.Higher-Order and

Symbolic Computation,16(1–2):37–62,

March–June2003.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/22/4/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/22/4/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=1&spage=37.

Leonard:2003:PSF [96]Elizabeth I.Leonard and Constance L.

Heitmeyer.Program synthesis from

formal requirements speci?cations us-

ing APTS.Higher-Order and Symbolic

Computation,16(1–2):63–92,March–

June2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/22/5/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/22/5/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=1&spage=63.

Reps:2003:CDD [97]Thomas W.Reps and Louis B.

c368ef2fed630b1c59eeb583putational divided di?er-

encing and divided-di?erence arith-

metics.Higher-Order and Symbolic

Computation,16(1–2):93–149,March–

June2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

REFERENCES19

4979/22/6/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/22/6/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=1&spage=93.

Basin:2003:E [98]David Basin,Olivier Danvy,Julian

Padget,and Carolyn Talcott.Ed-

itorial.Higher-Order and Symbolic

Computation,16(3):159,September

2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/23/1/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/23/1/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=3&spage=159.

Ford:2003:FFO [99]Jonathan Ford and Ian A.Mason.

Formal foundations of operational se-

mantics.Higher-Order and Symbolic

Computation,16(3):161–202,Septem-

ber2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/23/2/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/23/2/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=3&spage=161.

Loidl:2003:CPF [100]H.-W.Loidl, F.Rubio,N.Scaife, K.Hammond,S.Horiguchi,U.Klusik,

R.Loogen,G.J.Michaelson,R.Pe?n a,S.Priebe,′A.J.Reb′o n,and P.W. c368ef2fed630b1c59eeb583paring parallel functional languages:Programming and perfor-mance.Higher-Order and Symbolic Computation,16(3):203–251,Septem-ber2003.CODEN LSCOEX.ISSN 1388-3690(print),1573-0557(elec-tronic).URL ipsapp008. c368ef2fed630b1c59eeb583/content/getfile/ 4979/23/3/abstract.htm; c368ef2fed630b1c59eeb583/content/ getfile/4979/23/3/fulltext.pdf; c368ef2fed630b1c59eeb583/openurl. asp?genre=article&issn=1388-3690& volume=16&issue=3&spage=203.

Gortz:2003:SNW

[101]Inge Li G?rtz,Signe Reuss,and Morten Heine S?rensen.Strong nor-

malization from weak normalization

by translation into the lambda-I-

calculus.Higher-Order and Symbolic

Computation,16(3):253–285,Septem-

ber2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/23/4/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/23/4/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=3&spage=253.

Danvy:2003:Eb [102]Olivier Danvy and Peter Thiemann.

Editorial.Higher-Order and Sym-

bolic Computation,16(4):295,Decem-

ber2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/24/1/abstract.htm;

REFERENCES20

c368ef2fed630b1c59eeb583/content/

getfile/4979/24/1/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=4&spage=295.

Giacobazzi:2003:NSS [103]Roberto Giacobazzi and Isabella Mas-troeni.Non-standard semantics for

program slicing.Higher-Order and

Symbolic Computation,16(4):297–339,

December2003.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/24/2/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/24/2/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=4&spage=297.

Lu:2003:PDA [104]Lunjin Lu.Path dependent analysis of logic programs.Higher-Order and

Symbolic Computation,16(4):341–377,

December2003.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/24/3/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/24/3/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=4&spage=341.

Corrigendum:2003:AGS [105]Corrigendum.Automatic generation of staged geometric predicates.Higher-

Order and Symbolic Computation,16

(4):379–400,December2003.CODEN

LSCOEX.ISSN1388-3690(print),1573-0557(electronic).URL http: //c368ef2fed630b1c59eeb583/openurl. asp?genre=article&issn=1388-3690& volume=16&issue=4&spage=379.

Nanevski:2003:AGS

[106]Aleksandar Nanevski,Guy Blelloch, and Robert Harper.Automatic gen-

eration of staged geometric predi-

cates.Higher-Order and Symbolic

Computation,16(4):379–400,Decem-

ber2003.CODEN LSCOEX.ISSN

1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/24/4/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/24/4/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=4&spage=379.

Harper:2003:CPT [107]Robert Harper and Mark Lillibridge.

Corrigendum:Polymorphic type assign-

ment and CPS conversion.Higher-Order

and Symbolic Computation,16(4):401,

December2003.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557(elec-

tronic).URL ipsapp008.

c368ef2fed630b1c59eeb583/content/getfile/

4979/24/5/abstract.htm;

c368ef2fed630b1c59eeb583/content/

getfile/4979/24/5/fulltext.pdf;

c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=16&issue=4&spage=401.See

[1].

Chin:2004:E [108]Wei-Ngan Chin,Olivier Danvy,and Peter Thiemann.Editorial.Higher-

Order and Symbolic Computation,17

REFERENCES21

(1–2):5–6,March2004.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=17&issue=1&spage=5.

Vidal:2004:CAP [109]Germ′a n Vidal.Cost-augmented partial evaluation of functional logic programs.

Higher-Order and Symbolic Computa-

tion,17(1–2):7–46,March2004.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=17&issue=1&spage=7.

LeMeur:2004:SSP [110]Anne-Fran?c oise Le Meur,Julia L.

Lawall,and Charles Consel.Specializa-

tion scenarios:A pragmatic approach

to declaring program specialization.

Higher-Order and Symbolic Computa-

tion,17(1–2):47–92,March2004.CO-

DEN LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=17&issue=1&spage=47.

Khoo:2004:PAO [111]Siau-Cheng Khoo and Kun Shi.Pro-gram adaptation via output-constraint

specialization.Higher-Order and Sym-

bolic Computation,17(1–2):93–128,

March2004.CODEN LSCOEX.

ISSN1388-3690(print),1573-0557

(electronic).URL

c368ef2fed630b1c59eeb583/openurl.asp?genre=

article&issn=1388-3690&volume=17&

issue=1&spage=93.

Voigtlander:2004:UCP [112]Janis Voigtl¨a c368ef2fed630b1c59eeb583ing circu-lar programs to deforest in accu-

mulating parameters.Higher-Order

and Symbolic Computation,17(1–2):

129–163,March2004.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=17&issue=1&spage=129.

Basin:2004:E [113]David Basin,Olivier Danvy,and Robert Harper.Editorial.Higher-

Order and Symbolic Computation,17

(3):171,September2004.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=17&issue=3&spage=171.

Lacey:2004:COC [114]David Lacey,Neil D.Jones,Eric Van Wyk,and Carl Christian Frederik-

c368ef2fed630b1c59eeb583piler optimization correct-

ness by temporal logic.Higher-

Order and Symbolic Computation,17

(3):173–206,September2004.CODEN

LSCOEX.ISSN1388-3690(print),

1573-0557(electronic).URL http:

//c368ef2fed630b1c59eeb583/openurl.

asp?genre=article&issn=1388-3690&

volume=17&issue=3&spage=173.

Kristensen:2004:ICP [115]Lars Michael Kristensen and S?ren Christensen.Implementing coloured

Petri nets using a functional pro-

gramming language.Higher-Order

and Symbolic Computation,17(3):

本文来源：https://www.bwwdw.com/article/81te.html