Title: Theory / Unimportant / CS / Programming / LISP / R7RS/
Tags: fromMath mathToDef FromInstruction computer_to_instruction hasNotNewEffectReturnsMeaning some_instruction mathToSee comment hasSeenConjDef récupéré

Name: A predicate
Page: 7
Section: 3.5
Notation: A procedure whose name ends by ?

Definition: A procedure which store values into previously allocated locations
Page: 7
Section: 3.5
Notation: A procedure whose name ends by !

Name: A procedure which transform an object into an analogous object of a different type
Page: 7
Section: 3.5
Notation: origin type -> destination type

Name: A thunk
Definition: A procedure which does not accept arguments.
Page: 7
Section: 3.5

Name: A command
Definition: A procedure which does not return useful values to its continuation.
Page: 7
Section: 3.5

Name: An identifier
Definition: A sequence of letters, digits, extended identifier characters, such that no prefix is a valid number and distinct from the dot.
Page: 7
Chapter: 2
Definition2: sequences of zero or more characters enclosed within vertical lines
Example: |H\x65;llo word|
Conjdef: Either
Example2: ...

Name: White space characters
Definition: Space, tab, newline....
Page: 7
Chapter: 2

-boolean,
-char,
-null,
-pair,
-procedure,
-symbol,
-bytevector,
-eof-object
-number
-port
-string
-vector and
the one created by define-record-type
Page: 10
Chapter: 3
Section: 2
Name: The types

Name: The falsy values
Definition: #f
Page: 10
Chapter: 3
Section: 2

Name: The truthy values
Definition: everything but #f.
Page: 10
Chapter: 3
Section: 2

Name: An external representation
Definition: Some way to represents data, in order to read and write them.
Page: 10
Chapter: 3

Name: Mutable object
Definition: An object which denotes a notation in which value can be modified.
Page: 10
Chapter: 3

Q: [...].
A: An object which denotes a notation in which value can not be modified
Page: 10
Chapter: 3
Kind: lisp
Name: Immutable object
Q: Exactly:
-[...]
-[...],
-potentially [...]
A: litteral constants; values returned by symbol->string; environment returned by scheme-report-environment

Question: Variables and objects such as pairs, strings, vectors, and bytevectors implicitly denote
Answer: locations or sequences of locations.
Page: 10
Chapter: 3

Name: Properly tail recursive implementation
Definition: An implementation of scheme which supports an unbounded number of active tail calls.
Page: 10
Chapter: 3

Name: An active call
Definition: A called procedure which might still return.
Page: 10
Chapter: 3

Name: A tail call
Definition: A procedure call that occurs in a tail context.
Page: 11
Chapter: 3
Section: 5

Language: Lisp
Instruction: ;
Other fields (not shown on cards):
Chapter: 2
Page: 7

Instruction: #!fold-case
Page: 7
Effect: subsequent identifiers and character names to be case-folded as if by string-foldcase
Language: Lisp
Chapter: 2
Section: 1

Instruction: #!no-fold-case
Page: 7
Effect: switch back  to a non-folding behaviour
Language: Lisp
Chapter: 2
Section: 1