Yahoo Suche Web Suche

Anmelden

Suchergebnisse

  1. Suchergebnisse:

  1. docs.racket-lang.org › guide › application4.3 Function Calls - Racket

    Some functions, such as cons, accept a fixed number of arguments. Some functions, such as + or list, accept any number of arguments. Some functions accept a range of argument counts; for example substring accepts either two or three arguments. A function’s arity is the number of arguments that it accepts. 4.3.2 Keyword Arguments 🔗 ℹ

    • Lambda

      Procedure Expressions: lambda and case-lambda in The Racket...

    • Define

      The expansion of this shorthand has one nested lambda form...

    • Notation

      The italicized meta-variables in this specification, such as...

    • Sequencing

      Racket programmers prefer to write programs with as few...

    • Case

      For more general pattern matching (but without the...

    • Local Binding

      Although internal define s can be used for local binding,...

    • Set

      4.9.1 Guidelines for Using Assignment 🔗 ℹ. Although using...

    • Parameterize

      In a parameterize form, each parameter-expr must produce a...

  2. Videos

    Alle anzeigen

  3. docs.racket-lang.org › guide › syntax-overview2.2 Simple Definitions and Expressions - Racket

    Using square brackets in a few key places makes Racket code even more readable. 2.2.6 Function Calls, Again 🔗 ℹ. In our earlier grammar of function calls, we oversimplified. The actual syntax of a function call allows an arbitrary expression for the function, instead of just an ‹ id ›:

  4. docs.racket-lang.org › guideThe Racket Guide

    4.3 Function Calls (Procedure Applications) 4.3.1 Evaluation Order and Arity 4.3.2 Keyword Arguments 4.3.3 The apply Function 4.4 Functions (Procedures): lambda 4.4.1 Declaring a Rest Argument 4.4.2 Declaring Optional Arguments 4.4.3 Declaring Keyword Arguments 4.4.4 Arity-Sensitive Functions: case-lambda 4.5 Definitions: define 4.5.1 Function ...

  5. beautifulracket.com › explainer › functionsBeautiful Racket: Functions

    Functions. A func­tion is a set of expres­sions that’s only eval­u­ated when explic­itly invoked at run time. Option­ally, a func­tion can take argu­ments as input, and return values as output. Within a program, func­tions are used for three over­lap­ping purposes: To delay the eval­u­a­tion of a set of expres­sions.

  6. racket-lang.orgRacket

    While Racket is a functional language, it has offered a sub-language of classes and objects, mixins and traits, from the beginning. The macro-based implementation of a Java-like class system lives in a library and does not need any support from the core language. A Racket programmer can thus combine functional with object-oriented components as ...

    • racket functions1
    • racket functions2
    • racket functions3
    • racket functions4
    • racket functions5

  7. mirror.racket-lang.org › docs › recentThe Racket Guide

    Racket, start with Quick: An Introduction to Racket with Pictures. Chapter 2 provides a brief introduction to Racket. From Chapter 3 on, this guide dives into details—covering much of the Racket toolbox, but leaving precise details to The Racket Reference and other reference manuals. The source of this manual is available on GitHub. 1

  8. mirror.racket-lang.org › docs › 6The Racket Guide

    Racket. It assumes programming experience, so if you are new to programming, consider instead reading How to Design Programs. If you want an especially quick introduction to Racket, start with Quick: An Introduction to Racket with Pictures. Chapter 2 provides a brief introduction to Racket. From Chapter 3 on, this guide dives into