| slovo | definícia |
applicative
(mass) | applicative
- príslušný |
applicative
(encz) | applicative,praktický Pavel Cvrček |
applicative
(encz) | applicative,příslušný adj: Zdeněk Brož |
Applicative
(gcide) | Applicative \Ap"pli*ca*tive\ ([a^]p"pl[i^]*k[asl]*t[i^]v), a.
[Cf. F. applicatif, fr. L. applicare. See Apply.]
Capable of being applied or used; applying; applicatory;
practical. --Bramhall. -- Ap"pli*ca*tive*ly, adv.
[1913 Webster] |
applicative
(wn) | applicative
adj 1: readily applicable or practical [syn: applicative,
applicatory] |
| | podobné slovo | definícia |
applicative
(mass) | applicative
- príslušný |
applicative
(encz) | applicative,praktický Pavel Cvrčekapplicative,příslušný adj: Zdeněk Brož |
Applicatively
(gcide) | Applicative \Ap"pli*ca*tive\ ([a^]p"pl[i^]*k[asl]*t[i^]v), a.
[Cf. F. applicatif, fr. L. applicare. See Apply.]
Capable of being applied or used; applying; applicatory;
practical. --Bramhall. -- Ap"pli*ca*tive*ly, adv.
[1913 Webster] |
applicative
(wn) | applicative
adj 1: readily applicable or practical [syn: applicative,
applicatory] |
applicative language
(foldoc) | applicative language
A functional language. Sometimes used loosely
for any declarative language though logic programming
languages are declarative but not applicative.
(1995-12-24)
|
applicative language for digital signal processing
(foldoc) | Applicative Language for Digital Signal Processing
ALDiSP
(ALDiSP) A functional language with special
features for real-time I/O and numerical processing,
developed at the Technical University of Berlin in 1989.
["An Applicative Real-Time Language for DSP - Programming
Supporting Asynchronous Data-Flow Concepts", M. Freericks
in Microprocessing and Microprogramming
32, N-H 1991].
(1995-04-19)
|
applicative order reduction
(foldoc) | applicative order reduction
An evaluation strategy under which an
expression is evaluated by repeatedly evaluating its leftmost
innermost redex. This means that a function's arguments are
evaluated before the function is applied. This method will
not terminate if a function is given a non-terminating
expression as an argument even if the function is not strict
in that argument. Also known as call-by-value since the
values of arguments are passed rather than their names. This
is the evaluation strategy used by ML, Scheme, Hope and
most procedural languages such as C and Pascal.
See also normal order reduction, parallel reduction.
(1995-01-25)
|
constant applicative form
(foldoc) | constant applicative form
CAF
(CAF) A supercombinator which is
not a lambda abstraction. This includes truly constant
expressions such as 12, (+ 1 2), [1, 2, 3] as well as partially
applied functions such as (+ 4). Note that this last example
is equivalent under eta abstraction to \ x . + 4 x which is
not a CAF.
Since a CAF is a supercombinator, it contains no free
variables. Moreover, since it is not a lambda abstraction it
contains no variables at all. It may however contain
identifiers which refer to other CAFs, e.g.
c 3 where c = (* 2).
A CAF can always be lifted to the top level of the program.
It can either be compiled to a piece of graph which will be
shared by all uses or to some shared code which will overwrite
itself with some graph the first time it is evaluated. A CAF
such as
ints = from 1 where from n = n : from (n+1)
can grow without bound but may only be accessible from within
the code of one or more functions. In order for the {garbage
collector} to be able to reclaim such structures, we associate
with each function a list of the CAFs to which it refers.
When garbage collecting a reference to the function we collect
the CAFs on its list.
[{The Implementation of Functional Programming Languages, Simon
Peyton Jones
(http://research.microsoft.com/%7Esimonpj/papers/slpj-book-1987/PAGES/224.HTM)}].
(2006-10-12)
|
kent applicative operating system
(foldoc) | Kent Applicative Operating System
KAOS
(KAOS) A functional operating system
concept using dynamic process creation and inter-process
communication. KAOS was described in 1989 by Dr. John Cupitt
in his PhD thesis at the University of Kent. It was based on
earlier work by Will R. Stoye.
KAOS allowed dynamic creation of "functional processes" -
functions that transform an input stream to an output
stream. Process scheduling is based on evaluation on demand.
Inter-process communication is by message passing based on
Stoye's sorting office concept.
(2015-05-30)
|
|