Home
Music_Metasearch
Music Top Sites
Music Store
AllMusicListings
Concert Listings
Concert Tickets
AllMusicTalk
Chat Rooms
Message Boards
MusicNews
Pop Music News
Pop Music Reviews
Music Business
MP3 News
Community
Blogs
Free Member Blogs
AllMusicPages
Free Web Pages
AllMusicBookmarks
Your Bookmarks
AllMusicFun
Musical Postcards
Relationship Test
Tarot Readings
Numerology
Music Auctions
Auctions
Classifieds
Music Apparel
AllMusicSearch Apparel
Music Store
MP3 Players
Audio Equipment
MP3 Software
Musical Instruments
Music Books
Music Magazines
Music T-Shirts
Alternative Rock
Blues
Broadway & Vocal
Children's
Christian & Gospel
Classic Rock
Classical
Country
Dance & DJ
Folk
Hard Rock & Metal
International
Jazz
Latin Music
Miscellaneous
New Age
Opera & Vocal
Pop
R&B
Rap & Hip-Hop
Rock
Soundtracks
Music Videos
Music DVDs
Research (10)
A paper by Will Clinger (1991) which describes an alternative to the low-level macro facility described in the R4RS. The macrology is based upon the explicit renaming of identifiers.
ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/exrename.ps.gz
Will Clinger's revised (as of 19 Oct 1998) notes on the Scheme Workshop before ICFP '98 in Baltimore. Many of the subjects discussed at the workshop are now under active discussion as SRFIs.
http://www.schemers.org/Events/Workshops/Sep1998/minutes
Scheme code for Daniel P. Friedman's various transformations on interpreters he presented at the 1996 Scheme Workshop.
http://www.cs.indiana.edu/~dfried/dfried/trans/
A paper by Will Clinger and Jonathan Rees (1991) which describes a modified form of Kohlbecker's algorithm for reliably hygienic macro expansion in block-structured languages where macros are source-to-source transformations specified using a high-level p
ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/macros_that_work.tex.gz
A paper by Will Clinger (1991) explaining the Scheme hygienic macro system by comparison with the Common Lisp macrology. In GZipped PostScript form.
ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/macinsch.ps.gz
A paper by Will Clinger (1998) which offers an implementation independent definition of proper tail recursion for Scheme. In Gzipped PostScript form.
ftp://ftp.ccs.neu.edu/pub/people/will/tail.ps.gz
Archive contains freely available technical reports and published papers, as well as PhD dissertations, written by members of the Rice Programming Languages Team.
http://www.cs.rice.edu/CS/PLT/Publications/Scheme/
(Postscript) A paper by Matthias Blume (1997) which presents an outline of a module system for Scheme to solve several problems encountered with contemporary implementations.
http://citeseer.ist.psu.edu/rd/0%2C95701%2C1%2C0.25%2CDownload/http://citeseer.ist.psu.edu/cache/papers/cs/886/ftp:zSzzSzftp.cs.indiana.eduzSzindrazSzscheme-repositoryzSzdoczSzpropzSzblume-mod.pdf/blume94separate.pdf
Larceny is a simple and efficient run-time system for Scheme, currently running on the SPARC architecture. A portable implementation that generates C (dubbed "Petit Larceny") is also being developed.
http://www.ccs.neu.edu/home/will/Larceny/index.html
R. Kent Dybvig's PhD dissertation (1987) which presents three implementation models for Scheme, a stack-based model, a string-based model, and a heap-based model.
http://www.cs.indiana.edu/~dyb/pubs/3imp.pdf
Last Updated: 2008-03-05 15:35:04
|
The content of this directory is based on the Open Directory and has been modified by AllMusicSearch.com editors
