From 764041977d552d67773088e5d087599bf7cfad40 Mon Sep 17 00:00:00 2001 From: Lassi Kortela Date: Fri, 14 Jun 2024 23:00:52 +0300 Subject: [PATCH] Copy new2001 and new2002 cp -v "$(find websites -type f -name new2001.html | sort | tail -n 1)" www/ cp -v "$(find websites -type f -name new2002.html | sort | tail -n 1)" www/ --- www/new2001.html | 1 + www/new2002.html | 1 + 2 files changed, 2 insertions(+) create mode 100644 www/new2001.html create mode 100644 www/new2002.html diff --git a/www/new2001.html b/www/new2001.html new file mode 100644 index 0000000..ec25142 --- /dev/null +++ b/www/new2001.html @@ -0,0 +1 @@ +Archived 2001 Additions
Readscheme.org
Scheme Bibliography Home
Classics
Semantics
Macros
Objects
Modules
Continuations
Web Programming
Applications
Implementation
Concurrent Programming
Partial Evaluation
Reflection
Recent Additions

Archived 2001 Additions

December 20, 2001

  • Oleg Kiselyov. "A better XML parser through functional programming". Fourth International Symposium on Practical Aspects of Declarative Languages (PADL '02). January 2002. Available online: ps slides.
  • Luc Moreau. "Programming in a Parallel Functional Language with Continuations". Avancées Applicatives. Journées Francophones des Langages Applicatifs (JFLA'92). volume 76-77. February 1992. Available online: ps.
  • Luc Moreau. "An Operational Semantics for a Parallel Language with Continuations". Parallel Architectures and Languages Europe (PARLE'92). number 605 in Lecture Notes in Computer Science. June 1992. Available online: ps.
  • Luc Moreau and Daniel Ribbens. "Sound Rules for Parallel Evaluation of a Functional Language with callcc". ACM conference on Functional Programming and Computer Architecture (FPCA'93). June 1993. Available online: ps.
  • Luc Moreau. "The PCKS-machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations". European Symposium on Programming (ESOP'94). number 788 in Lecture Notes in Computer Science. April 1994. Available online: ps.
  • Luc Moreau. "Sound Evaluation of Parallel Functional Programs with First-Class Continuations". PhD. Thesis. University of Liège. June 1994. Available online: ps.
  • Luc Moreau. "The Semantics of Scheme with Future". University of Southampton. Technical Report M95/7. 1995. Available online: ps.
  • Luc Moreau. "A Parallel Functional Language with First-Class Continuations (Programming Style and Semantics)". Computers and Artificial Intelligence. 14(2). 1995. Available online: ps.
  • Luc Moreau. "Non-speculative and Upward Invocation of Continuations in a Parallel Language". International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95). number 915 in Lecture Notes in Computer Science. May 1995. Available online: ps.
  • Luc Moreau and Daniel Ribbens. "The Semantics of pcall and fork". PSLS 95 - Parallel Symbolic Langages and Systems. number 1068 in Lecture Notes in Computer Science. October 1995. Available online: ps.
  • 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: ps.
  • Luc Moreau. "Correctness of a Distributed-Memory Model for Scheme". University of Southampton. Technical Report M96/3. 1996. Available online: ps.
  • Luc Moreau. "The Semantics of Scheme with Future". ACM SIGPLAN International Conference on Functional Programming (ICFP'96). May 1996. Available online: ps.
  • Luc Moreau. "Continuing into the Future: the Return (Invited Paper)". 8th International Conference in Systems Research Informatics and Cybernetics (InterSymp'96). August 1996. Available online: ps.
  • Luc Moreau. "Correctness of a Distributed-Memory Model for Scheme". Second International Europar Conference (EURO-PAR'96). number 1123 in Lecture Notes in Computer Science. August 1996. Available online: ps.
  • Luc Moreau and David DeRoure. "A Distributed Garbage Collector for NeXeme". University of Southampton. 1997. Available online: ps.
  • Luc Moreau and Christian Queinnec. "On the Finiteness of Resources in Distributed Computing". INRIA. Research Report RR-3147. April 1997. Available online: ps pdf.
  • Luc Moreau, David DeRoure and Ian Foster. "NeXeme: a Distributed Scheme Based on Nexus". Third International Europar Conference (EURO-PAR'97). volume 1300 of Lecture Notes in Computer Science. August 1997. Available online: ps.
  • Luc Moreau and Christian Queinnec. "Design and Semantics of Quantum: a Language to Control Resource Consumption in Distributed Computing". Usenix Conference on Domain-Specific Languages (DSL'97). October 1997. Available online: ps.
  • 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: ps.
  • Luc Moreau and Christian Queinnec. "Distributed Computations Driven by Resource Consumption". IEEE International Conference on Computer Languages (ICCL'98). May 1998. Available online: ps pdf.
  • Luc Moreau. "A Distributed Garbage Collector with Diffusion Tree Reorganisation and Object Mobility". Proceedings of the Third International Conference of Functional Programming (ICFP'98). September 1998. Available online: ps.
  • Luc Moreau. "Hierarchical Distributed Reference Counting". Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98). October 1998. Available online: ps.
  • Suresh Jagannathan. "Communication-Passing Style for Coordination Languages". 2nd International Conference on Coordination Models and Languages. Springer-Verlag LNCS 1282. September 1997. Available online: ps.
  • Suresh Jagannathan, Henry Cejtin, Richard A. Kelsey. "Higher-Order Distributed Objects". ACM Transactions on Programming Languages and Systems. September 1995. Available online: ps.
  • Suresh Jagannathan. "Virtual Topologies: A New Concurrency Abstraction for High-Level Parallel Programs". 5th Workshop on Languages and Compilers for Parallel Computing. September 1995. Available online: ps.
  • Suresh Jagannathan. "TS-Scheme: Distributed Data Structures in Lisp". Lisp and Symbolic Computation. December 1994. Available online: ps.
  • Suresh Jagannathan. "Locality Abstractions for Parallel and Distributed Computing". International Conference on Theory and Practice of Parallel Programming. Springer-Verlag LNCS 907. November 1994. Available online: ps.
  • Suresh Jagannathan, James Philbin. "High-Level Abstractions for Efficient Concurrent Systems". International Conference on Programming Languages and Systems Architecture. Springer-Verlag LNCS 782. March 1994. Available online: ps.
  • Suresh Jagannathan, Stephen Weeks and James Philbin. "A Concurrent Abstract Interpreter". Lisp and Symbolic Computation. April 1994. Available online: ps.
  • Suresh Jagannathan, Stephen Weeks. "Analyzing Stores and References in Parallel Symbolic Languages". ACM Symposium on Lisp and Functional Programming (LFP94). June 1994. Available online: ps.
  • James Philbin. "An Overview of the Sting Operating System". Proceedings of the 4th NEC Software Conference. October 1992. Available online: ps.
  • James Philbin. "Customizable Policy Management in the Sting Operating System". US/Japan Workshop on Parallel Symbolic Computing, Springer-Verlag LNCS 748. October 1992.
  • Suresh Jagannathan, James Philbin. "A Customizable Substrate for Concurrent Languages". ACM Conference on Programming Language Design and Implementation (PLDI92). June 1992. Available online: ps.
  • Suresh Jagannathan, James Philbin. "A Foundation for an Efficient Multi-Threaded Scheme System". ACM Conference on Lisp and Functional Programming (LFP92). June 1992. Available online: ps.
  • Suresh Jagannathan. "Expressing Fine-Grained Parallelism Using Distributed Data Structures". Workshop on Research Directions in High-Level Parallel Languages. Springer-Verlag LNCS 574. June 1991. Available online: ps.
  • Christian Queinnec. "Distributed generic functions". Object-Oriented Parallel and Distributed Programming. 2000. Available online: ps.
  • Christian Queinnec. "Marshaling/unmarshaling as a compilation/interpretation process". Symposium IPPS/SPDP 1999 - 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. April 1999. Available online: ps.
  • Christian Queinnec. "DMeroon A Distributed Class-based Causally-Coherent Data Model - General documentation". Rapport LIP6 1998/039. 1998. Available online: ps.
  • Christian Queinnec. "Marshaling/unmarshaling as a compilation/interpretation process". Research Report LIP6/1998/049, LIP6. December 1998. Available online: ps.
  • Christian Queinnec. "Sérialisation-désérialisation en DMeroon". NOTERE97 -- Colloque international sur les NOuvelles TEchnologies de la RÉpartition. November 1997. Available online: ps.
  • Christian Queinnec. "Distributed generic functions". Second France-Japan workshop on Object-Based Parallel and Distributed Computing -- OBPDC '97. October 1997. Available online: ps.
  • Christian Queinnec. "Bribes de DMeroon". Actes des journées de recherche sur la Mémoire Partagée Répartie. MPR 96. May 1996.
  • Christian Queinnec. "DMeroon : Overview of a distributed class-based causally-coherent data model". PSLS 95 - Parallel Symbolic Langages and Systems. Lecture Notes in Computer Science 1068. October 1995. Available online: ps.
  • Christian Queinnec. "Sharing mutable objects and controlling groups of tasks in a concurrent and distributed language". Proceedings of the Workshop on Theory and Practice of Parallel Programming (TPPP'94). Lecture Notes in Computer Science 907. November 1994. Available online: ps.
  • Christian Queinnec and David DeRoure. "Design of a concurrent and distributed language". Parallel Symbolic Computing: Languages, Systems, and Applications, (US/Japan Workshop Proceedings). Lecture Notes in Computer Science 748. October 1993. Available online: ps.
  • Christian Queinnec. "A concurrent and distributed extension to scheme". PARLE '92 - Parallel Architectures and Languages Europe. Lecture Notes in Computer Science 605. June 1992. Available online: ps.
  • José M. Piquer and Christian Queinnec. "Transpive: A distributed lisp system". La lettre du Transputer. 16. December 1992. Available online: ps.
  • Christian Queinnec. "Crystal Scheme, A Language for Massively Parallel Machines". Second Symposium on High Performance Computing. October 1991. Available online: ps.
  • Christian Queinnec. "PolyScheme : A Semantics for a Concurrent Scheme". Workshop on High Performance and Parallel Computing in Lisp. November 1990. Available online: ps.

December 19, 2001

  • Brian D. Carlstrom. "Embedding Scheme in Java". PhD. Thesis. Massachusetts Institute of Technlogy. February 2001. Available online: pdf.
  • Timothy J. Hickey. "Jscheme Web Programming for CS0". Brandeis University. CS-02-223. January 2002. Available online: ps.
  • Kenneth R. Anderson and Timothy J. Hickey. "Reflecting Java into Scheme". Proceedings of Reflection 99. Lecture Notes in Computer Science, v. 1616. 1999.
  • Timothy J. Hickey, Peter Norvig and Kenneth R. Anderson. "LISP - a Language for Internet Scripting and Programming". LUGM'98: Proceedings of Lisp in the Mainstream. November 1998. Available online: pdf.
  • Christian Queinnec. "Inverting back the inversion of control or, continuations versus page-centric programming". Technical Report 7, LIP6. May 2001. Available online: ps pdf.
  • Christian Queinnec. "The influence of browsers on evaluators or, continuations to program web servers". ICFP '2000 - International Conference on Functional Programming. September 2000. Available online: ps.
  • Danius Michaelides, Luc Moreau and David DeRoure. "A Uniform Approach to Programming the World Wide Web". Computer Systems Science and Engineering. 14(2):69-91. 1999. Available online: ps.

December 9, 2001

  • Matthew Fuchs. "Dreme: for Life in the Net". PhD. Thesis. New York University. September 1995. Available online: ps pdf.
  • Kurt Nørmark. "WEB Based Lecture Notes - The LENO Approach". November 2001. Available online: ps pdf.
  • Alan Bawden. "Implementing Distributed Systems Using Linear Naming". PhD. Thesis. MIT AI Lab Technical Report AITR-1627. March 1993. Available online: ps pdf.
  • James Philbin. "STING: An Operating System for Modern Languages". PhD. Thesis. Yale University. May 1993.
  • 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.

October 18, 2001

  • Dominique Boucher. "Analyse et optimisation globales de modules compilés séparément". PhD. Thesis. Université de Montréal. December 1999. Available online: ps.
  • 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: ps.
  • Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen. "Automatically Restructuring Programs for the Web". IEEE International Symposium on Automated Software Engineering (ASE 2001). 2001. Available online: ps pdf.
  • Alan Bawden. "First-class macros have types". POPL '00: 27th ACM Symp. Princ. of Prog. Langs.. 2000. Available online: ps pdf.
  • William D. Clinger. "The scheme 311 compiler an exercise in denotational semantics". 1984 ACM Symposium on LISP and functional programming. 1984. Available online: ACM Digital Library.
  • David H. Bartley and John C. Jensen. "The implementation of PC Scheme". Proceedings of the 1986 ACM conference on LISP and functional programming. 1986. Available online: ACM Digital Library.

October 8, 2001

  • Jonathan A. Rees and Norman I. Adams IV. "T: A dialect of Lisp or, Lambda: The ultimate software tool". Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming. 1982. Available online: ACM Digital Library.
  • Jonathan A. Rees. "Modular Macros". Masters Thesis. MIT. 1989.
  • Jonathan A. Rees, Norman I. Adams IV and James R. Meehan. "The T manual". Yale University Computer Science Department. 1984. Available online: text pdf.
  • Bernd Grobauer and Julia L. Lawall. "Partial Evaluation of Pattern Matching in Strings, revisited". BRICS report RS-00-31. September 2001. Available online: ps pdf.
  • Julia L. Lawall. "Continuation Introduction and Elimination in Higher-Order Programming Languages". PhD. Thesis. Indiana University, Computer Science Department. July 1994.
  • R. Kent Dybvig. "Chez Scheme User's Guide". 1998. Available online: html.
  • R. Kent Dybvig. "The Scheme Programming Language, Second Edition". 1996. Available online: html.
  • R. Kent Dybvig. "C-Scheme". Masters Thesis. Indiana University Computer Science Department. Technical Report 149. 1983.
  • Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen and Bruce F. Duba. "Hygienic macro expansion". Proceedings of the 1986 ACM Conference on LISP and Functional Programming. 1986. Available online: ACM Digital Library.
  • Eugene E. Kohlbecker. "Syntactic Extensions in the Programming Language Lisp". PhD. Thesis. Indiana University. 1986. Available online: pdf.
  • J. Michael Ashley. "The Effectiveness of Flow Analysis for Inlining". Proceedings of the 1997 ACM International Conference on Functional Programming. Available online: pdf.
  • J. Michael Ashley. "A Practical and Flexible Flow Analysis for Higher-Order Languages". PhD. Thesis. Indiana University. 1996. Available online: pdf.
  • J. Michael Ashley. "A Practical and Flexible Flow Analysis for Higher-Order Languages". Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 1996. Available online: pdf.
  • J. Michael Ashley and Charles Consel. "Fixpoint Computation for Polyvariant Static Analyses of Higher-Order Applicative Programs". ACM Transactions on Programming Languages and Systems. 16(5). September 1994. Available online: pdf.
  • Bjarne Steensgaard and Morten Marquard. "A Polyvariant Closure Analysis with Dynamic Widening". May 1994. Available online: ps.
  • Andrew E. Ayers. "Abstract Analysis and Optimization of Scheme". PhD. Thesis. MIT. 1993.
  • Stephen Slade. "The T Programming Language: A Dialect of LISP". 1987.
  • 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: pdf.
  • Matthias Blume. "Separate Compilation for Scheme, draft paper". 1997. Available online: pdf.
  • Oleg Kiselyov. "XML and Scheme". A micro-talk presentation at a Workshop on Scheme and Functional Programming 2000. September 2000. Available online: html.
  • Oleg Kiselyov. "Binary parsing". A micro-talk presentation at a Workshop on Scheme and Functional Programming 2000. September 2000. Available online: html.
  • Oleg Kiselyov. "General ways to traverse collections". April 2000. Available online: html.

September 19, 2001

  • Marc Feeley. "A Better API for First-Class Continuations". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Kirill Lisovsky. "Scheme program souce code as a semistructured data". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Augustin Lux. "Tools for Automatic Interface Generation in Scheme". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Fred Bayer. "LispMe: An Implementation of Scheme for the PalmPilot". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Danny Dubé, Marc Feeley. "Demand-Driven Type Analysis: an Introduction". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Martin Gasbichler, Holger Gast. "Soft Interfaces: Typing Scheme At The Module Level". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Frédéric Peschanski. "Jargons: Experimenting Composable Domain-Specific Languages". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Philippe Meunier, Robert Bruce Findler, Paul A. Steckler, Mitchell Wand. "Selectors Make Set-Based Analysis Too Hard". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.
  • Manfred Widera. "An Algorithm for Checking the Disjointness of Types". 2nd Workshop on Scheme and Functional Programming. September 2001. Available online: ps pdf.

September 15, 2001

  • Henry G. Baker. "CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A.". May 1994. Available online: ps html.
  • Mark DePristo. "SINTL: A Strongly-Typed Generic Intermediate Language for Scheme". Northwestern University. May 2000. Available online: ps pdf.
  • Paul R. Wilson. "Uniprocessor Garbage Collection Techniques". Available online: ps.
  • Paul R. Wilson, Michael S. Lam and Thomas G. Moher. "Caching Considerations for Generational Garbage Collection". 1992 ACM Symposium on Lisp and Functional Programming. June 1992. Available online: ps.
  • David Gudeman. "Representing Type Information in Dynamically Typed Languages". University of Arizona. TR 93-27. October 1993. Available online: ps.
  • Oscar Waddell. "Extending the Scope of Syntactic Abstraction". PhD. Thesis. Indiana University Computer Science Department. August 1999. Available online: ps.
  • Robert G. Burger. "Efficient Compilation and Profile-Driven Dynamic Recompilation in Scheme". PhD. Thesis. Indiana University Computer Science Department. March 1997. Available online: ps.
  • M. Esen Tuna, Steven D. Johnson and Robert G. Burger. "Continuations in Hardware-Software Codesign". IEEE Proceedings of the International Conference on Computer Design. October 1994. Available online: ps.
  • Robert G. Burger. "The Scheme Machine". Indiana University, Computer Science Department. Technical Report 413. August 1994. Available online: ps.
  • Steven D. Johnson. "Formal derivation of a scheme computer". Indiana University Computer Science Department. Technical Report 544. September 2000. Available online: ps pdf.
  • Jonathon Sobel and Daniel P. Friedman. "Recycling Continuations". 1998 International Conference on Functional Programming (ICFP'98). September 1998. Available online: ps pdf.
  • Bruce R. Lewis. "BRL: A database-oriented language to embed in HTML and other markup". June 2001. Available online: pdf.

Hosted by concurrency.cc.

Last modified: Saturday, August 11th, 2012 4:55:44pm
HTML generated using WebIt!.

\ No newline at end of file diff --git a/www/new2002.html b/www/new2002.html new file mode 100644 index 0000000..84f9ed5 --- /dev/null +++ b/www/new2002.html @@ -0,0 +1 @@ +Archived 2002 Additions
Readscheme.org
Scheme Bibliography Home
Classics
Semantics
Macros
Objects
Modules
Continuations
Web Programming
Applications
Implementation
Concurrent Programming
Partial Evaluation
Reflection
Recent Additions

Archived 2002 Additions

December 11, 2002

November 18, 2002

  • Stéphane Ducasse and Tamar Richner. "Executable Connectors: Towards Reusable Design Elements". ESEC/FSE'97 (European Software Engineering Conference). September 1997. Available online: pdf.
  • Stéphane Ducasse, Mireille Blay-Fornarino and Anne-Marie Pinna. "Object and Dependency Oriented Programming in FLO". ISMIS'96 (International Symposium on Methodologies for Intelligent Systems). June 1996. Available online: pdf.
  • Stéphane Ducasse, Mireille Blay-Fornarino and Anne-Marie Pinna. "A Reflective Model for First Class Dependencies". OOPSLA'95 (International Conference on Object - Oriented Programming Systems Languages and Applications). October 1995. Available online: pdf.
  • Stéphane Ducasse. "Inheritance Mechanism Reification by Means of First Class Object". International IJCAI'95 Workshop on Reflection and Meta - Level Architectures and their Applications in AI. 1995.
  • Stéphane Ducasse. "Reifying Inheritance in a Reflective Language". Université de Nice-Sophia Antipolis. I3S Lab RR-95-28. 1996. Available online: ps.
  • Stéphane Ducasse. "Intégration réflexive de dépendances dans un modèle à classes". PhD. Thesis. Université de Nice-Sophia Antipolis. January 1997. Available online: ps pdf.
  • Mads Sig Ager, Olivier Danvy and Henning Korsholm Rohde. "On Obtaining Knuth, Morris, and Pratt's String Matcher by Partial Evaluation". ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ASIA-PEPM '02. July 2002. Available online: ps pdf.
  • 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: ps pdf.
  • Hidehiko Masuhara and Akinori Yonezawa. "Design and Partial Evaluation of Meta-objects for a Concurrent Reflective Language". European Conference on Object-Oriented Programming (ECOOP'98). July 1998. Available online: ps pdf.
  • Anne Brygoo, Titou Durand, Pascal Manoury, Christian Queinnec and Michèle Soria. "Experiment around a training engine". IFIP WCC 2002 - World Computer Congress. August 2002. Available online: ps pdf.
  • Anne Brygoo, Titou Durand, Pascal Manoury, Christian Queinnec and Michèle Soria. "Un cédérom pour scheme -- chacun son entraineur, un entraineur pour tous". TICE 2002. November 2002. Available online: ps pdf.
  • Donovan Kolbly. "Extensible Language Implementation". PhD. Thesis. University of Texas. September 2002. Available online: ps.
  • Matthias Felleisen. "Developing Interactive Web Programs". Summer School on Advanced Functional Programming 2002. August 2002. Available online: ps.
  • Danny Dubé. "Demand-driven type analysis for dynamically-typed functional languages". PhD. Thesis. Université de Montréal. August 2002. Available online: ps.
  • Jörg F. Wittenberger. "Askemos - a distributed settlement". SSGRR2002. 2002. Available online: pdf.
  • Jean-Pierre Briot, Pierre Cointe and Emmanuel Saint-James. "Reécriture et récursion dans une fermeture - Etude dans un Lisp à liaison superficielle - Application aux objets". Actes des Journées AFCET-Informatique Langages Orientés Objet, BIGRE+Globule. 48. January 1986.

New Papers from PLI'2002 and the Scheme Workshop 2002

  • Christian Queinnec. "A library for quizzes". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps pdf.
  • Timothy J. Hickey. "Incorporating Scheme-based web programming in computer-literacy courses". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: pdf.
  • Noel Welsh, Francisco Solsona and Ian Glover. "SchemeUnit and SchemeQL: Two little languages". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps pdf.
  • Adam Wick, Matthew Flatt and Wilson Hsieh. "Reachability-based memory accounting". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: pdf.
  • Martin Gasbichler and Michael Sperber. "Processes vs. user-level threads in scsh". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps pdf.
  • Oscar Waddell, Dipanwita Sarkar and R. Kent Dybvig. "Robust and effective transformation of letrec". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: pdf.
  • Mayer Goldberg. "A variadic extension of Curry's fixed-point combinator". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps pdf.
  • Oleg Kiselyov. "How to write seemingly unhygienic and referentially opaque macros with syntax-rules". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps pdf talk (pdf).
  • Danny Dubé and Marc Feeley. "A Demand-Driven Adaptive Type Analysis". International Conference on Functional Programming (ICFP'2002). October 2002. Available online: ps.
  • Lars Thomas Hansen and William D. Clinger. "An Experimental Study of Renewal-Older-First Garbage Collection". International Conference on Functional Programming (ICFP'2002). October 2002. Available online: pdf.
  • Bernard Serpette and Manuel Serrano. "Compiling Scheme to JVM bytecode: a performance study". International Conference on Functional Programming (ICFP'2002). October 2002. Available online: ps.
  • Michael Sperber and Martin Gasbichler. "Final shift for call/cc: Direct implementation of shift and reset". International Conference on Functional Programming (ICFP'2002). October 2002. Available online: ps.
  • Oleg Kiselyov. "Macros that Compose: Systematic Macro Programming". Generative Programming and Component Engineering (GPCE'02). October 2002. Available online: ps talk (pdf).
  • Martin Gasbichler, Michael Sperber. "A Direct Implementation of Shift/Reset". IFL 2001. 2001.

October 20, 2002

  • Chris Hanson. "A Syntactic Closures Macro Facility". Lisp Pointers. IV. 4. October-December 1991. Available online: ps.

September 28, 2002

  • Julia L. Lawall. "Proofs by structural induction using partial evaluation". Proceedings of the ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (PEPM'93). 1993. Available online: ACM Digital Library.
  • Christian Mossin. "Partial evaluation of general parsers". Proceedings of the ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (PEPM'93). 1993. Available online: ACM Digital Library.
  • Peter Lee and Uwe F. Pleban. "On the use of LISP in implementing denotational semantics". Proceedings of the 1986 ACM conference on LISP and functional programming. 1986. Available online: ACM Digital Library.
  • Kenichi Asai. "Online partial evaluation for shift and reset". Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation (PEPM'02). January 2002. Available online: ps ACM Digital Library.
  • Richard A. Kelsey and Jonathan A. Rees. "Modules (in 'The Incomplete Scheme48 Reference Manual for release 0.57')". 2001. Available online: html ps.
  • Oleg Kiselyov and Kirill Lisovsky. "XML, XPath, XSLT implementations as SXML, SXPath, and SXSLT". International Lisp Conference (2002). September 2002. Available online: pdf talk (pdf).
  • Kurt Nørmark. "XML in LAML - Web Programming in Scheme". August 2002. Available online: ps pdf.

September 3, 2002

  • Christian Queinnec. "23 things I know about modules for Scheme". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps pdf.

August 26, 2002

  • Robert Bruce Findler and Matthias Felleisen. "Contracts for Higher-Order Functions". International Conference on Functional Programming (ICFP2002). October 2002. Available online: ps pdf.
  • Matthias Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi. "The Structure and Interpretation of the Computer Science Curriculum". Functional and Declarative Programming in Education (FDPE2002). October 2002. Available online: ps pdf.

August 13, 2002

  • Mikael Hansen, Paw Iversen and Jimmy Juncker. "SLAML - Server side LAML". Masters Thesis. Aalborg University. June 2002. Available online: ps.
  • Carsten Hellegaard. "POWER - Program Oriented Web EngineeRing". Masters Thesis. Aalborg University. June 2000. Available online: ps pdf.
  • Matthew Flatt. "Composable and Compilable Macros: You Want it When?". International Conference on Functional Programming (ICFP'2002). 2002. Available online: pdf.
  • Paul A. Steckler. "Component Support in PLT Scheme". Software Practice and Experience. 32. 10. 2002.
  • Guruduth S. Banavar. "An Application Framework For Compositional Modularity". PhD. Thesis. University of Utah. 1995. Available online: ps pdf.
  • Kenjiro Taura, Akinori Yonezawa. "Schematic: A Concurrent Object-Oriented Extension to Scheme". Workshop on Object-Based Parallel and Distributed Computing (OBPDC'96). 1996. Available online: ps.

June 3, 2002

  • Robert Bruce Findler. "Behavioral Software Contracts". PhD. Thesis. Rice University. May 2002. Available online: ps pdf.
  • Paul T. Graunke and Shriram Krishnamurthi. "Advanced Control Flows for Flexible Graphical User Interfaces". International Conference on Software Engineering. 2002. Available online: ps pdf.
  • Kurt Nørmark. "XML in LAML - Web Programming in Scheme". August 2002. Available online: ps pdf.
  • Kurt Nørmark. "Development of LAML - A Suite of Web Software for Scheme". May 2002. Available online: ps pdf.

May 26, 2002

  • Timothy J. Hickey. "Incorporating Scheme-based Web Programmming into Computer Literacy Courses". Brandeis University. CS-02-224. April 2002. Available online: ps pdf.
  • Robert H. Halstead. "MULTILISP: a language for concurrent symbolic computation". ACM Transactions on Programming Languages and Systems (TOPLAS). 7. 4. October 1985. Available online: ACM Digital Library.
  • David A. Kranz, Robert H. Halstead and Eric Mohr. "Mul-T: a high-performance parallel Lisp". Programming language design and implementation 1989. 1989. Available online: ACM Digital Library.
  • Eric Mohr, David A. Kranz and Robert H. Halstead. "Lazy task creation: a technique for increasing the granularity of parallel programs". Proceedings of the 1990 ACM conference on LISP and functional programming. 1990. Available online: ACM Digital Library.
  • Robert H. Halstead. "Implementation of multilisp: Lisp on a multiprocessor". Proceedings of the 1984 ACM Symposium on LISP and functional programming. 1984. Available online: ACM Digital Library.
  • Robert H. Halstead and J. Loaiza. "Exception handling in Multilisp". 1985 Int. Conf. Parallel Processing. August 1985.
  • Robert H. Halstead. "Overview of concert multilisp: a multiprocessor symbolic computing system". 15. 1. March 1987.
  • Guy Lewis Steele, Jr.. "Debunking the "Expensive Procedure Call" Myth, or Procedure Call Implementations Considered Harmful, or LAMBDA, the Ultimate GOTO". ACM Conference Proceedings. 1977. Available online: ACM Digital Library.
  • Guy Lewis Steele, Jr.. "Macaroni is Better than Spaghetti". Proceedings of the Symposium on Artificial Intelligence and Programming Languages. August 1977. Available online: ACM Digital Library.
  • Mitchell Wand. "Continuation-Based Program Transformation Strategies". Journal of the ACM. 27. 1. January 1980. Available online: ACM Digital Library.
  • Mitchell Wand and Daniel P. Friedman. "Compiling Lambda Expressions Using Continuations and Factorizations". Journal of Computer Languages. 3. 1978.
  • 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: ps pdf.
  • 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.
  • Guy Lewis Steele, Jr.. "Compiler Optimization Based on Viewing LAMBDA as RENAME + GOTO". AI: An MIT Perspective. 1980.
  • Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Dream of a Lifetime: a Lazy Variable Extent Mechanism". Conference Record of the 1980 Lisp Conference. 1980. Available online: ACM Digital Library.
  • Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Dream of a Lifetime: a Lazy Variable Extent Mechanism". 1979. Available online: ps pdf.
  • Drew McDermott. "An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped Lisp". Conference Record of the 1980 Lisp Conference. 1980. Available online: ACM Digital Library.
  • Steven S. Muchnick and Uwe F. Pleban. "A Semantic Comparison of Lisp and Scheme". Conference Record of the 1980 Lisp Conference. 1980. Available online: ACM Digital Library.
  • Uwe F. Pleban. "A Denotational Approach to Flow Analysis and Optimization of SCHEME, A Dialect of LISP". PhD. Thesis. Ph.D. Dissertation. 1980.
  • Mitchell Wand. "Continuation-Based Multiprocessing". Conference Record of the 1980 Lisp Conference. 1980. Available online: ACM Digital Library.
  • Mitchell Wand. "SCHEME Version 3.1 Reference Manual". Indiana University. Computer Science Technical Report 93. June 1980.
  • Guy Lewis Steele, Jr. and Gerald Jay Sussman. "Design of a Lisp-based Processor". CACM. 23. 11. November 1980. Available online: ACM Digital Library.
  • Rex A. Dwyer and R. Kent Dybvig. "A SCHEME for Distributed Processes". Indiana University. Computer Science Department Technical Report 107. April 1981.
  • Gerald Jay Sussman, Jack Holloway, Guy Lewis Steele, Jr. and Alan Bell. "Scheme-79 - Lisp on a Chip". IEEE Computer. 14. 7. July 1981.
  • 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: ps pdf.
  • John Batali, Edmund Goodhue, Chris Hanson, Howie Shrobe, Richard M. Stallman and Gerald Jay Sussman. "The Scheme-81 Architecture - System and Chip". Proceedings, Conference on Advanced Research in VLSI. 1982.
  • Gerald Jay Sussman. "LISP, Programming and Implementation". Functional Programming and its Applications. 1982.
  • 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.
  • Pee Hong Chen and Daniel P. Friedman. "Prototyping Data Flow by Translation Into Scheme". Indiana University. Computer Science Technical Report 147. August 1983.
  • 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.
  • Daniel P. Friedman, Christopher T. Haynes and Eugene E. Kohlbecker. "Programming with Continuations". Program Transformation and Programming Environments. 1984.
  • Christopher T. Haynes and Daniel P. Friedman. "Engines Build Process Abstractions". Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming. 1984. Available online: ACM Digital Library.
  • Christopher T. Haynes, Daniel P. Friedman and Mitchell Wand. "Continuations and Coroutines". Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming. 1984. Available online: ACM Digital Library.
  • Daniel P. Friedman and Mitchell Wand. "Reification: Reflection Without Metaphysics". Conference Record of the 1984 ACM Symposium on LISP and Functional Programming. August 1984. Available online: ACM Digital Library.
  • Guillermo J. Rozas. "Liar, an Algol-like Compiler for Scheme". Massachusetts Institute of Technology. S. B. Thesis. January 1984.
  • Richard Schooler and James W. Stamos. "Proposal For a Small Scheme Implementation". Massachusetts Institute of Technology. MIT LCS Memo TM-267. October 1984.
  • "MIT Scheme Manual". Massachusetts Institute of Technology. March 2002. Available online: html.
  • "MacScheme Reference Manual". Semantic Microsystems. 1985.
  • William D. Clinger, Daniel P. Friedman and Mitchell Wand. "A Scheme for a Higher-Level Semantic Algebra". Algebraic Methods in Semantics. 1985.
  • Amitabh Srivastava, Don Oxley and Aditya Srivastava. "An (other) Integration of Logic and Functional Programming". Proceedings of the Symposium on Logic Programming. 1985.
  • Daniel P. Friedman and Christopher T. Haynes. "Constraining Control". Proceedings of the Twelfth Annual Symposium on Principles of Programming Languages. January 1985.
  • Pee Hong Chen and L. David Sabbagh. "Scheme as an Interactive Graphics Programming Environment". Indiana University. Computer Science Technical Report No. 166. March 1985.
  • Michael A. Eisenberg. "Bochser: An Integrated Scheme Programming System". Massachusetts Institute of Technology. MIT Computer Science Technical Report 349. October 1985.
  • Matthias Felleisen. "Transliterating Prolog into Scheme". Indiana University. Computer Science Technical Report 182. October 1985.
  • R. Kent Dybvig, Daniel P. Friedman and Christopher T. Haynes. "Expansion-Passing style: Beyond Conventional Macros". Conference Record of the 1986 ACM Conference on Lisp and Functional Programming. 1986. Available online: ACM Digital Library.
  • Matthias Felleisen and Daniel P. Friedman. "A Closer Look At Export and Import Statements". Journal of Computer Languages. 11. 1. 1986.
  • Christopher T. Haynes, Daniel P. Friedman and Mitchell Wand. "Obtaining Coroutines With Continuations". Journal of Computer Languages. 11. 3/4. 1986.
  • Mitchell Wand. "Finding the Source of Type Errors". Conference Record of the Thirteenth Annual Symposium on Principles of Programming Languages. 1986.
  • Mitchell Wand. "From Interpreter to Compiler: A Representational Derivation". Programs as Data Objects. Lecture Notes in Computer Science. 1986.
  • Matthias Felleisen and Daniel P. Friedman. "Control operators, the SECD-machine, and the lambda-calculus". 3rd Working Conference on the Formal Description of Programming Concepts. August 1986.
  • Mitchell Wand. "The Mystery of the Tower Revealed: a Non-Reflective Description of the Reflective Tower". Proceedings of the 1986 ACM Symposium on LISP and Functional Programming. August 1986. Available online: ACM Digital Library.
  • Christopher T. Haynes. "Logic Continuations". Proceedings of the Third International Conference on Logic Programming. July 1986.
  • Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker and Bruce F. Duba. "Reasoning with Continuations". Proceedings of the Symposium on Logic in Computer Science. June 1986.
  • Kevin J. Lang and Barak A. Pearlmutter. "Oaklisp: an Object-Oriented Scheme with First Class Types". ACM Conference on Object-Oriented Systems, Programming, Languages and Applications. September 1986. Available online: pdf ACM Digital Library.
  • William D. Clinger. "The Scheme of things: Streams versus Generators". Tektronix, Inc.. Technical Report. 1987.
  • Matthias Felleisen. "Reflections on Landin's J-Operator: A Partly Historical Note". Journal of Computer Languages. 12. 3/4. 1987.
  • Matthias Felleisen and Daniel P. Friedman. "A Reduction Semantics for Imperative Higher-Order Languages". Parallel Architectures and Languages Europe. 259. 1987.
  • Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker and Bruce F. Duba. "A Syntactic Theory of Sequential Control". Theoretical Computer Science. 52. 1987.
  • Christopher T. Haynes and Daniel P. Friedman. "Abstracting Timed Preemption with Engines". Journal of Computer Languages. 12. 2. 1987.
  • Bruce F. Duba, Matthias Felleisen and Daniel P. Friedman. "Dynamic Identifiers can be Neat". Indiana University. Computer Science Technical Report No. 220. April 1987.
  • 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: pdf.
  • 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: pdf.
  • Matthias Felleisen and Daniel P. Friedman. "A Calculus for Assignments in Higher-Order Languages". Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages. January 1987. Available online: ACM Digital Library.
  • Matthias Felleisen and Daniel P. Friedman. "A Syntactic Theory of Sequential State". Indiana University. Computer Science Dept. Technical Report 230. October 1987.
  • Christopher T. Haynes and Daniel P. Friedman. "Embedding Continuations in Procedural Objects". ACM Transactions on Programming Languages and Systems. 9. 4. October 1987. Available online: ACM Digital Library.
  • Mitchell Wand and Daniel P. Friedman. "The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower". Meta-Level Architectures and Reflection. 1988.
  • Hal Abelson and Gerald Jay Sussman. "Lisp: A Language for Stratified Design". BYTE. February 1988.
  • William D. Clinger. "Semantics of Scheme". BYTE. February 1988.
  • R. Kent Dybvig and Robert Hieb. "A Variable-Arity Procedural Interface". Proceedings of the 1988 ACM Symposium on LISP and Functional Programming. July 1988. Available online: ACM Digital Library.
  • John Franco and Daniel P. Friedman. "Creating Efficient Programs by Exchanging Data for Procedures". Indiana University. Computer Science Technical Report 245. March 1988.
  • Kevin J. Lang and Barak A. Pearlmutter. "Oaklisp: an Object-Oriented Dialect of Scheme". Lisp and Symbolic Computation: An International Journal. 1. 1. May 1988. Available online: ps pdf.
  • Steven R. Vegdahl and Uwe F. Pleban. "The Runtime Environment for Screme, a Scheme Implementation on the 88000". Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems. April 1989. Available online: ACM Digital Library.
  • J. Michael Ashley and Richard M. Salter. "A Revised State Space Model for a Logic Programming Embedding in Scheme". BIGRE Bulletin. 65. July 1989.
  • Olivier Danvy. "Programming with Tighter Control". BIGRE Bulletin. 65. July 1989.
  • Olivier Danvy. "Combiner Logiquement en Scheme". BIGRE Bulletin. 65. July 1989.
  • Vincent Delacour. "Picolo Expresso". BIGRE Bulletin. 65. July 1989.
  • Alain Deutsch, Renaud Dumeur, Charles Consel and Jean-Daniel Fekete. "CSKIM: An Extended Dialect of Scheme". BIGRE Bulletin. 65. July 1989.
  • Simon M. Kaplan and Joseph P. Loyall. "GARP/Scheme: Implementing a Concurrent, Object-Based Language". BIGRE Bulletin. 65. July 1989.
  • Tan Gon Kim and Bernard P. Zeigler. "The DEVS-Scheme Modelling and Simulation Environment". BIGRE Bulletin. 65. July 1989.
  • Guy Lapalme and Marc Feeley. "Micro-Scheme". BIGRE Bulletin. 65. July 1989.
  • Julia L. Lawall and Daniel P. Friedman. "Embedding the Self Language in Scheme". BIGRE Bulletin. 65. July 1989.
  • Andréa Pic and Michel Briand. "Visual Programming with Generators". BIGRE Bulletin. 65. July 1989.
  • J. C. Royer, J. P. Braquelaire, P. Casteran, M. Desainte-Catherine and J. G. Penaud. "Le modo'e(ga'le OBJScheme: principes et applications". BIGRE Bulletin. 65. July 1989.
  • Robert Strandh. "OOOZ, A multi-User Programming Environment Based on Scheme". BIGRE Bulletin. 65. July 1989.
  • Nitsan Séniak. "Compilation de Scheme par spécialisation explicite". BIGRE Bulletin. 65. July 1989.
  • John Wade Ulrich. "Enumeration Algorithms and Non-deterministic Programming in Scheme". BIGRE Bulletin. 65. July 1989.
  • Williams Ludwell Harrison III. "The Interprocedural Analysis and Automatic Parallellization of Scheme Programs". Lisp and Symbolic Computation: An International Journal. 2. 3/4. October 1989. Available online: .
  • John Franco and Daniel P. Friedman. "Towards A Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme". Journal of Computer Languages. 15. 1. 1990.
  • John Franco, Daniel P. Friedman and Steven D. Johnson. "Multi-way Streams in Scheme". Journal of Computer Languages. 15. 2. 1990. Available online: ps.
  • Dorai Sitaram and Matthias Felleisen. "Control Delimiters and Their Hierarchies". Lisp and Symbolic Computation: An International Journal. 3. 1. January 1990. Available online: .
  • Chris Hanson. "Efficient Stack Allocation for Tail-Recursive Languages". Proceedings of the 1990 ACM Conference on Lisp and Functional Programming. June 1990. Available online: ACM Digital Library.
  • Morry Katz and Daniel Weise. "Continuing Into the Future: On the Interaction of Futures and First-Class Continuations". Proceedings of the 1990 ACM Conference on Lisp and Functional Programming. June 1990. Available online: ACM Digital Library.
  • Dan Teodosiu. "HARE: A Compiler for Scheme". Masters Thesis. Master's Thesis. June 1990.
  • Pierre Bonzon. "A Metacircular Evaluator for a Logical Extension of Scheme". Lisp and Symbolic Computation: An International Journal. 3. 2. March 1990. Available online: .
  • R. Kent Dybvig and Robert Hieb. "Continuations and Concurrency". Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. March 1990. Available online: ACM Digital Library.
  • Alessandro Forin. "Futures". Topics in Advanced Language Implementation. 1991.
  • James S. Miller and Guillermo J. Rozas. "Free Variables and First-Class Environments". Lisp and Symbolic Computation: An International Journal. 3. 4. 1991.
  • Barak A. Pearlmutter and Kevin J. Lang. "The Implementation of Oaklisp". Topics in Advanced Language Implementation. 1991.
  • Uwe F. Pleban. "Compilation Issues in the Screme Implementation for the 88000". Topics in Advanced Language Implementation. 1991.
  • Dorai Sitaram and Matthias Felleisen. "Modeling Continuations Without Continuations". Proceedings of the Eighteenth ACM Symposium on Principles of Programming Languages. 1991. Available online: ACM Digital Library.
  • Brian Beckman. "A Scheme for Little Languages in Interactive Graphics". Software-Practice and Experience. 21. 2. Feb 1991.
  • Dan Teodosiu. "HARE: An Optimizing Portable Compiler for Scheme". ACM Sigplan Notices. 26. 1. Jan 1991. Available online: ps pdf.
  • Chris Hanson. "A Syntactic Closures Macro Facility". Lisp Pointers. IV. 4. October-December 1991. Available online: ps.
  • Fritz Henglein. "Global Tagging Optimization by Type Inference". Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. June 1992. Available online: ACM Digital Library.
  • Fritz Henglein and Jakob Rehof. "Safe polymorphic type inference for a Dynamically Typed Language: Translating Scheme to ML". ACM Conference on Functional Programming Languages and Computer Architecture (FPCA'95). 1995. Available online: ps pdf.
  • Rajeev J. Surati. "Practical Partial Evaluation". Masters Thesis. Massachussets Institute of Technology. May 1995. Available online: ps pdf.

April 11, 2002

  • Kurt Nørmark. "Web Programming in Scheme - the LAML approach". April 2002. Available online: ps pdf examples.
  • Olin Shivers. "History of T". 2001. Available online: html.

March 29, 2002

  • Manuel Serrano and Erick Gallesio. "This is Scribe!". Workshop on Scheme and Functional Programming (2002). October 2002. Available online: ps html.

March 14, 2002

  • Kurt Nørmark. "Programmatic WWW authoring using Scheme and LAML". WWW2002: The Eleventh International World Wide Web Conference. March 2002. Available online: html.

March 6, 2002

  • Oleg Kiselyov. "The SXML Specification, Revision 2.5". September 2002. Available online: html.

February 20, 2002

  • Daniel P. Friedman. "Applications of Continuations: Invited Tutorial". 1988 Principles of Programming Languages (POPL88). January 1988. Available online: ps pdf.
  • Olivier Danvy and Andrzej Filinski. "A Functional Abstraction of Typed Contexts". DIKU. DIKU Rapport 89/12. July 1989. Available online: ps.
  • Olivier Danvy and Andrzej Filinski. "Abstracting Control". 1990 ACM Conference on Lisp and Functional Programming. September 1990. Available online: ps.
  • Michael Sperber. "Computer-Assisted Lighting Design and Control". PhD. Thesis. University of Tübingen. June 2001. Available online: ps.

February 10, 2002

  • Kenichi Asai, Hidehiko Masuhara and Akinori Yonezawa. "Partial Evaluation of Call-by-value Lambda-calculus with Side-effects". ACM SIGPLAN Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97). June 1997. Available online: ps.
  • 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: ps.
  • Kenichi Asai, S. Matsuoka and Akinori Yonezawa. "Duplication and Partial Evaluation - For a Better Understanding of Reflective Languages". Lisp and Symbolic Computation. Vol. 9, Nos. 2/3. May/June 1996. Available online: ps.
  • 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: ps.
  • 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: ps.
  • Peter Ørbæk. "POPE: An On-line Partial Evaluator". University of Aarhus. June 1994. Available online: ps.
  • Michael Sperber and Peter Thiemann. "The Essence of LR Parsing". Partial Evaluation and Semantics-Based Program Manipulation PEPM '95. June 1995. Available online: ps.
  • Peter Thiemann and Robert Glück. "The Generation of a Higher-Order Online Partial Evaluator". Fuji Workshop on Functional and Logic Programming. July 1995. Available online: ps.
  • Michael Sperber, Robert Glück and Peter Thiemann. "Bootstrapping Higher-Order Program Transformers from Interpreters". Proceedings 11th Annual ACM Symposium on Applied Computing, SAC (SAC '96). February 1996. Available online: ps.
  • Peter Thiemann. "Cogen in Six Lines". Proc. ACM SIGPLAN International Conference on Functional Programming 1996. May 1996. Available online: ps.
  • Michael Sperber and Peter Thiemann. "Realistic Compilation by Partial Evaluation". Proc. of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation. May 1996. Available online: ps.
  • Peter Thiemann. "Towards Partial Evaluation of Full Scheme". Reflection'96. April 1996. Available online: ps.
  • Peter Thiemann and Michael Sperber. "Polyvariant Expansion and Compilergenerators". PSI-96: Andrei Ershov Second International Memorial Conference, Perspectives of System Informatics. June 1996. Available online: ps.
  • Peter Thiemann. "Implementing Memoization for Partial Evaluation". Programming Languages, Implementations, Logics, and Programs (PLILP '96). volume 1140 of Lecture Notes in Computer Science. September 1996. Available online: ps.
  • Michael Sperber and Peter Thiemann. "Two for the Price of One: Composing Partial Evaluation and Compilation". Proc. of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. June 1997. Available online: ps.
  • Michael Sperber, Peter Thiemann and Herbert Klaeren. "Distributed Partial Evaluation". Proc. of the Second International Symposium on Parallel Symbolic Computation, PASCO'97. July 1997. Available online: ps.
  • Simon Helsen and Peter Thiemann. "Two Flavors of Offline Partial Evaluation". Asian Computing Science Conference, ASIAN'98. December 1998. Available online: ps.
  • Peter Thiemann. "Higher-Order Code Splicing". European Symposium on Programming, ESOP '99. volume 1576 of Lecture Notes in Computer Science. March 1999. Available online: ps.
  • Peter Thiemann and Dirk Dussart. "Partial Evaluation for Higher-Order Languages with State". July 1999. Available online: ps.
  • Peter Thiemann. "The PGG System - User Manual". University at Freiburg. March 2000. Available online: ps html.
  • Peter Thiemann. "Compiling Adaptive Programs by Partial Evaluation". CC 2000. volume 1781 of Lecture Notes in Computer Science. March 2000. Available online: ps.
  • Simon Helsen and Peter Thiemann. "Fragmental Specialization". Semantics, Applications and Implementation of Program Generation (SAIG'00). volume 1927 of Lecture Notes in Computer Science. September 2000. Available online: ps.

February 9, 2002

  • Mikael Hansen, Paw Iversen and Jimmy Juncker. "SLAML - Server side LAML (Preliminary Masters Thesis Report)". Aalborg University. January 2002. Available online: ps.
  • Scott G. Miller. "SISC: A Complete Scheme Interpreter in Java". January 2002. Available online: ps pdf.
  • Kurt Nørmark. "Simulation of Object-oriented Concepts and Mechanisms in Scheme". Aalborg University. R-90-01. 1990. Available online: ps.
  • Jonathan A. Rees, Norman I. Adams IV and James R. Meehan. "The T manual". Yale University Computer Science Department. 1984. Available online: text pdf.

February 2, 2002

  • Oleg Kiselyov. "The SXML Specification, Revision 2.5". September 2002. Available online: html.
  • Oleg Kiselyov. "Literate XML/DTD programming". April 2001. Available online: html.
  • Oleg Kiselyov. "HTML/XML authoring in Scheme". February 2001. Available online: html.

January 30, 2002

  • Oleg Kiselyov. "A better XML parser through functional programming". Fourth International Symposium on Practical Aspects of Declarative Languages (PADL '02). January 2002. Available online: ps slides.
  • Oleg Kiselyov. "Re-writing abstractions, or Lambda: the ultimate pattern macro". December 2001. Available online: html.
  • Oleg Kiselyov. "Monadic Programming in Scheme". January 2002. Available online: html.

January 23, 2002

  • Frédéric Peschanski, Christian Queinnec and Jean-Pierre Briot. "A typeful composition model for dynamic software architectures". July 2001. Available online: ps pdf.

January 15, 2002

  • Christian Queinnec. "Continuations and conversations". 9th International Conference, AIMSA 2000. number 1904 in Lecture Notes in Artificial Intelligence. September 2000.
  • Christian Queinnec. "Fast and compact dispatching for dynamic object-oriented languages". Information Processing Letters. 64(6). January 1998. Available online: ps.
  • Christian Queinnec and David DeRoure. "Sharing code through first-class environments". Proceedings of ICFP'96 International Conference on Functional Programming. May 1996. Available online: ps.
  • Christian Queinnec. "Macroexpansion reflective tower". Proceedings of the Reflection'96 Conference. April 1996. Available online: ps.
  • Christian Queinnec and Pierre Weis. "Programmation applicative, état des lieux et perspectives". Technique et science informatiques. 15(7). 1996. Available online: ps pdf.
  • Sophie Anglade, Jean-Jacques Lacrampe and Christian Queinnec. "Semantics of combinations in scheme". Lisp Pointers. 7(4). October-December 1995. Available online: ps pdf.
  • Christian Queinnec. "Locality, causality and continuations". LFP '94 - ACM Symposium on Lisp and Functional Programming. June 1994. Available online: ps pdf.
  • Christian Queinnec. "A library of high-level control operators". Lisp Pointers. 6(4). October 1993. Available online: ps pdf.
  • Christian Queinnec. "Continuation conscious compilation". Lisp Pointers. 6(1). January 1993. Available online: ps pdf.
  • Christian Queinnec. "Literate programming from scheme to TEX". Laboratoire d'Informatique de l'École Polytechnique. Research Report LIX RR 93.05. November 1993.
  • Christian Queinnec. "Designing MEROON v3". Object-Oriented Programming in Lisp: Languages and Applications. September 1993. Available online: ps.
  • Christian Queinnec and Jean-Marie Geffroy. "Partial evaluation applied to symbolic pattern matching with intelligent backtrack". WSA '92--Workshop on Static Analysis. September 1992. Available online: ps pdf.
  • Christian Queinnec. "Value transforming style". WSA '92--Workshop on Static Analysis. September 1992. Available online: .
  • Christian Queinnec. "Value transforming style". Laboratoire d'Informatique de l'École Polytechnique. Research Report LIX RR 92/07. May 1992. Available online: ps pdf.
  • Christian Queinnec. "Continuation sensitive compilation". Laboratoire d'Informatique de l'École Polytechnique. Research Report LIX RR 92/14. November 1992. Available online: ps pdf.
  • Christian Queinnec and Bernard Serpette. "A Dynamic Extent Control Operator for Partial Continuations". POPL '91 - Eighteenth Annual ACM symposium on Principles of Programming Languages. January 1991. Available online: ps pdf.
  • Christian Queinnec and Julian Padget. "Modules, macros and Lisp". Eleventh International Conference of the Chilean Computer Science Society. October 1991. Available online: ps.
  • Christian Queinnec and Julian Padget. "A proposal for a modular Lisp with macros and dynamic evaluation". Journées de Travail sur l'Analyse Statique en Programmation Équationnelle, Fonctionnelle et Logique. October 1991. Available online: .
  • Christian Queinnec. "MEROON: A small, efficient and enhanced object system". École Polytechnique. Technical Report LIX.RR.92.14. November 1991. Available online: ps.
  • Christian Queinnec. "Struggle, The First Denotational Game". EuroPal '90 - European Conference on Lisp and its Practical Applications. March 1990. Available online: ps.
  • 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: ps.
  • Christian Queinnec. "Compilation of Non-Linear, Second Order Patterns on S-Expressions". International Workshop PLILP '90 - Programming Language: Implementation and Logic Programming. Lecture Notes in Computer Science 456. August 1990. Available online: ps.
  • Christian Queinnec. "Validation Suite Generation". Revue Bigre+Globule. (65). July 1989. Available online: ps.
  • Suresh Jagannathan and Andrew K. Wright. "Polymorphic Splitting: An Effective Polyvariant Flow Analysis". ACM Transactions on Programming Languages and Systems. March 1998. Available online: ps.
  • Suresh Jagannathan and Andrew K. Wright. "Flow-Directed Inlining". ACM Symposium on Programming Language Design and Implementation (PLDI96). May 1996. Available online: ps.
  • Suresh Jagannathan and Andrew K. Wright. "Compiling with Flow Analysis". ACM Computing Surveys. June 1996. Available online: ps.
  • Suresh Jagannathan and Andrew K. Wright. "Effective Flow Analysis for Avoiding Runtime Checks". 2nd International Static Analysis Symposium. LNCS 983. September 1995. Available online: ps.
  • Suresh Jagannathan and Andrew K. Wright. "Flow-Directed Inlining". ACM Symposium on Programming Language Design and Implementation (PLDI96). May 1996. Available online: ps.
  • Suresh Jagannathan. "Meta-Level Building Blocks for Modular Systems". ACM Transactions on Programming Languages and Systems. May 1994. Available online: ps.
  • Suresh Jagannathan. "Dynamic Modules in Higher-Order Languages". IEEE International Conference on Computer Languages. May 1994. Available online: ps.
  • Suresh Jagannathan. "Reflective Building Blocks for Modular Systems". International Workshop on Reflection and Meta-Level Architectures. November 1992. Available online: ps.
  • Suresh Jagannathan and Gul Agha. "A Reflective Model of Inheritance". European Conference on Object-Oriented Programming (ECOOP 92). LNCS 615. June 1992. Available online: ps.
  • Suresh Jagannathan. "Customization of First-Class Tuple-Spaces in a Higher-Order Language". Parallel Languages and Architectures. LNCS 506. June 1991. Available online: ps.
  • Suresh Jagannathan. "Optimizing Analysis for First-Class Tuple-Spaces". 3rd Workshop on Parallel Languages and Compilers. August 1990. Available online: ps.
  • Suresh Jagannathan. "Coercion as a Metaphor for Computation". IEEE International Conference on Computer Languages. August 1990. Available online: ps.
  • Suresh Jagannathan, David Gelernter and Tom London. "Environments as First-Class Objects". ACM Conference on Principles of Programming Languages (POPL87). January 1987. Available online: ps.
  • Luc Moreau and Christian Queinnec. "Partial Continuations as the Difference of Continuations". International Conference on Programming Language Implementation and Logic Programming (PLILP'94). number 844 in Lecture Notes in Computer Science. September 1994. Available online: ps pdf.
  • Luc Moreau. "A Syntactic Theory of Dynamic Binding". University of Southampton. Technical Report M96/4. 1996. Available online: ps.
  • Luc Moreau. "A Syntactic Theory of Dynamic Binding". International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97). volume 1214 of Lecture Notes in Computer Science. April 1997. Available online: ps.
  • Luc Moreau, Daniel Ribbens and Pascal Gribomont. "Advanced Programming Techniques Using Scheme". Journées Francophones des Languages Applicatifs, Collection Didactique. February 1998. Available online: ps.
  • Luc Moreau. "A Syntactic Theory of Dynamic Binding". Higher-Order and Symbolic Computation. 11(3):233-279. December 1998.

Hosted by concurrency.cc.

Last modified: Saturday, August 11th, 2012 4:55:45pm
HTML generated using WebIt!.

\ No newline at end of file