A#(ID:1777/a::006)

Subcomponent of AXIOM 2 

Object-oriented and functional, a separable component of Version 2 of the AXIOM computer algebra system. Both types and functions are first class values. Designed for compilation to efficient machine code.

Structures:
Related languages
AXIOM 2 => A#   Subsystem
A# => FOAM   Intermediate language for
References:
  • Watt, S.M. "A# Language Reference", V 0.35, IBM Research Report 19530, 1994 view details
  • Watt, S.M.; Broadbery, P.A.; Dooley, S.S.; Iglio, P.; Morrison, S.C.; Steinbach, J.M. and R.S. Sutor "A First Report on the A# Compiler (including benchmarks)", IBM Research Report RC 19529, 1994. view details
  • Watt, S.M.; Broadbery, P.A.; Dooley, S.S.; Iglio, P.; Morrison, S.C.; Steinbach, J.M. and R.S. Sutor, "A# User's Guide", NAG Ltd, 1994 view details
  • Watt, S.M.; Broadbery, P.A.; Iglio, P.; Morrison, S.C.; Steinbach, J.M. "Foam: A First Order Abstract Machine", V 0.35, IBM Research Report RC 19528, 1994 view details
  • Watt, Stephen M. et al "A first report on the A# compiler" view details Abstract: INTRODUCTION
    The A# compiler allows users of computer algebra to develop
    programs in a context where multiple programming
    languages are employed. The compiler translates programs
    written in the A# programming language to a low-level
    intermediate language, Foam, from which it can
    generate stand-alone programs, native object libraries to be
    linked with other applications, or code to be read into closed
    environments. In addition, Foam code may be directly executed
    using an interpreter provided with the A# compiler.
    The A# programming language provides support for object-oriented
    and functional programming styles. It is "higherorder"
    in the sense that both types and functions are first
    clam, and may be manipulated in the same ways as any
    other values. The primary considerations in the formulation
    of the language have been generality, com possibility, and efficiency.
    The language has been designed to admit a number
    of important optimizations, allowing compilation to machine
    code which is in many instances of efficiency comparable to
    that produced by a C or Fortran compiler.
    The original motivation for At comes from the field of
    computer aJgebra to provide an improved extension language
    for the Axiom computer algebra system. DOI
          in Proceedings of the International Conference on Symbolic and Algebraic Computation (ISSAC`94) 1994, Oxford, United Kingdom view details