Home >> Science >> Technology >> Electronics >> Design >> Hardware Description Languages >> Confluence




The confluence is the merger or even even even meeting of deuce or supplementary objects (or cases) that seem to inseparably attach their various forces or attributes into the point of junction.

Geography

A word is generally utilized around geography to describe the point in which deuce rivers meet and get of these, unremarkably whilst the tributary joins a supplementary major flow of any stream. These are besides wont to describe the location in which an accurate around-total latitude & longitude line converge (i personally.e. a point inside extreme northeastern New Jersey that is at 41-deg N latitude & 74-deg W longitude is such the confluence point).

Etymology

A word is comprised of the prefix con (from either a Latin "com"), meaning "with" or even "together", & joined by having a postfix fluence from either a Latin "fluere" meaning "to flow". A resultant meaning literally translates when "to flow together". These are interesting to note that a connexion of each prefix & suffix to produce a word confluence occurs as confluence intrinsically; each word area join to form something that flows in the fantastic flow of any stream of language. A German city title Koblenz indicates, in Germanicized form, its places at a confluence of a Rhine & the Moselle.

HDL
Confluence occurs as modern functional hardware description language (HDL, but not to be confused by owning high density lipoproteins (HDL)).

Computer science

Confluence, given the rewrite system \mathcal, however can be resolved to the equivalent term fallowing plenty reduction steps. For instance, in the lambda calculus confluence is shown via the Church-Rosser theorem.

Merging rescript systems may be utile for analyzing provable equality in equational logic. This is because inside the merging rules, an equation is demonstrable precisely whilst each terms reduce to the equivalent lone term. This idea holds within several revision systems, including a typewritten & untyped lambda calculus.

Whenever \mathcal occurs as placed of rescript system, you could indicate that whenever 2 terms M & North come reduced to the term P so a as a result equational axiom holds,

\mathcalNorth,

given a placed of equational hypotheses \mathcal, a rescript relation \hookrightarrow defined when a reflexive, harmonious & transitive closure of the individual rewrite step \rightarrow & \Gammthe a work mapping variables to types.

Local and global confluence

I personally could more characterize the revision technique per as punishment properties:

spherical confluence or even only confluence holds whenever 2 terms M & North rewrite to P under a revision relation \hookrightarrow_ when opposed to, local confluence which occurs as strictly weaker patterns because i indicate that them terms M & North come demonstrable match, only term M revision to P by an initial rewrite step across a relation \rightarrow_O. A equivalent applies for the revision relation above term North. These are crucial to distinguish them because the rules may be locally merging, however non globally merging, shown in the case beneath.

Example

Assume a below, taken from either [1]. Given a rescript formulas,

the\rightarrow b, b\rightarrow a, a\rightarrow a_0, b\rightarrow b_0

i personally potty indicate that a models patch locally merging is non merging generally. You indicate local confluence by noticing that the term a potty rewrite to b & b potty rewrite to the, the could so become rewritten to b. I personally don't keep around confluence because a may be rewritten to a_0, b rewritten to b_0. However since neither a_0 or even b_0 may be reduced to the more, confluence fails.

So intuitively, local confluence exclusively guarantees that inside 1 reduction step i personally potty rewrite one term to the more. Spell hard confluence nonorth single guarantees a above, however as well that for n steps of reduction i have local confluence, so by induction, a whole rules is globally merging.

These are helpful to note that around the terminating rewrite system local confluence is the same when spherical confluence.

Critical pairs

An significant notion is the critical pair. The critical pair is of terms representing an interaction between revision system.

Left-linear rewrite system

To Do r2=6 x=Two-One(Octet).

Confluent.org
Confluence language development, designer resources, and other free frontend EDA tools.

User Mailing List
Mailing list provides user support, Confluence related discussion, bug reports, and release notification.






© 2005 GeneralAnswers.org