Search results
Results From The WOW.Com Content Network
In later years, Nida distanced himself from the term "dynamic equivalence" and preferred the term "functional equivalence". [ 2 ] [ 3 ] [ 4 ] What the term "functional equivalence" suggests is not just that the equivalence is between the function of the source text in the source culture and the function of the target text (translation) in the ...
His most notable contribution to translation theory is Dynamic Equivalence, also known as Functional Equivalence. For more information, see "Dynamic and formal equivalence." Nida also developed the componential analysis technique, which split words into their components to help determine equivalence in translation (e.g. "bachelor" = male ...
This is a comparison of the features of the type systems and type checking of multiple programming languages.. Brief definitions A nominal type system means that the language decides whether types are compatible and/or equivalent based on explicit declarations and names.
The question of fidelity vs. transparency has also been formulated in terms of, respectively, "formal equivalence" and "dynamic [or functional] equivalence" – expressions associated with the translator Eugene Nida and originally coined to describe ways of translating the Bible; but the two approaches are applicable to any translation. "Formal ...
In this attempt, Vermeer sought another method of translation that would go beyond looking only at the linguistics level and consequently move translation forward from “the eternal dilemmas of free vs. faithful translation, dynamic vs. formal equivalence, good interpreters vs. slavish translators, and so on”, [5] which are problems existing ...
The table shows a comparison of functional programming languages which compares various features and designs of different functional programming languages. Name Pure
Equivalence Checking of Retimed Circuits: Sometimes it is helpful to move logic from one side of a register to another, and this complicates the checking problem. Sequential Equivalence Checking: Sometimes, two machines are completely different at the combinational level, but should give the same outputs if given the same inputs.
Backus calls functional programming applicative programming; [clarification needed] his function-level programming is a particular, constrained type. A key distinction from functional languages is that Backus' language has the following hierarchy of types: atoms; functions, which take atoms to atoms