1 line
33 KiB
HTML
1 line
33 KiB
HTML
<html><head><title>Archived 2001 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 2001 Additions</h2><h3>December 20, 2001</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>Luc Moreau. "Programming in a Parallel Functional Language with Continuations". <em>Avancées Applicatives. Journées Francophones des Langages Applicatifs (JFLA'92)</em>. volume 76-77. February 1992. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/jfla92.ps.gz">ps</a>.</li><li>Luc Moreau. "An Operational Semantics for a Parallel Language with Continuations". <em>Parallel Architectures and Languages Europe (PARLE'92)</em>. number 605 in Lecture Notes in Computer Science. June 1992. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/parle92.ps.gz">ps</a>.</li><li>Luc Moreau and Daniel Ribbens. "Sound Rules for Parallel Evaluation of a Functional Language with callcc". <em>ACM conference on Functional Programming and Computer Architecture (FPCA'93)</em>. June 1993. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/fpca93.ps.gz">ps</a>.</li><li>Luc Moreau. "The PCKS-machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations". <em>European Symposium on Programming (ESOP'94)</em>. number 788 in Lecture Notes in Computer Science. April 1994. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/esop94.ps.gz">ps</a>.</li><li>Luc Moreau. "Sound Evaluation of Parallel Functional Programs with First-Class Continuations". PhD. Thesis. University of Liège. June 1994. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/thesis-moreau.ps.gz">ps</a>.</li><li>Luc Moreau. "The Semantics of Scheme with Future". University of Southampton. Technical Report M95/7. 1995. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/future.ps.gz">ps</a>.</li><li>Luc Moreau. "A Parallel Functional Language with First-Class Continuations (Programming Style and Semantics)". <em>Computers and Artificial Intelligence</em>. 14(2). 1995. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/caai.ps.gz">ps</a>.</li><li>Luc Moreau. "Non-speculative and Upward Invocation of Continuations in a Parallel Language". <em>International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95)</em>. number 915 in Lecture Notes in Computer Science. May 1995. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/tapsoft95.ps.gz">ps</a>.</li><li>Luc Moreau and Daniel Ribbens. "The Semantics of pcall and fork". <em>PSLS 95 - Parallel Symbolic Langages and Systems</em>. number 1068 in Lecture Notes in Computer Science. October 1995. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/psls95.ps.gz">ps</a>.</li><li>Luc Moreau. "The Semantics of Future in the Presence of First-Class Continuations and Side-effects". University of Southampton. Technical Report M95/3. November 1995. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/tech95-3.ps.gz">ps</a>.</li><li>Luc Moreau. "Correctness of a Distributed-Memory Model for Scheme". University of Southampton. Technical Report M96/3. 1996. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/tech963.ps.gz">ps</a>.</li><li>Luc Moreau. "The Semantics of Scheme with Future". <em>ACM SIGPLAN International Conference on Functional Programming (ICFP'96)</em>. May 1996. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/icfp96.ps.gz">ps</a>.</li><li>Luc Moreau. "Continuing into the Future: the Return (Invited Paper)". <em>8th International Conference in Systems Research Informatics and Cybernetics (InterSymp'96)</em>. August 1996. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/intersymp96.ps.gz">ps</a>.</li><li>Luc Moreau. "Correctness of a Distributed-Memory Model for Scheme". <em>Second International Europar Conference (EURO-PAR'96)</em>. number 1123 in Lecture Notes in Computer Science. August 1996. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/europar96.ps.gz">ps</a>.</li><li>Luc Moreau and David DeRoure. "A Distributed Garbage Collector for NeXeme". University of Southampton. 1997. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/rj97.ps.gz">ps</a>.</li><li>Luc Moreau and Christian Queinnec. "On the Finiteness of Resources in Distributed Computing". INRIA. Research Report RR-3147. April 1997. Available online: <a href="ftp://ftp.inria.fr/INRIA/publication/RR/RR-3147.ps.gz">ps</a> <a href="ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-3147.pdf">pdf</a>.</li><li>Luc Moreau, David DeRoure and Ian Foster. "NeXeme: a Distributed Scheme Based on Nexus". <em>Third International Europar Conference (EURO-PAR'97)</em>. volume 1300 of Lecture Notes in Computer Science. August 1997. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/rsr-europar97.ps.gz">ps</a>.</li><li>Luc Moreau and Christian Queinnec. "Design and Semantics of Quantum: a Language to Control Resource Consumption in Distributed Computing". <em>Usenix Conference on Domain-Specific Languages (DSL'97)</em>. October 1997. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/dsl97.ps.gz">ps</a>.</li><li>Luc Moreau. "NeXeme: A Distributed Scheme Based on Nexus (Reference Manual and User's Guide)". University of Southampton. Technical Report M97/8. November 1997. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/NeXeme/man/ug.ps">ps</a>.</li><li>Luc Moreau and Christian Queinnec. "Distributed Computations Driven by Resource Consumption". <em>IEEE International Conference on Computer Languages (ICCL'98)</em>. May 1998. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/iccl98.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/iccl98.pdf">pdf</a>.</li><li>Luc Moreau. "A Distributed Garbage Collector with Diffusion Tree Reorganisation and Object Mobility". <em>Proceedings of the Third International Conference of Functional Programming (ICFP'98)</em>. September 1998. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/icfp98.ps.gz">ps</a>.</li><li>Luc Moreau. "Hierarchical Distributed Reference Counting". <em>Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98)</em>. October 1998. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/ismm98.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Communication-Passing Style for Coordination Languages". <em>2nd International Conference on Coordination Models and Languages</em>. Springer-Verlag LNCS 1282. September 1997. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/coord97.ps.gz">ps</a>.</li><li>Suresh Jagannathan, Henry Cejtin, Richard A. Kelsey. "Higher-Order Distributed Objects". <em>ACM Transactions on Programming Languages and Systems</em>. September 1995. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/toplas95.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Virtual Topologies: A New Concurrency Abstraction for High-Level Parallel Programs". <em>5th Workshop on Languages and Compilers for Parallel Computing</em>. September 1995. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/plc95.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "TS-Scheme: Distributed Data Structures in Lisp". <em>Lisp and Symbolic Computation</em>. December 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/lasc94-1.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Locality Abstractions for Parallel and Distributed Computing". <em>International Conference on Theory and Practice of Parallel Programming</em>. Springer-Verlag LNCS 907. November 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/tppp94.ps.gz">ps</a>.</li><li>Suresh Jagannathan, James Philbin. "High-Level Abstractions for Efficient Concurrent Systems". <em>International Conference on Programming Languages and Systems Architecture</em>. Springer-Verlag LNCS 782. March 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/plsa94.ps.gz">ps</a>.</li><li>Suresh Jagannathan, Stephen Weeks and James Philbin. "A Concurrent Abstract Interpreter". <em>Lisp and Symbolic Computation</em>. April 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/lasc94-2.ps.gz">ps</a>.</li><li>Suresh Jagannathan, Stephen Weeks. "Analyzing Stores and References in Parallel Symbolic Languages". <em>ACM Symposium on Lisp and Functional Programming (LFP94)</em>. June 1994. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/lfp94.ps.gz">ps</a>.</li><li>James Philbin. "An Overview of the Sting Operating System". <em>Proceedings of the 4th NEC Software Conference</em>. October 1992. Available online: <a href="ftp://ftp.nj.nec.com/pub/pls/nec92.ps">ps</a>.</li><li>James Philbin. "Customizable Policy Management in the Sting Operating System". <em>US/Japan Workshop on Parallel Symbolic Computing, Springer-Verlag LNCS 748</em>. October 1992. </li><li>Suresh Jagannathan, James Philbin. "A Customizable Substrate for Concurrent Languages". <em>ACM Conference on Programming Language Design and Implementation (PLDI92)</em>. June 1992. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/pldi92.ps.gz">ps</a>.</li><li>Suresh Jagannathan, James Philbin. "A Foundation for an Efficient Multi-Threaded Scheme System". <em>ACM Conference on Lisp and Functional Programming (LFP92)</em>. June 1992. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/lfp92.ps.gz">ps</a>.</li><li>Suresh Jagannathan. "Expressing Fine-Grained Parallelism Using Distributed Data Structures". <em>Workshop on Research Directions in High-Level Parallel Languages</em>. Springer-Verlag LNCS 574. June 1991. Available online: <a href="http://www.cs.purdue.edu/homes/suresh/papers/hlpl91.ps.gz">ps</a>.</li><li>Christian Queinnec. "Distributed generic functions". <em>Object-Oriented Parallel and Distributed Programming</em>. 2000. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/gendist.ps.gz">ps</a>.</li><li>Christian Queinnec. "Marshaling/unmarshaling as a compilation/interpretation process". <em>Symposium IPPS/SPDP 1999 - 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</em>. April 1999. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/marshort.ps.gz">ps</a>.</li><li>Christian Queinnec. "DMeroon A Distributed Class-based Causally-Coherent Data Model - General documentation". Rapport LIP6 1998/039. 1998. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Reports/dmeroon.ps.gz">ps</a>.</li><li>Christian Queinnec. "Marshaling/unmarshaling as a compilation/interpretation process". Research Report LIP6/1998/049, LIP6. December 1998. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/marsh.ps.gz">ps</a>.</li><li>Christian Queinnec. "Sérialisation-désérialisation en DMeroon". <em>NOTERE97 -- Colloque international sur les NOuvelles TEchnologies de la RÉpartition</em>. November 1997. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/serdes.ps.gz">ps</a>.</li><li>Christian Queinnec. "Distributed generic functions". <em>Second France-Japan workshop on Object-Based Parallel and Distributed Computing -- OBPDC '97</em>. October 1997. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/gendist.ps.gz">ps</a>.</li><li>Christian Queinnec. "Bribes de DMeroon". <em>Actes des journées de recherche sur la Mémoire Partagée Répartie</em>. MPR 96. May 1996. </li><li>Christian Queinnec. "DMeroon : Overview of a distributed class-based causally-coherent data model". <em>PSLS 95 - Parallel Symbolic Langages and Systems</em>. Lecture Notes in Computer Science 1068. October 1995. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/psls.ps.gz">ps</a>.</li><li>Christian Queinnec. "Sharing mutable objects and controlling groups of tasks in a concurrent and distributed language". <em>Proceedings of the Workshop on Theory and Practice of Parallel Programming (TPPP'94)</em>. Lecture Notes in Computer Science 907. November 1994. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/dissem.ps.gz">ps</a>.</li><li>Christian Queinnec and David DeRoure. "Design of a concurrent and distributed language". <em>Parallel Symbolic Computing: Languages, Systems, and Applications, (US/Japan Workshop Proceedings)</em>. Lecture Notes in Computer Science 748. October 1993. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/pwb.ps.gz">ps</a>.</li><li>Christian Queinnec. "A concurrent and distributed extension to scheme". <em>PARLE '92 - Parallel Architectures and Languages Europe</em>. Lecture Notes in Computer Science 605. June 1992. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/parle.ps.gz">ps</a>.</li><li>José M. Piquer and Christian Queinnec. "Transpive: A distributed lisp system". <em>La lettre du Transputer</em>. 16. December 1992. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/transpive.ps.gz">ps</a>.</li><li>Christian Queinnec. "Crystal Scheme, A Language for Massively Parallel Machines". <em>Second Symposium on High Performance Computing</em>. October 1991. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/shpc.ps.gz">ps</a>.</li><li>Christian Queinnec. "PolyScheme : A Semantics for a Concurrent Scheme". <em>Workshop on High Performance and Parallel Computing in Lisp</em>. November 1990. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/polyman.ps.gz">ps</a>.</li></ul><h3>December 19, 2001</h3><ul><li>Brian D. Carlstrom. "Embedding Scheme in Java". PhD. Thesis. Massachusetts Institute of Technlogy. February 2001. Available online: <a href="http://www.swiss.ai.mit.edu/~bdc/thesis/thesis.pdf">pdf</a>.</li><li>Timothy J. Hickey. "Jscheme Web Programming for CS0". Brandeis University. CS-02-223. January 2002. Available online: <a href="http://www.cs.brandeis.edu/~tim/Papers/sigcse-jscheme.ps">ps</a>.</li><li>Kenneth R. Anderson and Timothy J. Hickey. "Reflecting Java into Scheme". <em>Proceedings of Reflection 99</em>. Lecture Notes in Computer Science, v. 1616. 1999. </li><li>Timothy J. Hickey, Peter Norvig and Kenneth R. Anderson. "LISP - a Language for Internet Scripting and Programming". <em>LUGM'98: Proceedings of Lisp in the Mainstream</em>. November 1998. Available online: <a href="http://www.norvig.com/lugm.pdf">pdf</a>.</li><li>Christian Queinnec. "Inverting back the inversion of control or, continuations versus page-centric programming". Technical Report 7, LIP6. May 2001. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/www.ps.gz">ps</a> <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/www.pdf">pdf</a>.</li><li>Christian Queinnec. "The influence of browsers on evaluators or, continuations to program web servers". <em>ICFP '2000 - International Conference on Functional Programming</em>. September 2000. Available online: <a href="http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/webcont.ps.gz">ps</a>.</li><li>Danius Michaelides, Luc Moreau and David DeRoure. "A Uniform Approach to Programming the World Wide Web". <em>Computer Systems Science and Engineering</em>. 14(2):69-91. 1999. Available online: <a href="http://www.ecs.soton.ac.uk/~lavm/papers/pWWW.ps.gz">ps</a>.</li></ul><h3>December 9, 2001</h3><ul><li>Matthew Fuchs. "Dreme: for Life in the Net". PhD. Thesis. New York University. September 1995. Available online: <a href="http://www.cs.nyu.edu/csweb/Research/Theses/fuchs_matthew.ps.gz">ps</a> <a href="http://www.cs.nyu.edu/csweb/Research/Theses/fuchs_matthew.pdf">pdf</a>.</li><li>Kurt Nørmark. "WEB Based Lecture Notes - The LENO Approach". November 2001. Available online: <a href="http://www.cs.auc.dk/~normark/laml/papers/leno/submission/paper.zip">ps</a> <a href="http://www.cs.auc.dk/~normark/laml/papers/leno/submission/paper.pdf">pdf</a>.</li><li>Alan Bawden. "Implementing Distributed Systems Using Linear Naming". PhD. Thesis. MIT AI Lab Technical Report AITR-1627. March 1993. Available online: <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AITR-1627.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AITR-1627.pdf">pdf</a>.</li><li>James Philbin. "STING: An Operating System for Modern Languages". PhD. Thesis. Yale University. May 1993. </li><li>James S. Miller. "Multischeme: A Parallel Processing System based on MIT Scheme". PhD. Thesis. Massachusetts Institute of Technology. MIT Technical Report MIT/LCS/TR-402. September 1987. </li></ul><h3>October 18, 2001</h3><ul><li>Dominique Boucher. "Analyse et optimisation globales de modules compilés séparément". PhD. Thesis. Université de Montréal. December 1999. Available online: <a href="http://www.iro.umontreal.ca/~boucherd/papers/phd.tgz">ps</a>.</li><li>Mario Latendresse. "Génération de machines virtuelles pour l'exécution de programmes compressés". PhD. Thesis. Université de Montréal. April 2000. Available online: <a href="http://www.iro.umontreal.ca/~latendre/publications/these.ps">ps</a>.</li><li>Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen. "Automatically Restructuring Programs for the Web". <em>IEEE International Symposium on Automated Software Engineering (ASE 2001)</em>. 2001. Available online: <a href="http://www.ccs.neu.edu/scheme/pubs/ase2001-gfkf.ps.gz">ps</a> <a href="http://www.ccs.neu.edu/scheme/pubs/ase2001-gfkf.pdf">pdf</a>.</li><li>Alan Bawden. "First-class macros have types". <em>POPL '00: 27th ACM Symp. Princ. of Prog. Langs.</em>. 2000. Available online: <a href="http://people.csail.mit.edu/alan/mtt/popl00.ps.gz">ps</a> <a href="http://people.csail.mit.edu/alan/mtt/popl00.pdf">pdf</a>.</li><li>William D. Clinger. "The scheme 311 compiler an exercise in denotational semantics". <em>1984 ACM Symposium on LISP and functional programming</em>. 1984. Available online: <a href="http://portal.acm.org/citation.cfm?id=802052">ACM Digital Library</a>.</li><li>David H. Bartley and John C. Jensen. "The implementation of PC Scheme". <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=319852">ACM Digital Library</a>.</li></ul><h3>October 8, 2001</h3><ul><li>Jonathan A. Rees and Norman I. Adams IV. "T: A dialect of Lisp or, Lambda: The ultimate software tool". <em>Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming</em>. 1982. Available online: <a href="http://portal.acm.org/citation.cfm?id=802142">ACM Digital Library</a>.</li><li>Jonathan A. Rees. "Modular Macros". Masters Thesis. MIT. 1989. </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><li>Bernd Grobauer and Julia L. Lawall. "Partial Evaluation of Pattern Matching in Strings, revisited". BRICS report RS-00-31. September 2001. Available online: <a href="http://www.diku.dk/users/julia/BRICS-RS-00-31.ps.gz">ps</a> <a href="http://www.diku.dk/users/julia/BRICS-RS-00-31.pdf">pdf</a>.</li><li>Julia L. Lawall. "Continuation Introduction and Elimination in Higher-Order Programming Languages". PhD. Thesis. Indiana University, Computer Science Department. July 1994. </li><li>R. Kent Dybvig. "Chez Scheme User's Guide". 1998. Available online: <a href="http://www.scheme.com/csug/index.html">html</a>.</li><li>R. Kent Dybvig. "The Scheme Programming Language, Second Edition". 1996. Available online: <a href="http://www.scheme.com/tspl2d/index.html">html</a>.</li><li>R. Kent Dybvig. "C-Scheme". Masters Thesis. Indiana University Computer Science Department. Technical Report 149. 1983. </li><li>Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen and Bruce F. Duba. "Hygienic macro expansion". <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=319859">ACM Digital Library</a>.</li><li>Eugene E. Kohlbecker. "Syntactic Extensions in the Programming Language Lisp". PhD. Thesis. Indiana University. 1986. Available online: <a href="http://repository.readscheme.org/ftp/papers/kohlbecker_phdthesis.pdf">pdf</a>.</li><li>J. Michael Ashley. "The Effectiveness of Flow Analysis for Inlining". <em>Proceedings of the 1997 ACM International Conference on Functional Programming</em>. Available online: <a href="http://repository.readscheme.org/ftp/papers/jmashley/icfp97.pdf">pdf</a>.</li><li>J. Michael Ashley. "A Practical and Flexible Flow Analysis for Higher-Order Languages". PhD. Thesis. Indiana University. 1996. Available online: <a href="http://repository.readscheme.org/ftp/papers/jmashley/thesis.pdf">pdf</a>.</li><li>J. Michael Ashley. "A Practical and Flexible Flow Analysis for Higher-Order Languages". <em>Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</em>. 1996. Available online: <a href="http://repository.readscheme.org/ftp/papers/jmashley/popl96.pdf">pdf</a>.</li><li>J. Michael Ashley and Charles Consel. "Fixpoint Computation for Polyvariant Static Analyses of Higher-Order Applicative Programs". <em>ACM Transactions on Programming Languages and Systems</em>. 16(5). September 1994. Available online: <a href="http://repository.readscheme.org/ftp/papers/jmashley/toplas94.pdf">pdf</a>.</li><li>Bjarne Steensgaard and Morten Marquard. "A Polyvariant Closure Analysis with Dynamic Widening". May 1994. Available online: <a href="ftp://ftp.research.microsoft.com/pub/analysts/closure.ps.Z">ps</a>.</li><li>Andrew E. Ayers. "Abstract Analysis and Optimization of Scheme". PhD. Thesis. MIT. 1993. </li><li>Stephen Slade. "The T Programming Language: A Dialect of LISP". 1987. </li><li>Matthias Blume. "Refining Hygienic Macros for Modules and Separate Compilation". ATR Human Information Processing Research Laboratories, Kyoto. ATR Technical Report TR-H-171. 1995. Available online: <a href="http://ttic.uchicago.edu/~blume/papers/hygmac.pdf">pdf</a>.</li><li>Matthias Blume. "Separate Compilation for Scheme, draft paper". 1997. Available online: <a href="http://ttic.uchicago.edu/~blume/papers/scm-sc.pdf">pdf</a>.</li><li>Oleg Kiselyov. "XML and Scheme". <em>A micro-talk presentation at a Workshop on Scheme and Functional Programming 2000</em>. September 2000. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/SXML-short-paper.html">html</a>.</li><li>Oleg Kiselyov. "Binary parsing". <em>A micro-talk presentation at a Workshop on Scheme and Functional Programming 2000</em>. September 2000. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/#binio">html</a>.</li><li>Oleg Kiselyov. "General ways to traverse collections". April 2000. Available online: <a href="http://pobox.com/~oleg/ftp/Scheme/enumerators-callcc.html">html</a>.</li></ul><h3>September 19, 2001</h3><ul><li>Marc Feeley. "A Better API for First-Class Continuations". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/feeley.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/feeley.pdf">pdf</a>.</li><li>Kirill Lisovsky. "Scheme program souce code as a semistructured data". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/lisovsky.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/lisovsky.pdf">pdf</a>.</li><li>Augustin Lux. "Tools for Automatic Interface Generation in Scheme". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/lux.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/lux.pdf">pdf</a>.</li><li>Fred Bayer. "LispMe: An Implementation of Scheme for the PalmPilot". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/bayer.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/bayer.pdf">pdf</a>.</li><li>Danny Dubé, Marc Feeley. "Demand-Driven Type Analysis: an Introduction". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/dube.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/dube.pdf">pdf</a>.</li><li>Martin Gasbichler, Holger Gast. "Soft Interfaces: Typing Scheme At The Module Level". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/gasbichler.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/gasbichler.pdf">pdf</a>.</li><li>Frédéric Peschanski. "Jargons: Experimenting Composable Domain-Specific Languages". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/peschanski.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/peschanski.pdf">pdf</a>.</li><li>Philippe Meunier, Robert Bruce Findler, Paul A. Steckler, Mitchell Wand. "Selectors Make Set-Based Analysis Too Hard". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/steckler.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/steckler.pdf">pdf</a>.</li><li>Manfred Widera. "An Algorithm for Checking the Disjointness of Types". <em>2nd Workshop on Scheme and Functional Programming</em>. September 2001. Available online: <a href="http://repository.readscheme.org/ftp/papers/sw2001/widera.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/sw2001/widera.pdf">pdf</a>.</li></ul><h3>September 15, 2001</h3><ul><li>Henry G. Baker. "CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A.". May 1994. Available online: <a href="http://home.pipeline.com/~hbaker1/CheneyMTA.ps.gz">ps</a> <a href="http://home.pipeline.com/~hbaker1/CheneyMTA.html">html</a>.</li><li>Mark DePristo. "SINTL: A Strongly-Typed Generic Intermediate Language for Scheme". Northwestern University. May 2000. Available online: <a href="http://repository.readscheme.org/ftp/papers/depristo00sintl.ps.gz">ps</a> <a href="http://repository.readscheme.org/ftp/papers/depristo00sintl.pdf">pdf</a>.</li><li>Paul R. Wilson. "Uniprocessor Garbage Collection Techniques". Available online: <a href="ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps">ps</a>.</li><li>Paul R. Wilson, Michael S. Lam and Thomas G. Moher. "Caching Considerations for Generational Garbage Collection". <em>1992 ACM Symposium on Lisp and Functional Programming</em>. June 1992. Available online: <a href="ftp://ftp.cs.utexas.edu/pub/garbage/cache.ps">ps</a>.</li><li>David Gudeman. "Representing Type Information in Dynamically Typed Languages". University of Arizona. TR 93-27. October 1993. Available online: <a href="ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/typeinfo.ps.gz">ps</a>.</li><li>Oscar Waddell. "Extending the Scope of Syntactic Abstraction". PhD. Thesis. Indiana University Computer Science Department. August 1999. Available online: <a href="http://www.cs.indiana.edu/~owaddell/papers/thesis.ps.gz">ps</a>.</li><li>Robert G. Burger. "Efficient Compilation and Profile-Driven Dynamic Recompilation in Scheme". PhD. Thesis. Indiana University Computer Science Department. March 1997. Available online: <a href="http://www.cs.indiana.edu/~burger/Dissertation.ps.gz">ps</a>.</li><li>M. Esen Tuna, Steven D. Johnson and Robert G. Burger. "Continuations in Hardware-Software Codesign". <em>IEEE Proceedings of the International Conference on Computer Design</em>. October 1994. Available online: <a href="ftp://ftp.cs.indiana.edu/pub/techreports/TR409.ps.Z">ps</a>.</li><li>Robert G. Burger. "The Scheme Machine". Indiana University, Computer Science Department. Technical Report 413. August 1994. Available online: <a href="ftp://ftp.cs.indiana.edu/pub/techreports/TR413.ps.Z">ps</a>.</li><li>Steven D. Johnson. "Formal derivation of a scheme computer". Indiana University Computer Science Department. Technical Report 544. September 2000. Available online: <a href="ftp://ftp.cs.indiana.edu/pub/techreports/TR544.ps">ps</a> <a href="ftp://ftp.cs.indiana.edu/pub/techreports/TR544.pdf">pdf</a>.</li><li>Jonathon Sobel and Daniel P. Friedman. "Recycling Continuations". <em>1998 International Conference on Functional Programming (ICFP'98)</em>. September 1998. Available online: <a href="http://www.cs.indiana.edu/hyplan/jsobel/Recycling/recycling.ps">ps</a> <a href="http://www.cs.indiana.edu/hyplan/jsobel/Recycling/recycling.pdf">pdf</a>.</li><li>Bruce R. Lewis. "BRL: A database-oriented language to embed in HTML and other markup". June 2001. Available online: <a href="http://brl.sourceforge.net/brl.pdf">pdf</a>.</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:44pm<br />HTML generated using <a href="http://celtic.benderweb.net/webit/">WebIt!</a>.</div></td></tr></table></body></html> |