Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Implementation  





2 References  





3 External links  














Scheme 48







 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Scheme 48
ParadigmsMulti: functional, procedural, meta
FamilyLisp
Designed byRichard Kelsey,
Jonathan Rees
DevelopersRichard Kelsey,
Jonathan Rees
First appearedMarch 1987; 37 years ago (1987-03)
Stable release

1.9.2 / 12 April 2014; 10 years ago (2014-04-12)

Typing disciplineDynamic, strong, Latent
ScopeLexical
OSCross-platform
LicenseBSD
Websites48.org

Scheme 48 is a programming language, a dialect of the language Scheme, an implementation using an interpreter which emits bytecode.[2] It has a foreign function interface for calling functions from the language C[3] and comes with a library for regular expressions (regex),[4] and an interface for Portable Operating System Interface (POSIX).[5] It is supported by the portable Scheme library SLIB, and is the basis for the Scheme shell Scsh.[2] It has been used in academic research.[6] It is free and open-source software released under a BSD license.

It is called "Scheme 48" because the first version was written in 48 hours in August 1986.[7] The authors now[when?] say it is intended to be understood in 48 hours.[citation needed]

Implementation

[edit]

Scheme 48 uses a virtual machine to interpret the bytecode, which is written in a restricted dialect of Scheme called PreScheme, which can be translated to C and compiled to a native binary. PreScheme, or Pre-Scheme, is a statically-typed dialect of Scheme with the efficiency and low-level machine access of C while retaining many of the desirable features of Scheme.

Pre-scheme was quite interesting. Kelsey published a paper on it, as well, I believe. It was Scheme in the sense that you could load it into a Scheme system and run the code. But it was restrictive – it required you to write in a fashion that allowed complete Hindley-Milner static type inference, and all higher-order procedures were beta-substituted away at compile time, meaning you could *straightforwardly* translate a prescheme program into "natural" C code with C-level effiency [sic]. That is, you could view prescheme as a really pleasant alternative to C for low-level code. And you could debug your prescheme programs in the interactive Scheme development environment of your choice, before flipping a switch and translating to C code, because prescheme was just a restricted Scheme. The Scheme 48 byte-code interpreter was written in prescheme. Prescheme sort of died – beyond the academic paper he wrote, Kelsey never quite had the time to document it and turn it into a standalone tool that other people could use (Ian Horswill's group at Northwestern is an exception to that claim – they have used prescheme

— Olin Shivers, "Olin Shivers: History of T"[8]

References

[edit]
  1. ^ R5RS claim at project website
  • ^ a b Kelsey, Richard; Rees, Jonathan. "Scheme 48". S48.org. Retrieved 2018-12-05.
  • ^ Kelsey, Richard; Rees, Jonathan; Sperber, Mike (10 January 2008). "The Incomplete Scheme 48 Reference Manual for release 1.8: Mixing Scheme 48 and C". S48.org. Retrieved 2018-12-05., Chapter 8 in manual for version 1.8.
  • ^ Kelsey, Richard; Rees, Jonathan; Sperber, Mike (10 January 2008). "The Incomplete Scheme 48 Reference Manual for release 1.8: Regular Expressions". S48.org. Retrieved 2018-12-05., Chapter 5 in manual for version 1.8.
  • ^ Kelsey, Richard; Rees, Jonathan; Sperber, Mike (10 January 2008). "The Incomplete Scheme 48 Reference Manual for release 1.8: Access to POSIX". S48.org. Retrieved 2018-12-05., Chapter 9 in manual for version 1.8.
  • ^ Final shift for call/cc: direct implementation of shift and reset
  • ^ Rees, Jonathan A. "JAR's Scheme 48 Page". Jonathan A. Rees. Mumble.net. Retrieved 2018-12-05.
  • ^ Shivers, Olin. "Olin Shivers: History of T". PaulGraham.com. Retrieved 2018-12-05.
  • [edit]
  • t
  • e

  • Retrieved from "https://en.wikipedia.org/w/index.php?title=Scheme_48&oldid=1140848657"

    Categories: 
    Scheme (programming language) interpreters
    Scheme (programming language) implementations
    Software using the BSD license
    Free and open-source software stubs
    Hidden categories: 
    Articles with short description
    Short description matches Wikidata
    All articles with vague or ambiguous time
    Vague or ambiguous time from July 2018
    All articles with unsourced statements
    Articles with unsourced statements from November 2011
    Official website different in Wikidata and Wikipedia
    All stub articles
     



    This page was last edited on 22 February 2023, at 02:13 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki