| slovo | definícia |
abstract machine
(foldoc) | abstract machine
1. A processor design which is not intended to be
implemented as hardware, but which is the notional executor
of a particular intermediate language (abstract machine
language) used in a compiler or interpreter. An abstract
machine has an instruction set, a register set and a model
of memory. It may provide instructions which are closer to
the language being compiled than any physical computer or it
may be used to make the language implementation easier to
port to other platforms.
A virtual machine is an abstract machine for which an
interpreter exists.
Examples: ABC, Abstract Machine Notation, ALF, CAML,
F-code, FP/M, Hermes, LOWL,
Christmas, SDL, S-K reduction machine, SECD, Tbl,
Tcode, TL0, WAM.
2. A procedure for executing a set of instructions in
some formal language, possibly also taking in input data and
producing output. Such abstract machines are not intended to
be constructed as hardware but are used in thought
experiments about computability.
Examples: Finite State Machine, Turing Machine.
(1995-03-13)
|
| | podobné slovo | definícia |
abstract machine notation
(foldoc) | Abstract Machine Notation
(AMN) A language for specifying abstract machines
in the B-Method, based on the mathematical theory of
Generalised Substitutions.
(1995-03-13)
|
categorical abstract machine language
(foldoc) | Categorical Abstract Machine Language
(Originally "CAML" - Categorical Abstract Machine
Language) A version of ML by G. Huet, G. Cousineau, Ascander
Suarez, Pierre Weis, Michel Mauny and others of INRIA and
ENS. CAML is intermediate between LCF ML and SML [in
what sense?]. It has first-class functions, {static type
inference} with polymorphic types, user-defined {variant
types} and product types, and pattern matching. It is
built on a proprietary run-time system.
The CAML V3.1 implementation added lazy and mutable data
structures, a "grammar" mechanism for interfacing with the
Yacc parser generator, pretty-printing tools,
high-performance arbitrary-precision arithmetic, and a
complete library. CAML V3 is often nicknamed "heavy CAML",
because of its heavy memory and CPU requirements compared to
Caml Light.
in 1990 Xavier Leroy and Damien Doligez designed a new
implementation called Caml Light, freeing the previous
implementation from too many experimental high-level features,
and more importantly, from the old Le_Lisp back-end.
Following the addition of a native-code compiler and a
powerful module system in 1995 and of the object and
class layer in 1996, the project's name was changed to
Objective Caml.
["The CAML Reference Manual", P. Weis et al, TR INRIA-ENS,
1989].
(2003-04-12)
|
|