| slovo | definícia |
combinator
(encz) | combinator, |
combinator
(foldoc) | combinator
A function with no free variables. A term is
either a constant, a variable or of the form A B denoting the
application of term A (a function of one argument) to term
B. Juxtaposition associates to the left in the absence of
parentheses. All combinators can be defined from two basic
combinators - S and K. These two and a third, I, are defined
thus:
S f g x = f x (g x)
K x y = x
I x = x = S K K x
There is a simple translation between combinatory logic and
lambda-calculus. The size of equivalent expressions in the
two languages are of the same order.
Other combinators were added by David Turner in 1979 when he
used combinators to implement SASL:
B f g x = f (g x)
C f g x = f x g
S' c f g x = c (f x) (g x)
B* c f g x = c (f (g x))
C' c f g x = c (f x) g
See fixed point combinator, curried function,
supercombinators.
(2002-11-03)
|
| | podobné slovo | definícia |
combinatorial
(encz) | combinatorial,kombinatorický adj: Zdeněk Brož |
combinatorially
(encz) | combinatorially, |
combinatoric
(encz) | combinatoric, |
combinatorics
(encz) | combinatorics,kombinatorika [mat.] [female] web |
combinatory
(encz) | combinatory,kombinatorický adj: Zdeněk Brož |
combinable combinational combinatory combiningprenominal
(gcide) | combinative \combinative\ adj.
1. produced by a combinatorial process. [Narrower terms:
{combinable, combinational, combinatory,
combining(prenominal)}] Also See: integrative. Antonym:
noncombinative.
[WordNet 1.5]
2. able to combine; tending to combine. [Narrower terms:
integrative (vs. disintegrative)]
Syn: combinatory, combinatorial.
[WordNet 1.5] combinatorial |
combinatorial
(gcide) | combinatorial \combinatorial\ combinatory \combinatory\adj.
1. able to combine; tending to combine.
Note: same as combinative, 2. [Narrower terms: {integrative
(vs. disintegrative)}]
Syn: combinative.
[WordNet 1.5]
2. of or relating to combinations. [Narrower terms:
combinative (vs. noncombinative)] WordNet 1.5]
3. produced by a process of combining; as, a combinatorial
explosion of possibilities; -- used especially in
reference to mathematical or statistical processes of
computing possible combinations.
PJC] |
combinatory
(gcide) | combinatorial \combinatorial\ combinatory \combinatory\adj.
1. able to combine; tending to combine.
Note: same as combinative, 2. [Narrower terms: {integrative
(vs. disintegrative)}]
Syn: combinative.
[WordNet 1.5]
2. of or relating to combinations. [Narrower terms:
combinative (vs. noncombinative)] WordNet 1.5]
3. produced by a process of combining; as, a combinatorial
explosion of possibilities; -- used especially in
reference to mathematical or statistical processes of
computing possible combinations.
PJC]combinatory \combinatory\ adj.
1. same as combinatorial, 1.
Syn: combinative, combinatorial.
[WordNet 1.5]
2. able to be combined.
Syn: combinable, combinational, combining(prenominal).
[WordNet 1.5]
3. same as combinatorial, 2. [Narrower terms: {combinative
(vs. noncombinative)}]
Syn: combinatorial.
[WordNet 1.5] |
combinatorial
(wn) | combinatorial
adj 1: relating to or involving combinations [syn:
combinative, combinatory, combinatorial]
2: relating to the combination and arrangement of elements in
sets |
combinatory
(wn) | combinatory
adj 1: marked by or relating to or resulting from combination
[syn: combinative, combinatory] [ant:
noncombinative]
2: relating to or involving combinations [syn: combinative,
combinatory, combinatorial]
3: able to or tending to combine [syn: combinable,
combinational, combinatory] |
combinatory logic
(foldoc) | combinatory logic
A system for reducing the operational notation of
logic, mathematics or a functional language to a sequence
of modifications to the input data structure. First
introduced in the 1920's by Schoenfinkel. Re-introduced
independently by Haskell Curry in the late 1920's (who
quickly learned of Schoenfinkel's work after he had the idea).
Curry is really responsible for most of the development, at
least up until work with Feys in 1958.
See combinator.
(1995-01-05)
|
fixed point combinator
(foldoc) | fixed point combinator
(Y) The name used in combinatory logic for the
fixed point function, also written as "fix".
(1994-10-20)
|
supercombinators
(foldoc) | supercombinators
Combinators with coarser granularity than those proposed by
David Turner. A functional program is translated to a set
of functions without free variables. The members of the set
are selected to be optimal for that program. Supercombinators
were proposed by John Hughes at University of Edinburgh.
|
|