| slovo | definícia |
referent
(msas) | referent
- officer |
referent
(msasasci) | referent
- officer |
referent
(encz) | referent,náhražka n: Zdeněk Brož |
referent
(czen) | referent,officer Pavel Machek; Giza |
referent
(czen) | referent,reportern: Zdeněk Brož |
referent
(wn) | referent
adj 1: having reference; "judgments referent to the indictment"
n 1: something referred to; the object of a reference
2: the first term in a proposition; the term to which other
terms relate
3: something that refers; a term that refers to another term |
| | podobné slovo | definícia |
preferential
(mass) | preferential
- prednostný, preferenčný |
coreferential
(encz) | coreferential, adj: |
preferential
(encz) | preferential,preferenční adj: Zdeněk Brožpreferential,přednostní adj: Zdeněk Brož |
preferential species
(encz) | preferential species,preferenční druh [eko.] RNDr. Pavel Piskač |
preferential tariff arrangement
(encz) | preferential tariff arrangement, |
preferential trade area for eastern and southern african states
(encz) | Preferential Trade Area for Eastern and Southern African States, |
preferentially
(encz) | preferentially,přednostně adv: Zdeněk Brož |
referential
(encz) | referential,odkazový adj: Zdeněk Brožreferential,referenční adj: Zdeněk Brož |
referentiality
(encz) | referentiality, |
referentially
(encz) | referentially,vztažně adv: Zdeněk Brož |
self-referent
(encz) | self-referent, adj: |
self-referential
(encz) | self-referential, |
self-referentiality
(encz) | self-referentiality,sebevztažnost n: Zdeněk Brož |
Preferential
(gcide) | Preferential \Pref`er*en"tial\, a.
Giving, indicating, or having a preference or precedence; as,
a preferential claim; preferential shares.
[1913 Webster] |
preferential stock
(gcide) | Prefer \Pre*fer"\, v. t. [imp. & p. p. Preferred; p. pr. & vb.
n. Preferring.] [F. pr['e]f['e]rer, L. praeferre; prae
before + ferre to bear or carry. See 1st Bear.]
1. To carry or bring (something) forward, or before one;
hence, to bring for consideration, acceptance, judgment,
etc.; to offer; to present; to proffer; to address; --
said especially of a request, prayer, petition, claim,
charge, etc.
[1913 Webster]
He spake, and to her hand preferred the bowl.
--Pope.
[1913 Webster]
Presently prefer his suit to C[ae]sar. --Shak.
[1913 Webster]
Three tongues prefer strange orisons on high.
--Byron.
[1913 Webster]
2. To go before, or be before, in estimation; to outrank; to
surpass. [Obs.] "Though maidenhood prefer bigamy."
--Chaucer.
[1913 Webster]
3. To cause to go before; hence, to advance before others, as
to an office or dignity; to raise; to exalt; to promote;
as, to prefer an officer to the rank of general.
[1913 Webster]
I would prefer him to a better place. --Shak.
[1913 Webster]
4. To set above or before something else in estimation,
favor, or liking; to regard or honor before another; to
hold in greater favor; to choose rather; -- often followed
by to, before, or above.
[1913 Webster]
If I prefer not Jerusalem above my chief joy. --Ps.
cxxxvii. 6.
[1913 Webster]
Preferred an infamous peace before a most just war.
--Knolles.
[1913 Webster]
Preferred stock, stock which takes a dividend before other
capital stock; -- called also preference stock and
preferential stock.
[1913 Webster]
Syn: To choose; elect. See Choose.
[1913 Webster] |
Preferential voting
(gcide) | Preferential voting \Preferential voting\ (Political Science)
A system of voting, as at primaries, in which the voters are
allowed to indicate on their ballots their preference
(usually their first and second choices) between two or more
candidates for an office, so that if no candidate receives a
majority of first choices the one receiving the greatest
number of first and second choices together in nominated or
elected.
[Webster 1913 Suppl.] |
Referential
(gcide) | Referential \Ref`er*en"tial\ (-shal), a.
Containing a reference; pointing to something out of itself;
as, notes for referential use. -- Ref`er*en"tial*ly, adv.
[1913 Webster] |
Referentially
(gcide) | Referential \Ref`er*en"tial\ (-shal), a.
Containing a reference; pointing to something out of itself;
as, notes for referential use. -- Ref`er*en"tial*ly, adv.
[1913 Webster] |
co-referent
(wn) | co-referent
adj 1: relating to coreference [syn: coreferential, {co-
referent}] |
coreferent
(wn) | coreferent
adj 1: related by sharing a symbolic link to a concrete object
or an abstraction; "two expressions are coreferent if
they denote the same object or individual" |
coreferential
(wn) | coreferential
adj 1: relating to coreference [syn: coreferential, {co-
referent}] |
preferent
(wn) | preferent
adj 1: preferred above all others and treated with partiality;
"the favored child" [syn: favored, favorite(a),
favourite(a), best-loved, pet, preferred,
preferent] |
preferential
(wn) | preferential
adj 1: manifesting partiality; "a discriminatory tax";
"preferential tariff rates"; "preferential treatment"; "a
preferential shop gives priority or advantage to union
members in hiring or promoting" [syn: discriminatory,
preferential] |
preferentially
(wn) | preferentially
adv 1: in a preferential manner; "he was treated preferentially" |
referential
(wn) | referential
adj 1: referring or pointing to something; "symbols are
inherently referential" |
self-referent
(wn) | self-referent
adj 1: referring back to itself [syn: reflexive, {self-
referent}] |
referential integrity
(foldoc) | referential integrity
A collection of properties which should be
possessed by data in a relational database.
For example, in a database of family members, if we enter A as
a spouse of B, we should also enter B as a spouse of A.
Similarly, if we remove one end of the relationship we should
also remove the other.
(1998-02-18)
|
referential transparency
(foldoc) | referential transparency
referentially transparent
An expression E is referentially transparent if
any subexpression and its value (the result of evaluating it)
can be interchanged without changing the value of E. This is
not the case if the value of an expression depends on global
state which can change value. The most common example of
changing global state is assignment to a global variable. For
example, if y is a global variable in:
f(x)
return x+y;
g(z)
{
a = f(1);
y = y + z;
return a + f(1);
}
function g has the "side-effect" that it alters the value of
y. Since f's result depends on y, the two calls to f(1) will
return different results even though the argument is the same.
Thus f is not referentially transparent. Changing the order
of evaluation of the statements in g will change its result.
Pure functional languages achieve referential transparency
by forbidding assignment to global variables. Each
expression is a constant or a function application whose
evaluation has no side-effect, it only returns a value and
that value depends only on the definition of the function and
the values of its arguments.
We could make f above referentially transparent by passing in
y as an argument:
f(x, y) = x+y
Similarly, g would need to take y as an argument and return
its new value as part of the result:
g(z, y)
{
a = f(1, y);
y' = y+z;
return (a + f(1, y'), y');
}
Referentially transparent programs are more amenable to
formal methods and easier to reason about because the
meaning of an expression depends only on the meaning of its
subexpressions and not on the order of evaluation or
side-effects of other expressions.
We can stretch the concept of referential transparency to
include input and output if we consider the whole program to
be a function from its input to its output. The program as a
whole is referentially transparent because it will always
produce the same output when given the same input. This is
stretching the concept because the program's input may include
what the user types, the content of certain files or even the
time of day. If we do not consider global state like the
contents of files as input, then writing to a file and reading
what was written behaves just like assignment to a global
variable. However, if we must consider the state of the
universe as an input rather than global state then any
deterministic system would be referentially transparent!
See also extensional equality, observational equivalence.
(1997-03-25)
|
referentially transparent
(foldoc) | referential transparency
referentially transparent
An expression E is referentially transparent if
any subexpression and its value (the result of evaluating it)
can be interchanged without changing the value of E. This is
not the case if the value of an expression depends on global
state which can change value. The most common example of
changing global state is assignment to a global variable. For
example, if y is a global variable in:
f(x)
return x+y;
g(z)
{
a = f(1);
y = y + z;
return a + f(1);
}
function g has the "side-effect" that it alters the value of
y. Since f's result depends on y, the two calls to f(1) will
return different results even though the argument is the same.
Thus f is not referentially transparent. Changing the order
of evaluation of the statements in g will change its result.
Pure functional languages achieve referential transparency
by forbidding assignment to global variables. Each
expression is a constant or a function application whose
evaluation has no side-effect, it only returns a value and
that value depends only on the definition of the function and
the values of its arguments.
We could make f above referentially transparent by passing in
y as an argument:
f(x, y) = x+y
Similarly, g would need to take y as an argument and return
its new value as part of the result:
g(z, y)
{
a = f(1, y);
y' = y+z;
return (a + f(1, y'), y');
}
Referentially transparent programs are more amenable to
formal methods and easier to reason about because the
meaning of an expression depends only on the meaning of its
subexpressions and not on the order of evaluation or
side-effects of other expressions.
We can stretch the concept of referential transparency to
include input and output if we consider the whole program to
be a function from its input to its output. The program as a
whole is referentially transparent because it will always
produce the same output when given the same input. This is
stretching the concept because the program's input may include
what the user types, the content of certain files or even the
time of day. If we do not consider global state like the
contents of files as input, then writing to a file and reading
what was written behaves just like assignment to a global
variable. However, if we must consider the state of the
universe as an input rather than global state then any
deterministic system would be referentially transparent!
See also extensional equality, observational equivalence.
(1997-03-25)
|
|