readscheme-website/www/new2002.html

1 line
65 KiB
HTML

<html><head><title>Archived 2002 Additions</title><meta name="generator" content="SchemeBib and Site-ML" charset="utf-8" /><meta name="description" content="Online bibliography of Scheme research" /><meta name="keywords" content="Scheme, bibliography, research" /><meta name="robots" content="index,follow" /><link rel="stylesheet" href="basic.css" type="text/css" /></head><body><table width="100%"><tr valign="top"><td width="124"><table width="124"><tr width="124" height="45"><td width="124" height="45"><a href="http://readscheme.org"><img width="124" height="45" border="0" alt="Readscheme.org" src="./imgs/nav-logo.gif" /></a></td></tr><tr width="124" height="124"><td width="124" height="124"><a href="./index.html" target="_top"><img width="124" height="124" border="0" alt="Scheme Bibliography Home" src="./imgs/nav_mainlogo.gif" /></a></td></tr><tr width="124" height="30"><td width="124" height="30"><a href="./page1.html" target="_top"><img width="124" height="30" border="0" alt="Classics" src="./imgs/nav_classics.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page2.html" target="_top"><img width="124" height="18" border="0" alt="Semantics" src="./imgs/nav_sem.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page3.html" target="_top"><img width="124" height="18" border="0" alt="Macros" src="./imgs/nav_macros.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page4.html" target="_top"><img width="124" height="18" border="0" alt="Objects" src="./imgs/nav_objects.gif" /></a></td></tr><tr width="124" height="30"><td width="124" height="30"><a href="./page5.html" target="_top"><img width="124" height="30" border="0" alt="Modules" src="./imgs/nav_modules.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page6.html" target="_top"><img width="124" height="18" border="0" alt="Continuations" src="./imgs/nav_cps.gif" /></a></td></tr><tr width="124" height="30"><td width="124" height="30"><a href="./pagexml.html" target="_top"><img width="124" height="30" border="0" alt="Web Programming" src="./imgs/nav_xml.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page7.html" target="_top"><img width="124" height="18" border="0" alt="Applications" src="./imgs/nav_appl.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page8.html" target="_top"><img width="124" height="18" border="0" alt="Implementation" src="./imgs/nav_impl.gif" /></a></td></tr><tr width="124" height="30"><td width="124" height="30"><a href="./page9.html" target="_top"><img width="124" height="30" border="0" alt="Concurrent Programming" src="./imgs/nav_conc.gif" /></a></td></tr><tr width="124" height="30"><td width="124" height="30"><a href="./page10.html" target="_top"><img width="124" height="30" border="0" alt="Partial Evaluation" src="./imgs/nav_pe.gif" /></a></td></tr><tr width="124" height="18"><td width="124" height="18"><a href="./page11.html" target="_top"><img width="124" height="18" border="0" alt="Reflection" src="./imgs/nav_reflect.gif" /></a></td></tr><tr width="124" height="30"><td width="124" height="30"><a href="./whats_new.html" target="_top"><img width="124" height="30" border="0" alt="Recent Additions" src="./imgs/nav_recent.gif" /></a></td></tr></table></td><td width="20"><img width="20" height="1" border="0" src="./imgs/dot_clear.gif" /></td><td><a name="whats-new" /><h2>Archived 2002 Additions</h2><h3>December 11, 2002</h3><ul><li>Paul Haahr. "Montage: Breaking Windows into Small Pieces". <em>Summer 1990 Usenix Conference</em>. 1990. Available online: <a href="http://www.webcom.com/haahr/montage/montage-usenix-s90.html">html</a>.</li></ul><h3>November 18, 2002</h3><ul><li>St&eacute;phane Ducasse and Tamar Richner. "Executable Connectors: Towards Reusable Design Elements". <em>ESEC/FSE'97 (European Software Engineering Conference)</em>. September 1997. Available online: <a href="http://www.iam.unibe.ch/~scg/Archive/Papers/Duca97bExecutableConnectors.pdf">pdf</a>.</li><li>St&eacute;phane Ducasse, Mireille Blay-Fornarino and Anne-Marie Pinna. "Object and Dependency Oriented Programming in FLO". <em>ISMIS'96 (International Symposium on Methodologies for Intelligent Systems)</em>. June 1996. Available online: <a href="http://www.iam.unibe.ch/~scg/Archive/Papers/Duca96bDependencyOP.pdf">pdf</a>.</li><li>St&eacute;phane Ducasse, Mireille Blay-Fornarino and Anne-Marie Pinna. "A Reflective Model for First Class Dependencies". <em>OOPSLA'95 (International Conference on Object - Oriented Programming Systems Languages and Applications)</em>. October 1995. Available online: <a href="http://www.iam.unibe.ch/~scg/Archive/Papers/Duca95bAReflectiveModel.pdf">pdf</a>.</li><li>St&eacute;phane Ducasse. "Inheritance Mechanism Reification by Means of First Class Object". <em>International IJCAI'95 Workshop on Reflection and Meta - Level Architectures and their Applications in AI</em>. 1995. </li><li>St&eacute;phane Ducasse. "Reifying Inheritance in a Reflective Language". Universit&eacute; de Nice-Sophia Antipolis. I3S Lab RR-95-28. 1996. Available online: <a href="http://www.iam.unibe.ch/~scg/Archive/Papers/Duca96aInhReify.ps.gz">ps</a>.</li><li>St&eacute;phane Ducasse. "Int&eacute;gration r&eacute;flexive de d&eacute;pendances dans un mod&egrave;le &agrave; classes". PhD. Thesis. Universit&eacute; de Nice-Sophia Antipolis. January 1997. Available online: <a href="http://www.iam.unibe.ch/~scg/Archive/Papers/Duca97aPhD.ps.gz">ps</a> <a href="http://www.iam.unibe.ch/~scg/Archive/Papers/Duca97aPhD.pdf">pdf</a>.</li><li>Mads Sig Ager, Olivier Danvy and Henning Korsholm Rohde. "On Obtaining Knuth, Morris, and Pratt's String Matcher by Partial Evaluation". <em>ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ASIA-PEPM '02</em>. July 2002. Available online: <a href="http://www.brics.dk/RS/02/32/BRICS-RS-02-32.ps.gz">ps</a> <a href="http://www.brics.dk/RS/02/32/BRICS-RS-02-32.pdf">pdf</a>.</li><li>Hidehiko Masuhara. "Architecture Design and Compilation Techniques Using Partial Evaluation in Reflective Concurrent Object-Oriented Languages". PhD. Thesis. University of Tokyo. January 1999. Available online: <a href="http://www.graco.c.u-tokyo.ac.jp/~masuhara/papers/phdthesis.ps.gz">ps</a> <a href="http://www.graco.c.u-tokyo.ac.jp/~masuhara/papers/phdthesis.pdf">pdf</a>.</li><li>Hidehiko Masuhara and Akinori Yonezawa. "Design and Partial Evaluation of Meta-objects for a Concurrent Reflective Language". <em>European Conference on Object-Oriented Programming (ECOOP'98)</em>. July 1998. Available online: <a href="http://www.yl.is.s.u-tokyo.ac.jp/pub/papers/ecoop98-abclr3-letter.ps.gz">ps</a> <a href="http://www.yl.is.s.u-tokyo.ac.jp/pub/papers/ecoop98-abclr3.pdf">pdf</a>.</li><li>Anne Brygoo, Titou Durand, Pascal Manoury, Christian Queinnec and Mich&egrave;le Soria. "Experiment around a training engine". <em>IFIP WCC 2002 - World Computer Congress</em>. August 2002. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/ifip2002.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/ifip2002.pdf">pdf</a>.</li><li>Anne Brygoo, Titou Durand, Pascal Manoury, Christian Queinnec and Mich&egrave;le Soria. "Un c&eacute;d&eacute;rom pour scheme -- chacun son entraineur, un entraineur pour tous". <em>TICE 2002</em>. November 2002. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/tice2002.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/tice2002.pdf">pdf</a>.</li><li>Donovan Kolbly. "Extensible Language Implementation". PhD. Thesis. University of Texas. September 2002. Available online: <a href="http://www.cs.utexas.edu/ftp/pub/techreports/tr02-71.ps.gz">ps</a>.</li><li>Matthias Felleisen. "Developing Interactive Web Programs". <em>Summer School on Advanced Functional Programming 2002</em>. August 2002. Available online: <a href="http://www.ccs.neu.edu/scheme/pubs/afp2002-f.ps.gz">ps</a>.</li><li>Danny Dub&eacute;. "Demand-driven type analysis for dynamically-typed functional languages". PhD. Thesis. Universit&eacute; de Montr&eacute;al. August 2002. Available online: <a href="http://www.iro.umontreal.ca/~dube/these.ps.gz">ps</a>.</li><li>J&ouml;rg F. Wittenberger. "Askemos - a distributed settlement". <em>SSGRR2002</em>. 2002. Available online: <a href="http://www.askemos.org:9080/RomePaper.pdf">pdf</a>.</li><li>Jean-Pierre Briot, Pierre Cointe and Emmanuel Saint-James. "Re&eacute;criture et r&eacute;cursion dans une fermeture - Etude dans un Lisp &agrave; liaison superficielle - Application aux objets". <em>Actes des Journ&eacute;es AFCET-Informatique Langages Orient&eacute;s Objet, BIGRE+Globule</em>. 48. January 1986. </li></ul><a name="icfp2002adds" /><h3>New Papers from PLI'2002 and the Scheme Workshop 2002</h3><ul><li>Christian Queinnec. "A library for quizzes". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/queinnec-quizzes.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/queinnec-quizzes.pdf">pdf</a>.</li><li>Timothy J. Hickey. "Incorporating Scheme-based web programming in computer-literacy courses". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/hickey.pdf">pdf</a>.</li><li>Noel Welsh, Francisco Solsona and Ian Glover. "SchemeUnit and SchemeQL: Two little languages". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/schemeunit-schemeql.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/schemeunit-schemeql.pdf">pdf</a>.</li><li>Adam Wick, Matthew Flatt and Wilson Hsieh. "Reachability-based memory accounting". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/wick.pdf">pdf</a>.</li><li>Martin Gasbichler and Michael Sperber. "Processes vs. user-level threads in scsh". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/gasbichler.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/gasbichler.pdf">pdf</a>.</li><li>Oscar Waddell, Dipanwita Sarkar and R. Kent Dybvig. "Robust and effective transformation of letrec". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/waddell.pdf">pdf</a>.</li><li>Mayer Goldberg. "A variadic extension of Curry's fixed-point combinator". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/goldberg.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/goldberg.pdf">pdf</a>.</li><li>Oleg Kiselyov. "How to write seemingly unhygienic and referentially opaque macros with syntax-rules". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/kiselyov.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/kiselyov.pdf">pdf</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/kiselyov-talk.pdf">talk (pdf)</a>.</li><li>Danny Dub&eacute; and Marc Feeley. "A Demand-Driven Adaptive Type Analysis". <em>International Conference on Functional Programming (ICFP'2002)</em>. October 2002. Available online: <a href="http://www.iro.umontreal.ca/~dube/icfp02.ps.gz">ps</a>.</li><li>Lars Thomas Hansen and William D. Clinger. "An Experimental Study of Renewal-Older-First Garbage Collection". <em>International Conference on Functional Programming (ICFP'2002)</em>. October 2002. Available online: <a href="ftp://ftp.ccs.neu.edu/pub/people/will/p131-hansen.pdf">pdf</a>.</li><li>Bernard Serpette and Manuel Serrano. "Compiling Scheme to JVM bytecode: a performance study". <em>International Conference on Functional Programming (ICFP'2002)</em>. October 2002. Available online: <a href="http://www.inria.fr/mimosa/Manuel.Serrano/publi/ss-icfp02.ps.gz">ps</a>.</li><li>Michael Sperber and Martin Gasbichler. "Final shift for call/cc: Direct implementation of shift and reset". <em>International Conference on Functional Programming (ICFP'2002)</em>. October 2002. Available online: <a href="http://www-pu.informatik.uni-tuebingen.de/users/gasbichl/publications/icfp02.ps">ps</a>.</li><li>Oleg Kiselyov. "Macros that Compose: Systematic Macro Programming". <em>Generative Programming and Component Engineering (GPCE'02)</em>. October 2002. Available online: <a href="http://okmij.org/ftp/papers/CPS-Macros.ps.gz">ps</a> <a href="http://okmij.org/ftp/papers/Macros-talk.pdf">talk (pdf)</a>.</li><li>Martin Gasbichler, Michael Sperber. "A Direct Implementation of Shift/Reset". <em>IFL 2001</em>. 2001. </li></ul><h3>October 20, 2002</h3><ul><li>Chris Hanson. "A Syntactic Closures Macro Facility". <em>Lisp Pointers</em>. IV. 4. October-December 1991. Available online: <a href="http://www.swiss.ai.mit.edu/ftpdir/users/cph/macros/prop.ps.gz">ps</a>.</li></ul><h3>September 28, 2002</h3><ul><li>Julia L. Lawall. "Proofs by structural induction using partial evaluation". <em>Proceedings of the ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (PEPM'93)</em>. 1993. Available online: <a href="http://portal.acm.org/citation.cfm?id=154646&dl=ACM&coll=portal">ACM Digital Library</a>.</li><li>Christian Mossin. "Partial evaluation of general parsers". <em>Proceedings of the ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (PEPM'93)</em>. 1993. Available online: <a href="http://portal.acm.org/citation.cfm?id=154632&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Peter Lee and Uwe F. Pleban. "On the use of LISP in implementing denotational semantics". <em>Proceedings of the 1986 ACM conference on LISP and functional programming</em>. 1986. Available online: <a href="http://portal.acm.org/citation.cfm?id=319866&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Kenichi Asai. "Online partial evaluation for shift and reset". <em>Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation (PEPM'02)</em>. January 2002. Available online: <a href="http://pllab.is.ocha.ac.jp/~asai/papers/pepm02.ps.gz">ps</a> <a href="http://portal.acm.org/citation.cfm?id=503034&coll=portal&dl">ACM Digital Library</a>.</li><li>Richard A. Kelsey and Jonathan A. Rees. "Modules (in 'The Incomplete Scheme48 Reference Manual for release 0.57')". 2001. Available online: <a href="http://s48.org/0.57/manual/s48manual_24.html">html</a> <a href="http://s48.org/0.57/s48manual.ps.gz">ps</a>.</li><li>Oleg Kiselyov and Kirill Lisovsky. "XML, XPath, XSLT implementations as SXML, SXPath, and SXSLT". <em>International Lisp Conference (2002)</em>. September 2002. Available online: <a href="http://okmij.org/ftp/papers/SXs.pdf">pdf</a> <a href="http://pobox.com/~oleg/ftp/papers/SXs-talk.pdf">talk (pdf)</a>.</li><li>Kurt N&oslash;rmark. "XML in LAML - Web Programming in Scheme". August 2002. Available online: <a href="http://www.cs.auc.dk/~normark/laml/papers/xmlinlaml-paper.ps">ps</a> <a href="http://www.cs.auc.dk/~normark/laml/papers/xmlinlaml-paper.pdf">pdf</a>.</li></ul><h3>September 3, 2002</h3><ul><li>Christian Queinnec. "23 things I know about modules for Scheme". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2002/queinnec-modules.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2002/queinnec-modules.pdf">pdf</a>.</li></ul><h3>August 26, 2002</h3><ul><li>Robert Bruce Findler and Matthias Felleisen. "Contracts for Higher-Order Functions". <em>International Conference on Functional Programming (ICFP2002)</em>. October 2002. Available online: <a href="http://people.cs.uchicago.edu/~robby/pubs/papers/ho-contracts-icfp2002.ps">ps</a> <a href="http://people.cs.uchicago.edu/~robby/publications/papers/ho-contracts-icfp2002.pdf">pdf</a>.</li><li>Matthias Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi. "The Structure and Interpretation of the Computer Science Curriculum". <em>Functional and Declarative Programming in Education (FDPE2002)</em>. October 2002. Available online: <a href="http://people.cs.uchicago.edu/~robby/publications/papers/htdp-sicp-fdpe2002.ps">ps</a> <a href="http://people.cs.uchicago.edu/~robby/publications/papers/htdp-sicp-fdpe2002.pdf">pdf</a>.</li></ul><h3>August 13, 2002</h3><ul><li>Mikael Hansen, Paw Iversen and Jimmy Juncker. "SLAML - Server side LAML". Masters Thesis. Aalborg University. June 2002. Available online: <a href="http://www.cs.auc.dk/library/files/rapbibfiles1/1024042183.ps">ps</a>.</li><li>Carsten Hellegaard. "POWER - Program Oriented Web EngineeRing". Masters Thesis. Aalborg University. June 2000. Available online: <a href="http://www.cs.auc.dk/~normark/laml/reports/samlet-konge.ps">ps</a> <a href="http://www.cs.auc.dk/~normark/laml/reports/samlet-konge.pdf">pdf</a>.</li><li>Matthew Flatt. "Composable and Compilable Macros: You Want it When?". <em>International Conference on Functional Programming (ICFP'2002)</em>. 2002. Available online: <a href="http://www.cs.utah.edu/plt/publications/macromod.pdf">pdf</a>.</li><li>Paul A. Steckler. "Component Support in PLT Scheme". <em>Software Practice and Experience</em>. 32. 10. 2002. </li><li>Guruduth S. Banavar. "An Application Framework For Compositional Modularity". PhD. Thesis. University of Utah. 1995. Available online: <a href="http://citeseer.nj.nec.com/cache/papers/cs/2623/http:zSzzSzwww.cs.utah.eduzSz~banavarzSzthesis.ps.gz/banavar95application.ps.gz">ps</a> <a href="http://citeseer.nj.nec.com/cache/papers/cs/2623/http:zSzzSzwww.cs.utah.eduzSz~banavarzSzthesis.pdf/banavar95application.pdf">pdf</a>.</li><li>Kenjiro Taura, Akinori Yonezawa. "Schematic: A Concurrent Object-Oriented Extension to Scheme". <em>Workshop on Object-Based Parallel and Distributed Computing (OBPDC'96)</em>. 1996. Available online: <a href="http://www.logos.t.u-tokyo.ac.jp/~tau/papers/obpdc-schematic.ps.gz">ps</a>.</li></ul><h3>June 3, 2002</h3><ul><li>Robert Bruce Findler. "Behavioral Software Contracts". PhD. Thesis. Rice University. May 2002. Available online: <a href="http://www.ccs.neu.edu/scheme/pubs/thesis-robby.ps">ps</a> <a href="http://www.ccs.neu.edu/scheme/pubs/thesis-robby.pdf">pdf</a>.</li><li>Paul T. Graunke and Shriram Krishnamurthi. "Advanced Control Flows for Flexible Graphical User Interfaces". <em>International Conference on Software Engineering</em>. 2002. Available online: <a href="http://www.ccs.neu.edu/scheme/pubs/icse2002-gk.ps.gz">ps</a> <a href="http://www.ccs.neu.edu/scheme/pubs/icse2002-gk.pdf.gz">pdf</a>.</li><li>Kurt N&oslash;rmark. "XML in LAML - Web Programming in Scheme". August 2002. Available online: <a href="http://www.cs.auc.dk/~normark/laml/papers/xmlinlaml-paper.ps">ps</a> <a href="http://www.cs.auc.dk/~normark/laml/papers/xmlinlaml-paper.pdf">pdf</a>.</li><li>Kurt N&oslash;rmark. "Development of LAML - A Suite of Web Software for Scheme". May 2002. Available online: <a href="http://www.cs.auc.dk/~normark/laml/papers/scheme2002-paper.ps">ps</a> <a href="http://www.cs.auc.dk/~normark/laml/papers/scheme2002-paper.pdf">pdf</a>.</li></ul><h3>May 26, 2002</h3><ul><li>Timothy J. Hickey. "Incorporating Scheme-based Web Programmming into Computer Literacy Courses". Brandeis University. CS-02-224. April 2002. Available online: <a href="http://www.cs.brandeis.edu/~tim/Papers/icfp2002.ps.gz">ps</a> <a href="http://www.cs.brandeis.edu/~tim/Papers/icfp2002.pdf">pdf</a>.</li><li>Robert H. Halstead. "MULTILISP: a language for concurrent symbolic computation". <em>ACM Transactions on Programming Languages and Systems (TOPLAS)</em>. 7. 4. October 1985. Available online: <a href="http://portal.acm.org/citation.cfm?id=4478&coll=portal">ACM Digital Library</a>.</li><li>David A. Kranz, Robert H. Halstead and Eric Mohr. "Mul-T: a high-performance parallel Lisp". <em>Programming language design and implementation 1989</em>. 1989. Available online: <a href="http://portal.acm.org/citation.cfm?id=74825&dl=ACM&coll=portal">ACM Digital Library</a>.</li><li>Eric Mohr, David A. Kranz and Robert H. Halstead. "Lazy task creation: a technique for increasing the granularity of parallel programs". <em>Proceedings of the 1990 ACM conference on LISP and functional programming</em>. 1990. Available online: <a href="http://portal.acm.org/citation.cfm?id=91631&coll=portal">ACM Digital Library</a>.</li><li>Robert H. Halstead. "Implementation of multilisp: Lisp on a multiprocessor". <em>Proceedings of the 1984 ACM Symposium on LISP and functional programming</em>. 1984. Available online: <a href="http://portal.acm.org/citation.cfm?id=802017&coll=portal">ACM Digital Library</a>.</li><li>Robert H. Halstead and J. Loaiza. "Exception handling in Multilisp". <em>1985 Int. Conf. Parallel Processing</em>. August 1985. </li><li>Robert H. Halstead. "Overview of concert multilisp: a multiprocessor symbolic computing system". 15. 1. March 1987. </li><li>Guy Lewis Steele, Jr.. "Debunking the "Expensive Procedure Call" Myth, or Procedure Call Implementations Considered Harmful, or LAMBDA, the Ultimate GOTO". <em>ACM Conference Proceedings</em>. 1977. Available online: <a href="http://portal.acm.org/citation.cfm?id=810196&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Guy Lewis Steele, Jr.. "Macaroni is Better than Spaghetti". <em>Proceedings of the Symposium on Artificial Intelligence and Programming Languages</em>. August 1977. Available online: <a href="http://portal.acm.org/citation.cfm?id=806933&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Mitchell Wand. "Continuation-Based Program Transformation Strategies". <em>Journal of the ACM</em>. 27. 1. January 1980. Available online: <a href="http://portal.acm.org/citation.cfm?id=322183&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Mitchell Wand and Daniel P. Friedman. "Compiling Lambda Expressions Using Continuations and Factorizations". <em>Journal of Computer Languages</em>. 3. 1978. </li><li>Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Revised Report on Scheme, a Dialect of Lisp". Massachusetts Institute of Technology. MIT AI Memo 452. January 1978. Available online: <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-452.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-452.pdf">pdf</a>.</li><li>Uwe F. Pleban. "The Standard Semantics of a Subset of SCHEME, a Dialect of LISP". University of Kansas. Computer Science Technical Report TR-79-3. July 1979. </li><li>Guy Lewis Steele, Jr.. "Compiler Optimization Based on Viewing LAMBDA as RENAME + GOTO". <em>AI: An MIT Perspective</em>. 1980. </li><li>Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Dream of a Lifetime: a Lazy Variable Extent Mechanism". <em>Conference Record of the 1980 Lisp Conference</em>. 1980. Available online: <a href="http://portal.acm.org/citation.cfm?id=802802&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Dream of a Lifetime: a Lazy Variable Extent Mechanism". 1979. Available online: <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-527.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-527.pdf">pdf</a>.</li><li>Drew McDermott. "An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped Lisp". <em>Conference Record of the 1980 Lisp Conference</em>. 1980. Available online: <a href="http://portal.acm.org/citation.cfm?id=802801&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Steven S. Muchnick and Uwe F. Pleban. "A Semantic Comparison of Lisp and Scheme". <em>Conference Record of the 1980 Lisp Conference</em>. 1980. Available online: <a href="http://portal.acm.org/citation.cfm?id=802790&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Uwe F. Pleban. "A Denotational Approach to Flow Analysis and Optimization of SCHEME, A Dialect of LISP". PhD. Thesis. Ph.D. Dissertation. 1980. </li><li>Mitchell Wand. "Continuation-Based Multiprocessing". <em>Conference Record of the 1980 Lisp Conference</em>. 1980. Available online: <a href="http://portal.acm.org/citation.cfm?id=802786&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Mitchell Wand. "SCHEME Version 3.1 Reference Manual". Indiana University. Computer Science Technical Report 93. June 1980. </li><li>Guy Lewis Steele, Jr. and Gerald Jay Sussman. "Design of a Lisp-based Processor". <em>CACM</em>. 23. 11. November 1980. Available online: <a href="http://portal.acm.org/citation.cfm?id=359031&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Rex A. Dwyer and R. Kent Dybvig. "A SCHEME for Distributed Processes". Indiana University. Computer Science Department Technical Report 107. April 1981. </li><li>Gerald Jay Sussman, Jack Holloway, Guy Lewis Steele, Jr. and Alan Bell. "Scheme-79 - Lisp on a Chip". <em>IEEE Computer</em>. 14. 7. July 1981. </li><li>Gerald Jay Sussman, Jack Holloway, Guy Lewis Steele, Jr. and Alan Bell. "The Scheme-79 Chip". MIT AI Laboratory. AI Memo 559. January 1980. Available online: <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-559.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-559.pdf">pdf</a>.</li><li>John Batali, Edmund Goodhue, Chris Hanson, Howie Shrobe, Richard M. Stallman and Gerald Jay Sussman. "The Scheme-81 Architecture - System and Chip". <em>Proceedings, Conference on Advanced Research in VLSI</em>. 1982. </li><li>Gerald Jay Sussman. "LISP, Programming and Implementation". <em>Functional Programming and its Applications</em>. 1982. </li><li>Pee Hong Chen, W. Y. Chi, Eric M. Ost, L. David Sabbagh and George Springer. "Scheme Graphics Reference Manual". Indiana University . Computer Science Technical Report No. 145. August 1983. </li><li>Pee Hong Chen and Daniel P. Friedman. "Prototyping Data Flow by Translation Into Scheme". Indiana University. Computer Science Technical Report 147. August 1983. </li><li>Carol Fessenden, William D. Clinger, Daniel P. Friedman and Christopher T. Haynes. "Scheme 311 version 4 Reference Manual". Indiana University. Computer Science Technical Report 137. February 1983. </li><li>Daniel P. Friedman, Christopher T. Haynes and Eugene E. Kohlbecker. "Programming with Continuations". <em>Program Transformation and Programming Environments</em>. 1984. </li><li>Christopher T. Haynes and Daniel P. Friedman. "Engines Build Process Abstractions". <em>Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming</em>. 1984. Available online: <a href="http://portal.acm.org/citation.cfm?id=802018&coll=portal">ACM Digital Library</a>.</li><li>Christopher T. Haynes, Daniel P. Friedman and Mitchell Wand. "Continuations and Coroutines". <em>Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming</em>. 1984. Available online: <a href="http://portal.acm.org/citation.cfm?id=802046&coll=portal">ACM Digital Library</a>.</li><li>Daniel P. Friedman and Mitchell Wand. "Reification: Reflection Without Metaphysics". <em>Conference Record of the 1984 ACM Symposium on LISP and Functional Programming</em>. August 1984. Available online: <a href="http://portal.acm.org/citation.cfm?id=802051&coll=portal">ACM Digital Library</a>.</li><li>Guillermo J. Rozas. "Liar, an Algol-like Compiler for Scheme". Massachusetts Institute of Technology. S. B. Thesis. January 1984. </li><li>Richard Schooler and James W. Stamos. "Proposal For a Small Scheme Implementation". Massachusetts Institute of Technology. MIT LCS Memo TM-267. October 1984. </li><li>"MIT Scheme Manual". Massachusetts Institute of Technology. March 2002. Available online: <a href="http://www.swiss.ai.mit.edu/projects/scheme/documentation/scheme.html">html</a>.</li><li>"MacScheme Reference Manual". Semantic Microsystems. 1985. </li><li>William D. Clinger, Daniel P. Friedman and Mitchell Wand. "A Scheme for a Higher-Level Semantic Algebra". <em>Algebraic Methods in Semantics</em>. 1985. </li><li>Amitabh Srivastava, Don Oxley and Aditya Srivastava. "An (other) Integration of Logic and Functional Programming". <em>Proceedings of the Symposium on Logic Programming</em>. 1985. </li><li>Daniel P. Friedman and Christopher T. Haynes. "Constraining Control". <em>Proceedings of the Twelfth Annual Symposium on Principles of Programming Languages</em>. January 1985. </li><li>Pee Hong Chen and L. David Sabbagh. "Scheme as an Interactive Graphics Programming Environment". Indiana University. Computer Science Technical Report No. 166. March 1985. </li><li>Michael A. Eisenberg. "Bochser: An Integrated Scheme Programming System". Massachusetts Institute of Technology. MIT Computer Science Technical Report 349. October 1985. </li><li>Matthias Felleisen. "Transliterating Prolog into Scheme". Indiana University. Computer Science Technical Report 182. October 1985. </li><li>R. Kent Dybvig, Daniel P. Friedman and Christopher T. Haynes. "Expansion-Passing style: Beyond Conventional Macros". <em>Conference Record of the 1986 ACM Conference on Lisp and Functional Programming</em>. 1986. Available online: <a href="http://portal.acm.org/citation.cfm?id=319858&coll=portal">ACM Digital Library</a>.</li><li>Matthias Felleisen and Daniel P. Friedman. "A Closer Look At Export and Import Statements". <em>Journal of Computer Languages</em>. 11. 1. 1986. </li><li>Christopher T. Haynes, Daniel P. Friedman and Mitchell Wand. "Obtaining Coroutines With Continuations". <em>Journal of Computer Languages</em>. 11. 3/4. 1986. </li><li>Mitchell Wand. "Finding the Source of Type Errors". <em>Conference Record of the Thirteenth Annual Symposium on Principles of Programming Languages</em>. 1986. </li><li>Mitchell Wand. "From Interpreter to Compiler: A Representational Derivation". <em>Programs as Data Objects</em>. Lecture Notes in Computer Science. 1986. </li><li>Matthias Felleisen and Daniel P. Friedman. "Control operators, the SECD-machine, and the lambda-calculus". <em>3rd Working Conference on the Formal Description of Programming Concepts</em>. August 1986. </li><li>Mitchell Wand. "The Mystery of the Tower Revealed: a Non-Reflective Description of the Reflective Tower". <em>Proceedings of the 1986 ACM Symposium on LISP and Functional Programming</em>. August 1986. Available online: <a href="http://portal.acm.org/citation.cfm?id=319871&coll=Portal">ACM Digital Library</a>.</li><li>Christopher T. Haynes. "Logic Continuations". <em>Proceedings of the Third International Conference on Logic Programming</em>. July 1986. </li><li>Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker and Bruce F. Duba. "Reasoning with Continuations". <em>Proceedings of the Symposium on Logic in Computer Science</em>. June 1986. </li><li>Kevin J. Lang and Barak A. Pearlmutter. "Oaklisp: an Object-Oriented Scheme with First Class Types". <em>ACM Conference on Object-Oriented Systems, Programming, Languages and Applications</em>. September 1986. Available online: <a href="http://repository.readscheme.org/ftp/papers/pearlmutter/oaklisp-oopsla-1986.pdf">pdf</a> <a href="http://portal.acm.org/citation.cfm?id=28701&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>William D. Clinger. "The Scheme of things: Streams versus Generators". Tektronix, Inc.. Technical Report. 1987. </li><li>Matthias Felleisen. "Reflections on Landin's J-Operator: A Partly Historical Note". <em>Journal of Computer Languages</em>. 12. 3/4. 1987. </li><li>Matthias Felleisen and Daniel P. Friedman. "A Reduction Semantics for Imperative Higher-Order Languages". <em>Parallel Architectures and Languages Europe</em>. 259. 1987. </li><li>Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker and Bruce F. Duba. "A Syntactic Theory of Sequential Control". <em>Theoretical Computer Science</em>. 52. 1987. </li><li>Christopher T. Haynes and Daniel P. Friedman. "Abstracting Timed Preemption with Engines". <em>Journal of Computer Languages</em>. 12. 2. 1987. </li><li>Bruce F. Duba, Matthias Felleisen and Daniel P. Friedman. "Dynamic Identifiers can be Neat". Indiana University. Computer Science Technical Report No. 220. April 1987. </li><li>Matthias Felleisen. "The Calculi of Lambda-v-CS Conversion: A Syntactic Theory of Control And State in Imperative Higher-Order Programming Languages". PhD. Thesis. Computer Science Technical Report 226. (Ph.D. Dissertation). August 1987. Available online: <a href="http://repository.readscheme.org/ftp/papers/felleisen_pdhthesis.pdf">pdf</a>.</li><li>Matthias Felleisen, Daniel P. Friedman, Bruce F. Duba and John Merrill. "Beyond Continuations". Indiana University. Computer Science Dept. Technical Report 216. February 1987. Available online: <a href="http://www.ccs.neu.edu/scheme/pubs/felleisen-beyond.pdf">pdf</a>.</li><li>Matthias Felleisen and Daniel P. Friedman. "A Calculus for Assignments in Higher-Order Languages". <em>Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages</em>. January 1987. Available online: <a href="http://portal.acm.org/citation.cfm?id=41654&dl=Portal">ACM Digital Library</a>.</li><li>Matthias Felleisen and Daniel P. Friedman. "A Syntactic Theory of Sequential State". Indiana University. Computer Science Dept. Technical Report 230. October 1987. </li><li>Christopher T. Haynes and Daniel P. Friedman. "Embedding Continuations in Procedural Objects". <em>ACM Transactions on Programming Languages and Systems</em>. 9. 4. October 1987. Available online: <a href="http://portal.acm.org/citation.cfm?id=30392&coll=Portal">ACM Digital Library</a>.</li><li>Mitchell Wand and Daniel P. Friedman. "The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower". <em>Meta-Level Architectures and Reflection</em>. 1988. </li><li>Hal Abelson and Gerald Jay Sussman. "Lisp: A Language for Stratified Design". <em>BYTE</em>. February 1988. </li><li>William D. Clinger. "Semantics of Scheme". <em>BYTE</em>. February 1988. </li><li>R. Kent Dybvig and Robert Hieb. "A Variable-Arity Procedural Interface". <em>Proceedings of the 1988 ACM Symposium on LISP and Functional Programming</em>. July 1988. Available online: <a href="http://portal.acm.org/citation.cfm?id=62689&coll=Portal">ACM Digital Library</a>.</li><li>John Franco and Daniel P. Friedman. "Creating Efficient Programs by Exchanging Data for Procedures". Indiana University. Computer Science Technical Report 245. March 1988. </li><li>Kevin J. Lang and Barak A. Pearlmutter. "Oaklisp: an Object-Oriented Dialect of Scheme". <em>Lisp and Symbolic Computation: An International Journal</em>. 1. 1. May 1988. Available online: <a href="http://repository.readscheme.org/ftp/papers/pearlmutter/lasc-oaklisp-1988.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/pearlmutter/lasc-oaklisp-1988.pdf">pdf</a>.</li><li>Steven R. Vegdahl and Uwe F. Pleban. "The Runtime Environment for Screme, a Scheme Implementation on the 88000". <em>Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems</em>. April 1989. Available online: <a href="http://portal.acm.org/citation.cfm?id=68199&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>J. Michael Ashley and Richard M. Salter. "A Revised State Space Model for a Logic Programming Embedding in Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Olivier Danvy. "Programming with Tighter Control". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Olivier Danvy. "Combiner Logiquement en Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Vincent Delacour. "Picolo Expresso". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Alain Deutsch, Renaud Dumeur, Charles Consel and Jean-Daniel Fekete. "CSKIM: An Extended Dialect of Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Simon M. Kaplan and Joseph P. Loyall. "GARP/Scheme: Implementing a Concurrent, Object-Based Language". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Tan Gon Kim and Bernard P. Zeigler. "The DEVS-Scheme Modelling and Simulation Environment". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Guy Lapalme and Marc Feeley. "Micro-Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Julia L. Lawall and Daniel P. Friedman. "Embedding the Self Language in Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Andr&eacute;a Pic and Michel Briand. "Visual Programming with Generators". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>J. C. Royer, J. P. Braquelaire, P. Casteran, M. Desainte-Catherine and J. G. Penaud. "Le modo'e(ga'le OBJScheme: principes et applications". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Robert Strandh. "OOOZ, A multi-User Programming Environment Based on Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Nitsan S&eacute;niak. "Compilation de Scheme par sp&eacute;cialisation explicite". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>John Wade Ulrich. "Enumeration Algorithms and Non-deterministic Programming in Scheme". <em>BIGRE Bulletin</em>. 65. July 1989. </li><li>Williams Ludwell Harrison III. "The Interprocedural Analysis and Automatic Parallellization of Scheme Programs". <em>Lisp and Symbolic Computation: An International Journal</em>. 2. 3/4. October 1989. Available online: .</li><li>John Franco and Daniel P. Friedman. "Towards A Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme". <em>Journal of Computer Languages</em>. 15. 1. 1990. </li><li>John Franco, Daniel P. Friedman and Steven D. Johnson. "Multi-way Streams in Scheme". <em>Journal of Computer Languages</em>. 15. 2. 1990. Available online: <a href="http://gauss.ececs.uc.edu/Reports/limptop.ps">ps</a>.</li><li>Dorai Sitaram and Matthias Felleisen. "Control Delimiters and Their Hierarchies". <em>Lisp and Symbolic Computation: An International Journal</em>. 3. 1. January 1990. Available online: .</li><li>Chris Hanson. "Efficient Stack Allocation for Tail-Recursive Languages". <em>Proceedings of the 1990 ACM Conference on Lisp and Functional Programming</em>. June 1990. Available online: <a href="http://portal.acm.org/citation.cfm?id=91603&coll=Portal">ACM Digital Library</a>.</li><li>Morry Katz and Daniel Weise. "Continuing Into the Future: On the Interaction of Futures and First-Class Continuations". <em>Proceedings of the 1990 ACM Conference on Lisp and Functional Programming</em>. June 1990. Available online: <a href="http://portal.acm.org/citation.cfm?id=91628&coll=Portal">ACM Digital Library</a>.</li><li>Dan Teodosiu. "HARE: A Compiler for Scheme". Masters Thesis. Master's Thesis. June 1990. </li><li>Pierre Bonzon. "A Metacircular Evaluator for a Logical Extension of Scheme". <em>Lisp and Symbolic Computation: An International Journal</em>. 3. 2. March 1990. Available online: .</li><li>R. Kent Dybvig and Robert Hieb. "Continuations and Concurrency". <em>Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</em>. March 1990. Available online: <a href="http://portal.acm.org/citation.cfm?id=99178&coll=Portal">ACM Digital Library</a>.</li><li>Alessandro Forin. "Futures". <em>Topics in Advanced Language Implementation</em>. 1991. </li><li>James S. Miller and Guillermo J. Rozas. "Free Variables and First-Class Environments". <em>Lisp and Symbolic Computation: An International Journal</em>. 3. 4. 1991. </li><li>Barak A. Pearlmutter and Kevin J. Lang. "The Implementation of Oaklisp". <em>Topics in Advanced Language Implementation</em>. 1991. </li><li>Uwe F. Pleban. "Compilation Issues in the Screme Implementation for the 88000". <em>Topics in Advanced Language Implementation</em>. 1991. </li><li>Dorai Sitaram and Matthias Felleisen. "Modeling Continuations Without Continuations". <em>Proceedings of the Eighteenth ACM Symposium on Principles of Programming Languages</em>. 1991. Available online: <a href="http://portal.acm.org/citation.cfm?id=99611&coll=portal&dl=ACM">ACM Digital Library</a>.</li><li>Brian Beckman. "A Scheme for Little Languages in Interactive Graphics". <em>Software-Practice and Experience</em>. 21. 2. Feb 1991. </li><li>Dan Teodosiu. "HARE: An Optimizing Portable Compiler for Scheme". <em>ACM Sigplan Notices</em>. 26. 1. Jan 1991. Available online: <a href="http://www-flash.stanford.edu/~dant/papers/hare.ps.Z">ps</a> <a href="http://citeseer.nj.nec.com/rd/2643588%2C30693%2C1%2C0.25%2CDownload/http%3A%252F%252Fciteseer.nj.nec.com%252Fcache%252Fpapers%252Fcs%252F5642%252Fhttp%253AzSzzSzwww-flash.stanford.eduzSz%257EdantzSzpaperszSzhare.pdf/hare-an-optimizing-portable.pdf">pdf</a>.</li><li>Chris Hanson. "A Syntactic Closures Macro Facility". <em>Lisp Pointers</em>. IV. 4. October-December 1991. Available online: <a href="http://www.swiss.ai.mit.edu/ftpdir/users/cph/macros/prop.ps.gz">ps</a>.</li><li>Fritz Henglein. "Global Tagging Optimization by Type Inference". <em>Proceedings of the 1992 ACM Conference on Lisp and Functional Programming</em>. June 1992. Available online: <a href="http://portal.acm.org/citation.cfm?id=141542&coll=Portal">ACM Digital Library</a>.</li><li>Fritz Henglein and Jakob Rehof. "Safe polymorphic type inference for a Dynamically Typed Language: Translating Scheme to ML". <em>ACM Conference on Functional Programming Languages and Computer Architecture (FPCA'95)</em>. 1995. Available online: <a href="http://citeseer.nj.nec.com/rd/2643588%2C140352%2C1%2C0.25%2CDownload/http%253A%252F%252Fciteseer.nj.nec.com/compress/0/papers/cs/7451/http%253AzSzzSzresearch.microsoft.comzSz%257ErehofzSzfpca95.ps.gz/henglein95safe.ps">ps</a> <a href="http://citeseer.nj.nec.com/rd/2643588%2C140352%2C1%2C0.25%2CDownload/http%253A%252F%252Fciteseer.nj.nec.com/cache/papers/cs/7451/http%253AzSzzSzresearch.microsoft.comzSz%257ErehofzSzfpca95.pdf/henglein95safe.pdf">pdf</a>.</li><li>Rajeev J. Surati. "Practical Partial Evaluation". Masters Thesis. Massachussets Institute of Technology. May 1995. Available online: <a href="http://repository.readscheme.org/ftp/papers/surati-smthesis.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/surati-smthesis.pdf">pdf</a>.</li></ul><h3>April 11, 2002</h3><ul><li>Kurt N&oslash;rmark. "Web Programming in Scheme - the LAML approach". April 2002. Available online: <a href="http://www.cs.auc.dk/~normark/laml/papers/long-laml-approach.ps">ps</a> <a href="http://www.cs.auc.dk/~normark/laml/papers/long-laml-approach.pdf">pdf</a> <a href="http://www.cs.auc.dk/~normark/scheme/examples/jfp/index.html">examples</a>.</li><li>Olin Shivers. "History of T". 2001. Available online: <a href="http://www.paulgraham.com/thist.html">html</a>.</li></ul><h3>March 29, 2002</h3><ul><li>Manuel Serrano and Erick Gallesio. "This is Scribe!". <em>Workshop on Scheme and Functional Programming (2002)</em>. October 2002. Available online: <a href="http://www-sop.inria.fr/mimosa/fp/Scribe/doc/scribe.ps">ps</a> <a href="http://www-sop.inria.fr/mimosa/Manuel.Serrano/scribe/doc/scribe.html">html</a>.</li></ul><h3>March 14, 2002</h3><ul><li>Kurt N&oslash;rmark. "Programmatic WWW authoring using Scheme and LAML". <em>WWW2002: The Eleventh International World Wide Web Conference</em>. March 2002. Available online: <a href="http://www.cs.auc.dk/~normark/laml/papers/www2002/p296-normark.html">html</a>.</li></ul><h3>March 6, 2002</h3><ul><li>Oleg Kiselyov. "The SXML Specification, Revision 2.5". September 2002. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/SXML.html">html</a>.</li></ul><h3>February 20, 2002</h3><ul><li>Daniel P. Friedman. "Applications of Continuations: Invited Tutorial". <em>1988 Principles of Programming Languages (POPL88)</em>. January 1988. Available online: <a href="http://www.cs.indiana.edu/hyplan/dfried/appcont.ps">ps</a> <a href="http://www.cs.indiana.edu/hyplan/dfried/appcont.pdf">pdf</a>.</li><li>Olivier Danvy and Andrzej Filinski. "A Functional Abstraction of Typed Contexts". DIKU. DIKU Rapport 89/12. July 1989. Available online: <a href="http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz">ps</a>.</li><li>Olivier Danvy and Andrzej Filinski. "Abstracting Control". <em>1990 ACM Conference on Lisp and Functional Programming</em>. September 1990. Available online: <a href="ftp://ftp.daimi.au.dk/pub/empl/danvy/Papers/danvy-filinski-lfp90.ps.gz">ps</a>.</li><li>Michael Sperber. "Computer-Assisted Lighting Design and Control". PhD. Thesis. University of T&uuml;bingen. June 2001. Available online: <a href="http://w210.ub.uni-tuebingen.de/dbt/volltexte/2001/266/pdf/lula-thesis.pdf">ps</a>.</li></ul><h3>February 10, 2002</h3><ul><li>Kenichi Asai, Hidehiko Masuhara and Akinori Yonezawa. "Partial Evaluation of Call-by-value Lambda-calculus with Side-effects". <em>ACM SIGPLAN Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97)</em>. June 1997. Available online: <a href="http://pllab.is.ocha.ac.jp/~asai/papers/pepm97.ps.gz">ps</a>.</li><li>Kenichi Asai, Hidehiko Masuhara and Akinori Yonezawa. "Partial Evaluation of Call-by-value lambda-calculus with Side-effects". University of Tokyo. 96-04. November 1996. Available online: <a href="http://www.is.s.u-tokyo.ac.jp/tech-reports/TR96-04-a4.ps.gz">ps</a>.</li><li>Kenichi Asai, S. Matsuoka and Akinori Yonezawa. "Duplication and Partial Evaluation - For a Better Understanding of Reflective Languages". <em>Lisp and Symbolic Computation</em>. Vol. 9, Nos. 2/3. May/June 1996. Available online: <a href="http://pllab.is.ocha.ac.jp/~asai/papers/lasc96-letter.ps.gz">ps</a>.</li><li>Kenichi Asai, Hidehiko Masuhara, S. Matsuoka and Akinori Yonezawa. "Partial evaluation as a compiler for reflective languages". University of Tokyo. 95-10. December 1995. Available online: <a href="http://www.is.s.u-tokyo.ac.jp/tech-reports/TR95-10-a4.ps.gz">ps</a>.</li><li>Kenichi Asai, S. Matsuoka and Akinori Yonezawa. "Roles of a Partial Evaluator for the Reflective Language Black". University of Tokyo. 94-11. May 1994. Available online: <a href="http://www.is.s.u-tokyo.ac.jp/tech-reports/TR94-11-letter.ps.gz">ps</a>.</li><li>Peter &Oslash;rb&aelig;k. "POPE: An On-line Partial Evaluator". University of Aarhus. June 1994. Available online: <a href="ftp://ftp.daimi.au.dk/pub/empl/poe/pope.ps.gz">ps</a>.</li><li>Michael Sperber and Peter Thiemann. "The Essence of LR Parsing". <em>Partial Evaluation and Semantics-Based Program Manipulation PEPM '95</em>. June 1995. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/pepm95.ps.gz">ps</a>.</li><li>Peter Thiemann and Robert Gl&uuml;ck. "The Generation of a Higher-Order Online Partial Evaluator". <em>Fuji Workshop on Functional and Logic Programming</em>. July 1995. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/fuji95.ps.gz">ps</a>.</li><li>Michael Sperber, Robert Gl&uuml;ck and Peter Thiemann. "Bootstrapping Higher-Order Program Transformers from Interpreters". <em>Proceedings 11th Annual ACM Symposium on Applied Computing, SAC (SAC '96)</em>. February 1996. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/bootstrap-transformers.ps.gz">ps</a>.</li><li>Peter Thiemann. "Cogen in Six Lines". <em>Proc. ACM SIGPLAN International Conference on Functional Programming 1996</em>. May 1996. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/icfp96.ps.gz">ps</a>.</li><li>Michael Sperber and Peter Thiemann. "Realistic Compilation by Partial Evaluation". <em>Proc. of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation</em>. May 1996. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/realistic.ps.gz">ps</a>.</li><li>Peter Thiemann. "Towards Partial Evaluation of Full Scheme". <em>Reflection'96</em>. April 1996. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/reflection96.ps.gz">ps</a>.</li><li>Peter Thiemann and Michael Sperber. "Polyvariant Expansion and Compilergenerators". <em>PSI-96: Andrei Ershov Second International Memorial Conference, Perspectives of System Informatics</em>. June 1996. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/poly.ps.gz">ps</a>.</li><li>Peter Thiemann. "Implementing Memoization for Partial Evaluation". <em>Programming Languages, Implementations, Logics, and Programs (PLILP '96)</em>. volume 1140 of Lecture Notes in Computer Science. September 1996. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/memoization.ps.gz">ps</a>.</li><li>Michael Sperber and Peter Thiemann. "Two for the Price of One: Composing Partial Evaluation and Compilation". <em>Proc. of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation</em>. June 1997. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/compose.ps.gz">ps</a>.</li><li>Michael Sperber, Peter Thiemann and Herbert Klaeren. "Distributed Partial Evaluation". <em>Proc. of the Second International Symposium on Parallel Symbolic Computation, PASCO'97</em>. July 1997. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/distpe.ps.gz">ps</a>.</li><li>Simon Helsen and Peter Thiemann. "Two Flavors of Offline Partial Evaluation". <em>Asian Computing Science Conference, ASIAN'98</em>. December 1998. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/flavors.ps.gz">ps</a>.</li><li>Peter Thiemann. "Higher-Order Code Splicing". <em>European Symposium on Programming, ESOP '99</em>. volume 1576 of Lecture Notes in Computer Science. March 1999. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/esop99.ps.gz">ps</a>.</li><li>Peter Thiemann and Dirk Dussart. "Partial Evaluation for Higher-Order Languages with State". July 1999. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/mlpe.ps.gz">ps</a>.</li><li>Peter Thiemann. "The PGG System - User Manual". University at Freiburg. March 2000. Available online: <a href="http://www.informatik.uni-freiburg.de/proglang/software/pgg/pgg-manual.ps.gz">ps</a> <a href="http://www.informatik.uni-freiburg.de/proglang/software/pgg/pgg-manual.html">html</a>.</li><li>Peter Thiemann. "Compiling Adaptive Programs by Partial Evaluation". <em>CC 2000</em>. volume 1781 of Lecture Notes in Computer Science. March 2000. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/compile.ps.gz">ps</a>.</li><li>Simon Helsen and Peter Thiemann. "Fragmental Specialization". <em>Semantics, Applications and Implementation of Program Generation (SAIG'00)</em>. volume 1927 of Lecture Notes in Computer Science. September 2000. Available online: <a href="http://www.informatik.uni-freiburg.de/~thiemann/papers/saig2000.ps.gz">ps</a>.</li></ul><h3>February 9, 2002</h3><ul><li>Mikael Hansen, Paw Iversen and Jimmy Juncker. "SLAML - Server side LAML (Preliminary Masters Thesis Report)". Aalborg University. January 2002. Available online: <a href="http://www.cs.auc.dk/library/files/rapbibfiles1/1010132379.ps">ps</a>.</li><li>Scott G. Miller. "SISC: A Complete Scheme Interpreter in Java". January 2002. Available online: <a href="http://sisc.sourceforge.net/sisc.ps.gz">ps</a> <a href="http://sisc.sourceforge.net/sisc.pdf">pdf</a>.</li><li>Kurt N&oslash;rmark. "Simulation of Object-oriented Concepts and Mechanisms in Scheme". Aalborg University. R-90-01. 1990. Available online: <a href="http://www.cs.auc.dk/~normark/scheme-oop/scheme-oop.ps">ps</a>.</li><li>Jonathan A. Rees, Norman I. Adams IV and James R. Meehan. "The T manual". Yale University Computer Science Department. 1984. Available online: <a href="ftp://ftp.cs.indiana.edu/pub/scheme-repository/imp/t/manual.gz">text</a> <a href="http://repository.readscheme.org/ftp/papers/t_manual.pdf">pdf</a>.</li></ul><h3>February 2, 2002</h3><ul><li>Oleg Kiselyov. "The SXML Specification, Revision 2.5". September 2002. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/SXML.html">html</a>.</li><li>Oleg Kiselyov. "Literate XML/DTD programming". April 2001. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/xml.html#literate-DTD">html</a>.</li><li>Oleg Kiselyov. "HTML/XML authoring in Scheme". February 2001. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/xml.html#XML-authoring">html</a>.</li></ul><h3>January 30, 2002</h3><ul><li>Oleg Kiselyov. "A better XML parser through functional programming". <em>Fourth International Symposium on Practical Aspects of Declarative Languages (PADL '02)</em>. January 2002. Available online: <a href="http://pobox.com/~oleg/ftp/papers/XML-parsing.ps.gz">ps</a> <a href="http://pobox.com/~oleg/ftp/papers/XML-parsing-talk.ps.gz">slides</a>.</li><li>Oleg Kiselyov. "Re-writing abstractions, or Lambda: the ultimate pattern macro". December 2001. Available online: <a href="http://pobox.com/~oleg/ftp/Computation/rewriting-rule-lambda.txt">html</a>.</li><li>Oleg Kiselyov. "Monadic Programming in Scheme". January 2002. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/monad-in-Scheme.html">html</a>.</li></ul><h3>January 23, 2002</h3><ul><li>Fr&eacute;d&eacute;ric Peschanski, Christian Queinnec and Jean-Pierre Briot. "A typeful composition model for dynamic software architectures". July 2001. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/scope-report2001.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/scope-report2001.pdf">pdf</a>.</li></ul><h3>January 15, 2002</h3><ul><li>Christian Queinnec. "Continuations and conversations". <em>9th International Conference, AIMSA 2000</em>. number 1904 in Lecture Notes in Artificial Intelligence. September 2000. </li><li>Christian Queinnec. "Fast and compact dispatching for dynamic object-oriented languages". <em>Information Processing Letters</em>. 64(6). January 1998. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/dispatch.ps.gz">ps</a>.</li><li>Christian Queinnec and David DeRoure. "Sharing code through first-class environments". <em>Proceedings of ICFP'96 International Conference on Functional Programming</em>. May 1996. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/modenv.ps.gz">ps</a>.</li><li>Christian Queinnec. "Macroexpansion reflective tower". <em>Proceedings of the Reflection'96 Conference</em>. April 1996. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/towexp.ps.gz">ps</a>.</li><li>Christian Queinnec and Pierre Weis. "Programmation applicative, &eacute;tat des lieux et perspectives". <em>Technique et science informatiques</em>. 15(7). 1996. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/langappl.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/langappl.pdf">pdf</a>.</li><li>Sophie Anglade, Jean-Jacques Lacrampe and Christian Queinnec. "Semantics of combinations in scheme". <em>Lisp Pointers</em>. 7(4). October-December 1995. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/orleans.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/orleans.pdf">pdf</a>.</li><li>Christian Queinnec. "Locality, causality and continuations". <em>LFP '94 - ACM Symposium on Lisp and Functional Programming</em>. June 1994. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/lcc.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/lcc.pdf">pdf</a>.</li><li>Christian Queinnec. "A library of high-level control operators". <em>Lisp Pointers</em>. 6(4). October 1993. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/contlib.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/contlib.pdf">pdf</a>.</li><li>Christian Queinnec. "Continuation conscious compilation". <em>Lisp Pointers</em>. 6(1). January 1993. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/ccc.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/ccc.pdf">pdf</a>.</li><li>Christian Queinnec. "Literate programming from scheme to TEX". Laboratoire d'Informatique de l'&Eacute;cole Polytechnique. Research Report LIX RR 93.05. November 1993. </li><li>Christian Queinnec. "Designing MEROON v3". <em>Object-Oriented Programming in Lisp: Languages and Applications</em>. September 1993. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/oopil.ps.gz">ps</a>.</li><li>Christian Queinnec and Jean-Marie Geffroy. "Partial evaluation applied to symbolic pattern matching with intelligent backtrack". <em>WSA '92--Workshop on Static Analysis</em>. September 1992. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/pewib.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/pewib.pdf">pdf</a>.</li><li>Christian Queinnec. "Value transforming style". <em>WSA '92--Workshop on Static Analysis</em>. September 1992. Available online: .</li><li>Christian Queinnec. "Value transforming style". Laboratoire d'Informatique de l'&Eacute;cole Polytechnique. Research Report LIX RR 92/07. May 1992. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/vts.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/vts.pdf">pdf</a>.</li><li>Christian Queinnec. "Continuation sensitive compilation". Laboratoire d'Informatique de l'&Eacute;cole Polytechnique. Research Report LIX RR 92/14. November 1992. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/csc.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/csc.pdf">pdf</a>.</li><li>Christian Queinnec and Bernard Serpette. "A Dynamic Extent Control Operator for Partial Continuations". <em>POPL '91 - Eighteenth Annual ACM symposium on Principles of Programming Languages</em>. January 1991. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/popl6.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/popl6.pdf">pdf</a>.</li><li>Christian Queinnec and Julian Padget. "Modules, macros and Lisp". <em>Eleventh International Conference of the Chilean Computer Science Society</em>. October 1991. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/chili.ps.gz">ps</a>.</li><li>Christian Queinnec and Julian Padget. "A proposal for a modular Lisp with macros and dynamic evaluation". <em>Journ&eacute;es de Travail sur l'Analyse Statique en Programmation &Eacute;quationnelle, Fonctionnelle et Logique</em>. October 1991. Available online: .</li><li>Christian Queinnec. "MEROON: A small, efficient and enhanced object system". &Eacute;cole Polytechnique. Technical Report LIX.RR.92.14. November 1991. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Reports/MeroonV3.ps.gz">ps</a>.</li><li>Christian Queinnec. "Struggle, The First Denotational Game". <em>EuroPal '90 - European Conference on Lisp and its Practical Applications</em>. March 1990. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/strugman.ps.gz">ps</a>.</li><li>Christian Queinnec and Julian Padget. "A deterministic model for modules and macros". University of Bath. Bath Computing Group Technical Report 90-36. 1990. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/modmac2.ps.gz">ps</a>.</li><li>Christian Queinnec. "Compilation of Non-Linear, Second Order Patterns on S-Expressions". <em>International Workshop PLILP '90 - Programming Language: Implementation and Logic Programming</em>. Lecture Notes in Computer Science 456. August 1990. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/csm.ps.gz">ps</a>.</li><li>Christian Queinnec. "Validation Suite Generation". <em>Revue Bigre+Globule</em>. (65). July 1989. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/vsg.ps.gz">ps</a>.</li><li>Suresh Jagannathan and Andrew K. Wright. "Polymorphic Splitting: An Effective Polyvariant Flow Analysis". <em>ACM Transactions on Programming Languages and Systems</em>. March 1998. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/toplas98.ps.gz">ps</a>.</li><li>Suresh Jagannathan and Andrew K. Wright. "Flow-Directed Inlining". <em>ACM Symposium on Programming Language Design and Implementation (PLDI96)</em>. May 1996. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/pldi96.ps.gz">ps</a>.</li><li>Suresh Jagannathan and Andrew K. Wright. "Compiling with Flow Analysis". <em>ACM Computing Surveys</em>. June 1996. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/survey96.ps.gz">ps</a>.</li><li>Suresh Jagannathan and Andrew K. Wright. "Effective Flow Analysis for Avoiding Runtime Checks". <em>2nd International Static Analysis Symposium</em>. LNCS 983. September 1995. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/sas95.ps.gz">ps</a>.</li><li>Suresh Jagannathan and Andrew K. Wright. "Flow-Directed Inlining". <em>ACM Symposium on Programming Language Design and Implementation (PLDI96)</em>. May 1996. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/pldi96.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Meta-Level Building Blocks for Modular Systems". <em>ACM Transactions on Programming Languages and Systems</em>. May 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/toplas94.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Dynamic Modules in Higher-Order Languages". <em>IEEE International Conference on Computer Languages</em>. May 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/iccl94.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Reflective Building Blocks for Modular Systems". <em>International Workshop on Reflection and Meta-Level Architectures</em>. November 1992. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/reflect92.ps.gz">ps</a>.</li><li>Suresh Jagannathan and Gul Agha. "A Reflective Model of Inheritance". <em>European Conference on Object-Oriented Programming (ECOOP 92)</em>. LNCS 615. June 1992. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/ecoop92.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Customization of First-Class Tuple-Spaces in a Higher-Order Language". <em>Parallel Languages and Architectures</em>. LNCS 506. June 1991. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/parle91.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Optimizing Analysis for First-Class Tuple-Spaces". <em>3rd Workshop on Parallel Languages and Compilers</em>. August 1990. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/plc91.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Coercion as a Metaphor for Computation". <em>IEEE International Conference on Computer Languages</em>. August 1990. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/iccl90.ps.gz">ps</a>.</li><li>Suresh Jagannathan, David Gelernter and Tom London. "Environments as First-Class Objects". <em>ACM Conference on Principles of Programming Languages (POPL87)</em>. January 1987. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/popl87.ps.gz">ps</a>.</li><li>Luc Moreau and Christian Queinnec. "Partial Continuations as the Difference of Continuations". <em>International Conference on Programming Language Implementation and Logic Programming (PLILP'94)</em>. number 844 in Lecture Notes in Computer Science. September 1994. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/pc.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/pc.pdf">pdf</a>.</li><li>Luc Moreau. "A Syntactic Theory of Dynamic Binding". University of Southampton. Technical Report M96/4. 1996. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/dyn.ps.gz">ps</a>.</li><li>Luc Moreau. "A Syntactic Theory of Dynamic Binding". <em>International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97)</em>. volume 1214 of Lecture Notes in Computer Science. April 1997. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/tapsoft97.ps.gz">ps</a>.</li><li>Luc Moreau, Daniel Ribbens and Pascal Gribomont. "Advanced Programming Techniques Using Scheme". <em>Journ&eacute;es Francophones des Languages Applicatifs, Collection Didactique</em>. February 1998. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/jfla98.ps.gz">ps</a>.</li><li>Luc Moreau. "A Syntactic Theory of Dynamic Binding". <em>Higher-Order and Symbolic Computation</em>. 11(3):233-279. December 1998. </li></ul><p><img width="1" height="40" border="0" src="./imgs/dot_clear.gif" /></p><div class="collophon" align="right">Hosted by <a href="http://concurrency.cc">concurrency.cc</a>.<p />Last modified: Saturday, August 11th, 2012 4:55:45pm<br />HTML generated using <a href="http://celtic.benderweb.net/webit/">WebIt!</a>.</div></td></tr></table></body></html>