Skip to content

Latest commit

 

History

History
85 lines (84 loc) · 19.5 KB

page2.md

File metadata and controls

85 lines (84 loc) · 19.5 KB
Raw

Scheme, Language Features, and Semantics

  • R. Kent Dybvig. "The Scheme Programming Language, Second Edition". 1996. Available online: html.
  • Jacob Matthews and Robert Bruce Findler. "An Operational Semantics for R5RS Scheme". 2005 Workshop on Scheme and Functional Programming. September 2005. Available online: ps pdf.
  • Olivier Danvy. "Towards compatible and interderivable semantic specifications for the Scheme programming language, part I: abstract machines, natural semantics, and denotational semantics". 2008 Workshop on Scheme and Functional Programming. September 2008. Available online: pdf.
  • Małgorzata Biernacka and Olivier Danvy. "Towards compatible and interderivable semantic specifications for the Scheme programming language, part II: reduction semantics and abstract machines". 2008 Workshop on Scheme and Functional Programming. September 2008. Available online: pdf.
  • Patrick Meredith, Mark Hills, and Grigore Rosu. "An Executable Rewriting Logic Semantics of K-Scheme". 2007 Workshop on Scheme and Functional Programming. September 2007. Available online: pdf.
  • Ken Dickey. "The Scheme Programming Language". Computer Language. June 1992. Available online: ps.
  • Norman I. Adams IV, Pavel Curtis and Mike Spreitzer. "First-class Data-type Representations in SchemeXerox". June 1993. Available online: ps.
  • Matthias Felleisen. "Lambda-v-CS: An Extended Lambda-Calculus for Scheme". Proceedings of the 1988 ACM conference on LISP and functional programming. July 1988. Available online: ACM Digital Library.
  • 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.
  • Ian A. Mason. "The Semantics of Destructive Lisp". PhD. Thesis. Stanford University. 1986. Available online: pdf.
  • Carolyn Talcott. "The essence of Rum: A theory of the intensional and extensional aspects of Lisp-type computation". PhD. Thesis. Stanford University. August 1985. Available online: pdf.
  • Carolyn Talcott. "Programming and Proving with Function and Control Abstractions". Stanford University. CS-TR-89-1288. October 1989. Available online: pdf.
  • Matthias Felleisen. "(Y Y) Works! A Lecture on the Why of Y". Sept 1991. Available online: ps.
  • Matthias Felleisen and Robert Hieb. "The Revised Report on the Syntactic Theories of Sequential Control and State". Rice University. June 1989. Available online: ps.
  • Eric T. Freeman and Daniel P. Friedman. "Characterizing the Paralation Model using Dynamic Assignment". Computer Science Department, Indiana University. TR-348. March 1992. Available online: ps.
  • Shin-Der Lee and Daniel P. Friedman. "First-Class Extents". Computer Science Department, Indiana University. TR-350. March 1992. Available online: ps.
  • Shin-Der Lee and Daniel P. Friedman. "Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes". Computer Science Department, Indiana University. October 1992. Available online: ps.
  • John D. Ramsdell. "An Operational Semantics for Scheme". Lisp Pointers V(2). April-June 1992. Available online: ps.
  • John D. Ramsdell. "Scheme: The Next Generation". Lisp Pointers, Vol. VII, No. 4. October-December 1994. Available online: ps.
  • William D. Clinger. "Proper tail recursion and space efficiency". Proceedings of the 1998 ACM Conference on Programming Language Design and Implementation. June 1998. Available online: ps.
  • Jonathan A. Rees. "User-defined data types". Lisp Pointers. 'The Scheme of Things' (column). 1993. Available online: ps.
  • Guillermo J. Rozas. "Taming the Y Operator". Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. June 1992. Available online: ps.
  • Guy Lewis Steele, Jr. and Richard Gabriel. "The Evolution of LISP". ACM SIGPLAN Notices, Vol 28(3), 231-270. March 1993. Available online: ps.
  • Carl Bruggeman, Oscar Waddell and R. Kent Dybvig. "Representing Control in the Presence of One-Shot Continuations". ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation. June 1996. Available online: ps.
  • J. Michael Ashley and R. Kent Dybvig. "An Efficient Implementation of Multiple Return Values in Scheme". 1994 ACM Conference on LISP and Functional Programming. June 1994. Available online: pdf.
  • Robert Hieb, R. Kent Dybvig and Claude W. Anderson III. "Subcontinuations". Lisp and Symbolic Computation. 7, 1. January 1994. Available online: ps.
  • R. Kent Dybvig and Robert Hieb. "A New Approach to Procedures with Variable Arity". Lisp and Symbolic Computation. 3, 3. September 1990. Available online: ps.
  • R. Kent Dybvig. "Chez Scheme User's Guide". 1998. Available online: html.
  • Alan Bawden. "Quasiquotation in Lisp". 1999. Available online: ps.
  • Alan Bawden. "Quasiquotation in Lisp". Partial Evaluation and Program Manipulation (PEPM99). 1999. Available online: ps.
  • 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, Norman I. Adams IV and James R. Meehan. "The T manual". Yale University Computer Science Department. 1984. Available online: text pdf.
  • Stephen Slade. "The T Programming Language: A Dialect of LISP". 1987.
  • Olin Shivers. "History of T". 2001. Available online: html.
  • Christian Queinnec and Pierre Weis. "Programmation applicative, etat 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. "A library of high-level control operators". Lisp Pointers. 6(4). October 1993. 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.
  • 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. "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 ees 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.
  • Gerald Jay Sussman. "LISP, Programming and Implementation". Functional Programming and its Applications. 1982.
  • 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.
  • 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.
  • 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. "SCHEME Version 3.1 Reference Manual". Indiana University. Computer Science Technical Report 93. June 1980.
  • "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.
  • 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.
  • 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.
  • 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 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.
  • 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.
  • 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.
  • Alain Deutsch, Renaud Dumeur, Charles Consel and Jean-Daniel Fekete. "CSKIM: An Extended Dialect of Scheme". BIGRE Bulletin. 65. July 1989.
  • Guy Lapalme and Marc Feeley. "Micro-Scheme". BIGRE Bulletin. 65. July 1989.
  • 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: .
  • James S. Miller and Guillermo J. Rozas. "Free Variables and First-Class Environments". Lisp and Symbolic Computation: An International Journal. 3. 4. 1991.
  • Robert Bruce Findler and Matthias Felleisen. "Contracts for Higher-Order Functions". International Conference on Functional Programming (ICFP2002). October 2002. Available online: ps pdf.
  • Robert Bruce Findler and Matthias Felleisen. "Contracts for Higher-Order Functions". University of Chicago. October 2002. Available online: ps pdf.
  • Robert Bruce Findler. "Behavioral Software Contracts". PhD. Thesis. Rice University. May 2002. Available online: ps pdf.
  • Robert Bruce Findler, Matthias Blume and Matthias Felleisen. "An Investigation of Contracts as Projections". University of Chicago. TR-2004-02. April 2004. Available online: ps pdf.
  • Philip Wadler and Robert Bruce Findler. "Well-typed programs can't be blamed". 2007 Workshop on Scheme and Functional Programming. September 2007. Available online: pdf.
  • Christophe Scholliers, Eric Tanter and Wolfgang De Meuter. "Computational Contracts". 2011 Workshop on Scheme and Functional Programming. October 2011. Available online: pdf.
  • Sebastian Egner, Richard A. Kelsey and Michael Sperber. "Cleaning up the Tower: Numbers in Scheme". 2004 Scheme Workshop. September 2004. Available online: ps pdf.
  • John Clements and Matthias Felleisen. "A Tail-Recursive Machine with Stack Inspection". Transactions on Programming Languages and Systems. 2004. Available online: pdf.
  • Gregory H. Cooper and Shriram Krishnamurthi. "Embedding Dynamic Dataflow in a Call-by-Value Language". European Symposium on Programming, 2006. 2006. Available online: downloadable paper.
  • Jeremy G. Siek and Walid Taha. "Gradual Typing for Functional Languages". 2006 Workshop on Scheme and Functional Programming. September 2006. Available online: pdf.