-
since Windows 98. All of the
pictographic Webding glyphs that are not
unifiable with
existing Unicode characters were
added to the
Unicode Standard when...
- Consortium. "The
Unicode Standard,
Version 14.0" (PDF).
Unicode Consortium. "
unifiable glyph variants" (PDF).
Archived from the
original (PDF) on 2006-05-15...
- "Compatibility"
blocks relate to CJK unification.
While 龜 and 亀 are not
considered unifiable, it is not
clear why U+FA20 蘒 CJK
COMPATIBILITY IDEOGRAPH-FA20 is considered...
- generally, E {\displaystyle E} and F {\displaystyle F} need to have only two
unifiable subformulas p 1 {\displaystyle p_{1}} and p 2 {\displaystyle p_{2}} ,...
- "Two CJK
unified ideographs with
identical semantics and
unifiable shapes,"
where "
unifiable" is
taken in the
sense of Han unification. Thus, were Han...
-
Ideographs block in the
range U+FA0E–U+FA2D. Of
these 32 characters: 19 are
unifiable with
characters in the URO, and are
therefore compatibility ideographs...
-
various forms of
intuitionistic type theory. Gérard Huet has
shown that
unifiability is
undecidable in a type-theoretic
flavor of third-order logic, that...
-
stack space, like
loops in
other languages.
Finding clauses that are
unifiable with a term in a
query is
linear in the
number of clauses. Term indexing...
-
variables in
logic programming. Thus it can be
bound more than once to
unifiable values, but
cannot be set back to an
empty or
unresolved state. The dataflow...
- in
common with a term s, and the
subterm s|p is not a
variable and is
unifiable with l via the mgu σ, then s can be
narrowed to the term t = sσ[rσ]p,...
