Category:Racket: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{language |
{{language |
||
|site=http://racket-lang.org/ |
|||
|gc=yes |
|||
|tags=lisp,racket,scheme}} |
|||
{{implementation|Scheme}} |
{{implementation|Scheme}} |
||
{{implementation|Lisp}} |
{{implementation|Lisp}} |
||
| Line 6: | Line 9: | ||
'''Racket''' (renamed from "PLT Scheme" years ago) is a member of the Lisp family of languages, and a descendant of Scheme. |
'''Racket''' (renamed from "PLT Scheme" years ago) is a member of the Lisp family of languages, and a descendant of Scheme. |
||
Racket draws both from its heritage in [[:Category:Lisp|Lisp]] and [[:Category:Scheme|Scheme]] in addition to other languages such as [[:Category:Eiffel|Eiffel]]. |
Racket draws both from its heritage in [[:Category:Lisp|Lisp]] and [[:Category:Scheme|Scheme]] in addition to other languages such as [[:Category:Eiffel|Eiffel]]. |
||
Racket provides [https://en.wikipedia.org/wiki/Higher-order_programming higher-order] [https://en.wikipedia.org/wiki/Design_by_contract software contracts] and [[:Category:Typed_Racket|Typed Racket]] extends this to provide safe [https://en.wikipedia.org/wiki/Gradual_typing gradual typing]. |
|||
The main [[RacketCS]] implementation is [[:Category:Execution method/Compiled|compiled]] to [[:Category:Execution method/Compiled/Machine code|machine code]]. The [[RacketBC]] features a compiler and runtime written in C, with a precise garbage collector and a just-in-time compiler (JIT) on most platforms. [[RacketScript]] compiles to [[:Category:JavaScript|JavaScript]]. |
|||
* [http://racket-lang.org/ Home page] |
* [http://racket-lang.org/ Home page] |
||
Latest revision as of 13:54, 5 March 2023
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Garbage collected: | Yes |
|---|---|
| Lang tag(s): | lisp,racket,scheme |
| See Also: |
|
Racket is an implementation of Scheme.
Other implementations of Scheme.
Racket is an implementation of Lisp.
Other implementations of Lisp.
Racket (renamed from "PLT Scheme" years ago) is a member of the Lisp family of languages, and a descendant of Scheme.
Racket draws both from its heritage in Lisp and Scheme in addition to other languages such as Eiffel.
Racket provides higher-order software contracts and Typed Racket extends this to provide safe gradual typing.
The main RacketCS implementation is compiled to machine code. The RacketBC features a compiler and runtime written in C, with a precise garbage collector and a just-in-time compiler (JIT) on most platforms. RacketScript compiles to JavaScript.
Todo
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Racket Implementations (4 P)
- Racket User (25 P)
Pages in category "Racket"
The following 200 pages are in this category, out of 1,099 total.
(previous page) (next page)A
- A* search algorithm
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC problem
- ABC words
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Active Directory/Connect
- Active object
- Addition chains
- Addition-chain exponentiation
- Additive primes
- Address of a variable
- AKS test for primes
- Algebraic data types
- Align columns
- Aliquot sequence classifications
- Almost prime
- Amb
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arena storage pool
- Arithmetic evaluation
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- ASCII art diagram converter
- Assertions
- Assertions in design by contract
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Audio alarm
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
- Babbage problem
- Bacon cipher
- Balanced brackets
- Balanced ternary
- Banker's algorithm
- Barnsley fern
- Base58Check encoding
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Bilinear interpolation
- Bin given limits
- Binary digits
- Binary search
- Binary strings
- Bioinformatics/base count
- Bioinformatics/Sequence mutation
- Bioinformatics/Subsequence
- Birthday problem
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Bitmap/Read a PPM file
- Bitmap/Read an image through a pipe
- Bitmap/Write a PPM file
- Bitwise IO
- Bitwise operations
- Boolean values
- Box the compass
- Brace expansion
- Brazilian numbers
- Brownian tree
- Bulls and cows
- Bulls and cows/Player
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calendar - for "REAL" programmers
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Call an object method
- Camel case and snake case
- Cantor set
- Card shuffles
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Chaos game
- Character codes
- Chat server
- Chebyshev coefficients
- Check input device is a terminal
- Check Machin-like formulas
- Check output device is a terminal
- Check that file exists
- Checkpoint synchronization
- Chemical calculator
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Church numerals
- Cipolla's algorithm
- Circles of given radius through two points
- Classes
- Closest-pair problem
- Closures/Value capture
- Code segment unload
- Collections
- Color of a screen pixel
- Color quantization
- Color wheel
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Commatizing numbers
- Comments
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Compiler/lexical analyzer
- Compiler/virtual machine interpreter
- Compound data type
- Concurrent computing
- Conditional structures
- Conjugate transpose
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Coprimes
- Copy a string
- Copy stdin to stdout
- Count in factors
- Count in octal