Racket (programming language)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Racket
Racket-logo.svg
Drracket.png
DrRacket on Ubuntu
ParadigmMulti-paradigm: functional, imperative, logic, meta, modular, object-oriented, reflective
Designed byPLT Inc.
DeveloperPLT Inc.
First appeared1995; 24 years ago (1995)
Stable release
7.2[1] / January 30, 2019; 4 days ago (2019-01-30)
Typing disciplineDynamic, static, strong
Platformx86, PowerPC, SPARC, MIPS, ARM
OSCross-platform
LicenseLGPL
Filename extensions.rkt, .rktl, .rktd, .scrbl, .plt, .ss, .scm
Websiteracket-lang.org
Dialects
FrTime, Lazy Racket, Typed Racket, Scribble
Influenced by
Eiffel,[2] Scheme
Influenced
Clojure,[3] Rust,[4][5] Scheme[6]

Racket (formerly PLT Scheme) is a general-purpose, multi-paradigm programming language based on the Scheme dialect of Lisp. It is designed to be a platform for programming language design and implementation.[7][8] Racket is also used for scripting, computer science education, and research.

The Racket platform provides an implementation of the Racket language (including a run-time system,[9] libraries, and JIT compiler) along with the DrRacket integrated development environment (IDE) written in Racket.[10] Racket is used by the ProgramByDesign outreach program, which aims to turn computer science into "an indispensable part of the liberal arts curriculum".[11][12]

The core Racket language is known for its extensive macro system which enables creating embedded and domain-specific languages, language constructs such as classes or modules, and separate dialects of Racket with different semantics.[13][14][15][16]

The platform distribution is free and open-source software distributed under the GNU Lesser General Public License (LGPL).[17] Extensions and packages written by the community may be uploaded to Racket's package catalog.

History[edit]

Development[edit]

Matthias Felleisen founded PLT in the mid 1990s, first as a research group, soon after as a project dedicated to producing pedagogic materials for novice programmers (lectures, exercises/projects, software). In January 1995, the group decided to develop a pedagogic programming environment based on Scheme. Matthew Flatt cobbled together MrEd, the original virtual machine for Racket, from libscheme,[18] wxWidgets, and a few other free systems.[19] In the years that followed, a team including Flatt, Robby Findler, Shriram Krishnamurthi, Cormac Flanagan, and many others produced DrScheme, a programming environment for novice Scheme programmers and a research environment for soft typing.[10] The main development language that DrScheme supported was named PLT Scheme.

In parallel, the team began conducting workshops for high school teachers, training them in program design and functional programming. Field tests with these teachers and their students provided essential clues for directing the development.

Over the following years, PLT added teaching languages, an algebraic stepper,[20] a transparent read–eval–print loop, a constructor-based printer, and many other innovations to DrScheme, producing an application-quality pedagogic program development environment. By 2001, the core team (Felleisen, Findler, Flatt, Krishnamurthi) had also written and published their first textbook, How to Design Programs, based on their teaching philosophy.

Version history[edit]

The first generation of PLT Scheme revisions introduced features for programming in the large with both modules and classes. Version 42 introduced units – a first-class module system – to complement classes for large scale development.[21] The class system gained features (e.g. Java-style interfaces) and also lost several features (e.g. multiple inheritance) throughout these versions.[13] The language evolved throughout a number of successive versions, and gaining milestone popularity in Version 53, leading to extensive work and the following Version 100, which would be equivalent to a "1.0" release in current popular version systems.

The next major revision was named Version 200, which introduced a new default module system that cooperates with macros.[21] In particular, the module system ensures that run-time and compile-time computation are separated to support a "tower of languages".[22] Unlike units, these modules are not first-class objects.

Version 300 introduced Unicode support, foreign library support, and refinements to the class system.[21] Later on, the 300 series improved the performance of the language runtime with an addition of a JIT compiler and a switch to a default generational garbage collection.

By the next major release, the project had switched to a more conventional sequence-based version numbering. Version 4.0 introduced the #lang shorthand to specify the language that a module is written in. Further, the revision introduced immutable pairs and lists, support for fine-grained parallelism, and a statically-typed dialect.[23]

On June 7, 2010, PLT Scheme was renamed Racket.[24] The renaming coincided with the release of Version 5.0. Subsequently, the graphical user interface (GUI) backend was rewritten in Racket from C++ in Version 5.1 using native UI toolkits on all platforms.[19] Version 5.2 included a background syntax checking tool, a new plotting library, a database library, and a new extended REPL.[25] Version 5.3 included a new submodule feature for optionally loaded modules,[26] new optimization tools, a JSON library, and other features.[27] Version 5.3.1 introduced major improvements to DrRacket: the background syntax checker was turned on by default and a new documentation preview tool was added.[28]

In version 6.0, Racket released its second-generation package management system. As part of this development, the principal DrRacket and Racket repository was reorganized and split into a large set of small packages, making it possible to install a minimal racket and to install only those packages needed.[29]

Version 7 of Racket was released with a new macro expander written in Racket as part the preparations for supporting moving to the Chez Scheme runtime system and supporting multiple runtime systems.[30]

Features[edit]

Main article: Racket features

Racket's core language includes macros, modules, lexical closures, tail calls, delimited continuations,[31] parameters (fluid variables), software contracts,[32] green and OS threads,[33][34][35] and more. The language also comes with primitives, such as eventspaces and custodians, which control resource management and enables the language to act like an operating system for loading and managing other programs.[9] Further extensions to the language are created with the powerful macro system, which together with the module system and custom parsers can control all aspects of a language.[36] Unlike programming languages that lack macro systems, most language constructs in Racket are written on the base language using macros. These include a mixin class system,[13] a component (or module) system as expressive as ML's opaque ascription,[14] and pattern matching.

Further, the language features the first contract system for a higher-order programming language.[37] Racket's contract system is inspired by the Design by Contract work for Eiffel and extends it to work for higher-order values such as first-class functions, objects, reference cells, and so on. For example, an object that is checked by a contract can be ensured to make contract checks when its methods are eventually invoked.

Racket includes both bytecode and JIT (JIT) compilers. The bytecode compiler that translates to an internal bytecode format that is run by the Racket virtual machine, with the JIT compiler transtating bytecoder to native code on x86, x86-64, ARM and PowerPC platforms at runtime.

Since 2004, the language has also shipped with PLaneT, a package manager that is integrated into the module system so that third-party libraries can be transparently imported and used. Also, PLaneT has a built-in versioning policy to prevent dependency hell.[38]

At the end of 2014, much of Racket's code was moved into a new packaging system separate from the main code base. This new packaging system is serviced by a client program named raco. The new package system provides fewer features than PLaneT; a blog post by Jay McCarthy on the Racket blog explains the rationale for the change and how to duplicate the older system.[39]

Macros and extensibility[edit]

See also: Racket language extensions

The feature that distinguishes Racket from other languages in the Lisp family is its integrated language extensibility. Racket's extensibility features are built into the module system to allow context-sensitive and module-level control over syntax.[15] For example, the #%app syntactic form can be overridden to change the semantics of function application. Similarly, the #%module-begin form allows arbitrary static analysis of the entire module.[15] Since any module can be used as a language, via the #lang notation, this effectively means that virtually any aspect of the language can be programmed and controlled.

The module-level extensibility features are combined with a Scheme-like hygienic macro system, which provides more features than Lisp's s-expression manipulation system,[40][41] Scheme 84's hygienic extend-syntax macros, or R5RS's syntax-rules. Indeed, it is fair to say that the macro system is a carefully tuned application programming interface (API) for compiler extensions. Using this compiler API, programmers can add features and entire domain-specific languages in a manner that makes them completely indistinguishable from built-in language constructs.

The macro system in Racket has been used to construct entire language dialects. This includes Typed Racket—a statically typed dialect of Racket that eases the migration from untyped to typed code,[42] and Lazy Racket—a dialect with lazy evaluation.[43] Other dialects include FrTime (functional reactive programming), Scribble (documentation language),[44] Slideshow (presentation language),[45] and several languages for education.[46][47] Racket's core distribution provides libraries to aid the process of constructing new programming languages.[15]

Such languages are not restricted to s-expression based syntax. In addition to conventional readtable-based syntax extensions, Racket's #lang makes it possible for a language programmer to define any arbitrary parser, for example, using the parser tools library.[48] See Racket logic programming for an example of such a language.

Programming environment[edit]

The language platform provides a self-hosted IDE[10] named DrRacket, a continuation-based web server,[49] a graphical user interface,[19] and other tools. Racket is also a viable scripting tool and can be used for scripting the Unix shell. It can parse command line arguments, execute external tools and includes libraries like all common scripting languages.

DrRacket IDE[edit]

DrRacket (formerly DrScheme) is widely used among introductory computer science courses that teach Scheme or Racket and is lauded for its simplicity and appeal to beginner programmers. The IDE was originally built for use with the TeachScheme! project (now ProgramByDesign), an outreach effort by Northeastern University and a number of affiliated universities for attracting high school students to computer science courses at the college level.

The editor provides source highlighting for syntax and run-time errors, parenthesis matching, a debugger and an algebraic stepper. Its student-friendly features include support for multiple "language levels" (Beginning Student, Intermediate Student and so on). It also has integrated library support, and sophisticated analysis tools for advanced programmers. Further, module-oriented programming is supported with the module browser, a contour view, integrated testing and coverage measurements, and refactoring support. It provides integrated, context-sensitive access to an extensive hyper-linked help system named "Help Desk".

DrRacket is available for Windows, macOS, Unix, and Linux with the X Window System and programs behave similarly on all these platforms.

Code examples[edit]

Here is a trivial hello world program: 

#lang racket/base
"Hello, World!"

Running this program produces the output:

"Hello, World!"


Here is a slightly less trivial program:

The result of this program, as shown in DrRacket
#lang racket
(require 2htdp/image)

(let sierpinski ([n 8])
  (if (zero? n)
    (triangle 2 'solid 'red)
    (let ([t (sierpinski (- n 1))])
      (freeze (above t (beside t t))))))

This program, taken from the Racket website, draws a Sierpinski triangle, nested to depth 8.

Using the #lang directive, a source file can be written in different dialects of Racket. Here is an example of the factorial program in Typed Racket, a statically typed dialect of Racket: 

#lang typed/racket

(: fact (Integer -> Integer))
(define (fact n)
  (cond [(zero? n) 1]
        [else (* n (fact (- n 1)))]))

Applications and practical use[edit]

Apart from having a basis in programming language theory, Racket was designed to be used as a general-purpose language in production systems. Thus, the Racket distribution features an extensive library that covers systems and network programming, web development,[49] a uniform interface to the underlying operating system, a dynamic foreign function interface,[50] several flavours of regular expressions, lexer/parser generators,[48] logic programming, and a complete GUI framework.

Racket has several features useful for a commercial language, among them an ability to generate standalone executables under Windows, macOS, and Unix, a profiler and debugger included in the integrated development environment (IDE), and a unit testing framework.

Racket has been used for commercial projects and web applications. A notable example is the Hacker News website, which runs on Arc, which is developed in Racket. Naughty Dog has used it as a scripting language in several of their video games.[51]

Racket is used to teach students algebra through game design in the Bootstrap program.[52]

References[edit]

  1. ^ "Racket v7.2". The Racket Blog.
  2. ^ Strickland, T.S.; Fellesisen, Matthias (2010). "DLS 2010: Contracts for First-Class Classes" (PDF).
  3. ^ Bonnaire-Sergeant, Ambrose (2012). A Practical Optional Type System for Clojure (Thesis). The University of Western Australia.
  4. ^ "Planet2 questions".
  5. ^ "Rust Bibliography".
  6. ^ Sperber, Michael; Dybvig, R. Kent; Flatt, Matthew; Van Straaten, Anton; et al. (August 2007). "Revised6 Report on the Algorithmic Language Scheme (R6RS)". Scheme Steering Committee. Retrieved 2011-09-13.
  7. ^ "Welcome to Racket". Retrieved 2011-08-15.
  8. ^ "Dialects of Racket and Scheme". Retrieved 2011-08-15.
  9. ^ a b Flatt; Findler; Krishnamurthi; Felleisen (1999). Programming Languages as Operating Systems (or, Revenge of the Son of the Lisp Machine). International Conference on Functional Programming.
  10. ^ a b c Findler; Clements; Flanagan; Flatt; Krishnamurthi; Steckler; Felleisen (2001). "DrScheme: A Programming Environment for Scheme" (PDF). Journal of Functional Programming.
  11. ^ Felleisen; Findler; Flatt; Krishnamurthi (2004). "The TeachScheme! Project: Computing and Programming for Every Student". Journal of Computer Science Education.
  12. ^ "Overview". Program by Design. Retrieved 2011-08-17.
  13. ^ a b c Flatt, M.; Findler, R. B.; Felleisen, M. (2006). "Scheme with Classes, Mixins, and Traits" (PDF). Asian Symposium on Programming Languages and Systems.
  14. ^ a b Flatt, M.; Felleisen, M. (1998). "Units: Cool Modules for Hot Languages". Programming Language Design and Implementation.
  15. ^ a b c d Tobin-Hochstadt, S.; St-Amour, V.; Culpepper, R.; Flatt, M.; Felleisen, M. (2011). "Languages as Libraries" (PDF). Programming Language Design and Implementation.
  16. ^ Felleisen, Matthias; Findler, Robert Bruce; Flatt, Matthew; Krishnamurthi, Shriram; Barzilay, Eli; McCarthy, Jay; Tobin-Hochstadt, Sam (2018). "A Programmable Programming Language". Communications of the ACM. 61 (3): 62–71. doi:10.1145/3127323.
  17. ^ "Racket: Software License". Retrieved 2015-10-20.
  18. ^ Benson, Brent W. Jr. (October 26–28, 1994). "libscheme: Scheme as a C Library". Written at Santa Fe, NM. Proceedings of the USENIX Symposium on Very High Level Languages. Berkeley, CA: USENIX Association. pp. 7–19. ISBN 978-1880446652. Retrieved July 7, 2013.
  19. ^ a b c "Rebuilding Racket's Graphics Layer". 2010-12-08. Retrieved 2017-12-11.
  20. ^ Clements, J.; Flatt, M.; Felleisen, M. (2001). "Modeling an Algebraic Stepper" (PDF). European Symposium on Programming Languages.
  21. ^ a b c "Racket Core Release Notes". Archived from the original on 2013-05-23. Retrieved 2012-04-15.
  22. ^ Flatt, M. (2002). "Composable and Compilable Macros". International Conference on Functional Programming.
  23. ^ "PLT Scheme version 4.0". 2008-06-12. Archived from the original on 2013-05-23. Retrieved 2012-08-07.
  24. ^ "From PLT Scheme to Racket". Racket-lang.org. Retrieved 2011-08-17.
  25. ^ "Racket 5.2". PLT, Inc. 2011-11-09. Retrieved 2012-06-16.
  26. ^ "Submodules". 2012-06-03. Retrieved 2012-08-07.
  27. ^ "Racket 5.3". PLT, Inc. 2012-08-07. Retrieved 2012-08-07.
  28. ^ "Racket 5.3.1". PLT, Inc. 2012-11-07. Retrieved 2012-11-07.
  29. ^ "Racket 6.0". PLT, Inc. 2014-02-26. Retrieved 2016-02-23.
  30. ^ "Racket-on-Chez Status: January 2018". 2018-01-05. Archived from the original on 2018-04-13. Retrieved 2018-04-13.
  31. ^ Flatt, M.; Yu, G.; Findler, R. B.; Felleisen, M. (2007). "Adding Delimited and Composable Control to a Production Programming Environment" (PDF). International Conference on Functional Programming.
  32. ^ "Contracts".
  33. ^ "Threads".
  34. ^ "Futures".
  35. ^ "Places".
  36. ^ Flatt, Matthew (2012). "Creating Languages in Racket". Communications of the ACM. Retrieved 2012-04-08.
  37. ^ Findler, R. B.; Felleisen, M. (2002). "Contracts for Higher-Order Functions" (PDF). International Conference on Functional Programming.
  38. ^ Matthews, J. (2006). "Component Deployment with PLaneT: You Want it Where?". Scheme and Functional Programming Workshop.
  39. ^ "The Racket package system and Planet".
  40. ^ Flatt, Matthew (2002). "Composable and Compilable Macros, You Want it When?" (PDF). International Conference on Functional Programming.
  41. ^ Flatt, Culpepper, Darais, Findler, Macros that Work Together; Compile-Time Bindings, Partial Expansion, and Definition Contexts
  42. ^ Tobin-Hochstadt, S.; Felleisen, M. (2008). "The Design and Implementation of Typed Scheme". Principles of Programming Languages.
  43. ^ Barzilay, E.; Clements, J. (2005). "Laziness Without All the Hard Work: Combining Lazy and Strict Languages for Teaching". Functional and Declarative Programming in Education.
  44. ^ Flatt, M.; Barzilay, E.; Findler, R. B. (2009). "Scribble: Closing the Book on Ad Hoc Documentation Tools". International Conference on Functional Programming.
  45. ^ Findler, R. B.; Flatt, M. (2004). "Slideshow: Functional Presentations". International Conference on Functional Programming.
  46. ^ Felleisen, M.; Findler, R. B.; Flatt, M.; Krishnamurthi, S. (2009). "A Functional I/O System (or Fun for Freshman Kids)" (PDF). International Conference on Functional Programming.
  47. ^ Felleisen, M.; Findler, R. B.; Flatt, M.; Krishnamurthi, S. (2004). "The Structure and Interpretation of the Computer Science Curriculum" (PDF). Journal of Functional Programming.
  48. ^ a b "Parser Tools: lex and yacc-style Parsing". Retrieved 2011-08-16.
  49. ^ a b Krishnamurthi, Hopkins; McCarthy; Graunke; Pettyjohn; Felleisen (2007). "Implementation and Use of the PLT Scheme Web Server" (PDF). Journal of Higher-Order and Symbolic Programming.
  50. ^ Barzilay, E.; Orlovsky, D. (2004). "Foreign Interface for PLT Scheme" (PDF). Scheme and Functional Programming.
  51. ^ "Functional mzScheme DSLs in Game Development". Retrieved 2012-05-08.
  52. ^ "Bootstrap". bootstrapworld.org. Retrieved 2015-08-11.

Further reading[edit]

External links[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=Racket_(programming_language)&oldid=880987184"