Index


Symbols

!

!

#

  #all-keys [1] [2] [3] [4]
  #f
  #key [1] [2] [3] [4]
  #rest [1] [2] [3] [4] [5]
  #t

&

  & [1] [2] [3]

*

  * [1] [2]

+

  + [1] [2]
    methods for  + [1]

-

  - [1] [2] [3] [4]

/

  / [1] [2]

:

  := [1] [2] [3] [4]

%lt;

  < [1] [2]
  <=
  <condition>
  <error>
  <function>
  <generic-function>
  <method>
  <object>
  <restart>
  <simple-error>
  <simple-object-vector>
  <sorted-sequence>
  <stretchy-vector>

=

  = [1] [2] [3]
    methods for
  == [1] [2]

%gt;

  >
  >=

\

  \
    for quotation of infix functions
    methods for

^

  ^

|

  | [1] [2]

~

  ~
  ~=
  ~==

A

  abs
  abstract classes
  airport application [1]
    design [1]
    goals
  #all-keys [1] [2] [3] [4]
  all-superclasses [1] [2]
  allocation of slots
  ambiguous methods [1] [2]
  and logical operation [1] [2]
  applicable methods [1] [2]
  apply
  aref [1] [2]
  aref-setter
  arguments
    keywords
  arithmetic operations [1] [2]
    spaces needed
  arrays
    indices
  assignment operator [1] [2] [3]
  automatic storage-management [1] [2]
  auxiliary macros

B

  backslash
    for quotation of infix functions
  bare methods
  Beard, Patrick
  Benson, Brent
  binary operators
  bindings [1] [2] [3]
    parameters
  block [1] [2]
    cleanup clause
    exception clause [1] [2]
  body [1] [2]
    defined by begin and end
    within a define method
  break

C

  C and C++ comparisons
    arrays
    class concepts
    compiler optimizations for method dispatch
    definition of methods on built-in classes
    division functions
    Dylan library  files and C header files
    Dylan LID files and makefile in C
    Dylan program files and .c files in C
    elements of programs
    format-out and printf
    if
    library definition versus header and includes
    library-use relationships versus C++ namespaces
    limited collection types and template classes
    macros [1] [2] [3] [4] [5]
    modules and private:, public:, protected:
    multimethods
    multiple inheritance
    multiple inheritance and slots
    namespace of setters and getters
    operator overloading
    parameters [1] [2]
    partial evaluation as inlining and constant folding
    pointers [1] [2]
    primary classes
    references
    relationship between classes and methods
    representation of data types
    representation of primitive values
    true and false values
    type inference
    uninitialized slots
    virtual base classes
  call-site caching
  Carnegie Mellon University
  case
  case insensitivity
  ceiling
  ceiling/
  cerror
  class inheritance [1]
  class precedence list
  class slot allocation
  classes
    abstract and concrete
    comparison of Dylan and C++
    inheritance
    instantiable
    naming convention
    open or sealed
    relationship to methods
    user-defined
  cleanup clause of block
  client modules
  CLOS
  closures [1] [2]
  collections [1]
    definition of a new collection [1]
    element-reference syntax
    limited
  coloring algorithm for optimization of slot accessors
  comments
  comparison operations
  complement
  concrete classes
  <condition>
  conditions
    handlers
    signal of
  congruence
    parameter lists
    value declarations
  constant slots
  constants
    module constants
    naming convention
  constructors
  contract
  control-flow functions [1]
  copy-sequence [1] [2] [3]
  create clause of define module [1] [2]
  curry [1] [2]

D

  define class [1] [2] [3] [4] [5] [6]
  define constant [1] [2]
  define generic [1] [2] [3]
  define macro
  define method [1] [2] [3] [4] [5]
  define module
  define sealed domain
  define variable [1] [2]
  defining macros
  definitions
  delivery of applications
  design of the airport application [1]
  development environments
  direct instances
  direct methods
  direct subclasses
  direct superclasses
  division functions
  do
  do-handlers
  domains
  dot syntax
  Dylan
    implementations [1]
    introduction [1]
  dylan library [1] [2]
  dylan module [1] [2]
  dylan-user module [1] [2] [3] [4]
  dynamic aspects of Dylan
    compilation of portions of a program
  dynamic scope

E

  each-subclass slot allocation
  efficiency model
  element [1] [2] [3]
  element references
  element-setter
  enumerations
  equality predicates
  <error>
  error
  errors
    no applicable method
  evaluation
    order of
  even?
  examples
    airport application [1]
    available on World Wide Web
    complete libraries for say, time, angle, and sixty-unit [1]
    Hello, world [1]
    simple, complete library [1]
    user-defined collection type [1]
  exception clause of block [1] [2]
  exceptions [1]
    condition handlers
    informal protocol
    signal of conditions
    use of block for protected operations
  execution model
  explicit function calls
  export of modules by libraries
  export of names by modules

F

  #f
  false value
  find-key
  flexibility
    and performance [1]
  floor [1] [2]
  floor/
  for [1] [2]
  format-out
    unsupported in Apple Technology Release
  forward-iteration protocol [1] [2]
  <function>
  function macros
  function-call protocol
  function-call syntax [1] [2]
    binary operator calls
    element references
    explicit function calls
    slot references
    unary operator calls
  functions [1]
    application
    closures [1] [2]
    operations on
    types

G

  garbage collection
    performance
  <generic function>
  generic functions
    contract of
    creation
    define generic
    implicit definition [1] [2] [3]
    introduction [1] [2]
    open or sealed
    signatures
    typed parameters
  getters [1] [2]
    naming considerations
    performance [1] [2]
    slot-reference syntax
  graph
  Gwydion

H

  handlers
  Harlequin
  has-a relationship
  head

I

  identity
  if
  immutable objects
  implementation modules [1] [2]
  import of modules by libraries
  import of names from other modules
  import: clause of define module
    export: option
  indirect instances
  infix functions
    backslash for quotation of
  infix syntax
  information hiding
  inheritance
    multiple [1]
    single
    slots
  inherited slot specification [1] [2]
  init expressions
  init keywords
  init-function: slot option
  init-value: slot option
  initialization of slots [1] [2]
  initialize methods [1] [2]
  inlining [1] [2]
  instance slot allocation
  instance?
  instances [1] [2]
    creation
    initialization of slots
    introduction
  instantiable classes
  integers
    limited
  interchange format [1] [2] [3] [4] [5]
  interface modules [1] [2]
  Internet resources for  Dylan [1]
  is-a relationship

J

  Java comparisons
    automatic storage-management
    multimethods
    multiple inheritance and interfaces
    operator overloading
    pointers
    representation of data types
    representation of primitive values
    safety versus performance trade-off
    true and false values

K

  #key [1] [2] [3] [4]
  keyword arguments
  keyword parameters [1] [2] [3] [4]
  keywords
    namespace of

L

  least specific
  let [1] [2] [3]
  let handler [1] [2]
  lexical scoping [1] [2]
  libraries [1]
    and programs
    export,  import, and use of modules
  library-interchange definition (LID) files [1] [2]
  limited [1] [2] [3]
  limited types
    collections
    integers
    performance implications
  list
  listeners
  lists
    creation and access to elements
  literal constants
  local method [1] [2] [3]
  local variables [1] [2]
    initialization of multiple
  logical operations
    and [1] [2]
    negation
    or [1] [2]

M

  macros [1]
    auxiliary macros
    auxiliary rules
    constraints [1] [2]
    defining macros
    delay of evaluation of arguments [1] [2]
    evaluation in
    function macros
    hygiene [1] [2]
    pattern variables [1] [2]
    patterns
    rules
    statement macros
    templates
  make [1] [2]
    methods
  map
  Marlais
  max
  <method>
  method [1] [2] [3] [4] [5]
  method dispatch
    ambiguous methods [1] [2]
    classes
    introduction [1]
    limited collections
    limited integers
    multimethods
    multiple inheritance
    nonclass types
    performance note
    singletons
    unions
  methods
    applicable [1] [2]
    bare
    creation
    direct
    introduction
    relationship to classes
    specificity
  min
  Mindy
  mix-in classes
  mix-in style of programming
  modularity [1]
  module constants
  module variables
    introduction
  modules [1]
    and source records
    client modules
    create clause [1] [2]
    export and import of names
    implementation modules [1] [2]
    import: clause
      export: option
    interface modules [1] [2]
    roles
  most specific
  multimethods [1]
  multiple inheritance [1]
    base and mix-in classes
    class precedence list
    decision to use
    method dispatch
    pros and cons
    slots
  multiple return values [1] [2]
  mutable objects

N

  namespaces [1] [2]
  naming conventions
    classes
    constants
    destructive functions
    predicates
    types
    variables
  negation logical operation
  negative
  negative?
  newsgroup for Dylan
  next-method
  nonclass types

O

  <object>
  object identity
  object model, for C and C++ programmers
  object-class
  object-oriented programming in Dylan
    basic concepts [1]
  objects
  one-of
  open classes
  open generic functions
  operands
  operations
    arithmetic
    assignment [1] [2]
    comparison
    logical
  operator overloading
  operators
    binary
    unary
  or logical operation [1] [2]
  order of evaluation
  overloading

P

  pair
  pairs
  parameter lists
    congruence
  parameter specializers [1] [2]
  parameters
    keywords [1] [2] [3] [4]
    required
    rest
    specialized
  partial evaluation [1] [2] [3]
  pattern variables [1] [2]
  patterns
  performance
    and flexibility [1]
    call-site caching
    efficiency model
    enumerations
    execution model
    garbage collection
    inlining [1] [2]
    limited types
    method dispatch
    open or sealed classes
    open or sealed generic functions
    partial evaluation
    performance warnings
    primary classes
    safety warnings
    sealed domains
    slot accessors
    tail calls
    type constraints
    type inference
    typed parameters of generic functions
  pointers
  polymorphism
  positive?
  predicates [1] [2]
    naming conventions
  primary classes
  programs
  proper subtype
  protocols

Q

  quick start to learning Dylan [1]

R

  re-export of imports
  recursion
  redefinition of classes
  required parameters
  required-init-value: slot option
  #rest [1] [2] [3] [4] [5]
  rest parameters
  <restart>
  restart handlers
  return values
    multiple
  reusable software components
  reverse
  reverse!
  root
  round
  round/

S

  safety warnings
  scope
    lexical
  sealed classes
  sealed domains
    restriction on methods
    restriction on subclasses of open classes
  sealed generic functions
  select [1] [2]
  setters [1] [2]
    element-reference syntax
    function-call syntax
    performance
    slot-reference syntax
  Shalit, Andrew
  signal of conditions
  signatures
  <simple-error>
  <simple-object-vector>
  single inheritance
  singleton [1] [2]
    performance implications
  size
  slot allocation
    class
    each-subclass
    instance
    virtual
  slot options
    init expressions
    init-function:
    init-value:
    required-init-value:
  slot references
  slot specifications
    constant slot
    inherited slot
  slots [1]
    allocation
    constant
    getters and setters
    inheritance
    initialization [1] [2] [3]
    introduction
    multiple inheritance
    naming considerations
    performance of getters and setters
    type constraint
    uninitialized [1] [2]
    virtual
  Smalltalk [1] [2]
  sorted sequences [1]
    needed by the airport application
  <sorted-sequence>
  source records [1] [2]
  specialized parameters
  specializers [1] [2]
  statement macros
  <stretchy-vector>
  strings
    creation and access to elements
  subclasses
  subtype?
  subtypes
  superclasses
    introduction
  supertypes
  symbols
    namespace of

T

  #t
  tables
  tail
  tail calls
  templates
  terminology
    classes, types, and instances
  tree
  true value
  truncate
  truncate/
  type constraints
    <object>
    of slots
    performance implications
  type inference
  type-for-copy
  type-union [1] [2] [3]
    performance implications
  types
    limited
    naming convention
    that are not classes

U

  unary operators
  user-defined classes and methods [1]

V

  value declarations [1] [2] [3]
    congruence
  values [1] [2] [3]
  variables
    local [1] [2]
    naming convention
    type constraints
  vector [1] [2]
  vectors
    creation and access to elements
  virtual slot allocation [1] [2]
  virtual slots

W

  while
  Wilson, Joseph N.
  World Wide Web pages for Dylan [1]

Z

  zero?