| 词汇 | example_english_soundness |
| 释义 | Examples of soundnessThese examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. The main result of this subsection follows as an immediate corollary of the soundness of the typing system. The tool's soundness theorem is expressed in terms of the bit-level semantics of x86 programs, so its correctness depends on very few assumptions. If the system in figure 4 is operationally correct then, because of the soundness theorem above, the system in figure 3 is operationally correct. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence, and weak normalization. Section 5 then proves soundness (but not completeness) in the general case where predicates in contracts may diverge. The addition of recursive contracts has far-reaching implications, deeply affecting the formulation of our model and requiring different techniques for proving soundness. The following results are required by the proof of the soundness theorem below. We are interested in the soundness and conservativity issues these features raise: can we ensure modularity features do not lead to inconsistencies? Our proof (sections 4 and 5) is short, but not as straightforward as those of soundness and conservativity. In this section, we describe how this executable model has been used to check the soundness of polymorphic inference rules by calculation. We give dynamic and static semantics for the language, and prove the soundness of the type system. Therefore, soundness and completeness alone are insufficient for proving that the considered calculus provides an internal language of the complete models. The following theorem shows the soundness of substitution. We will establish that these processes are in fact bisimilar and then, by soundness, we may conclude that they are contextual observational equivalent. We present a new soundness proof for their logic using denotational semantics. We now get the following statement of soundness and completeness. Moreover, we have defined a call-by-need strategy that performs module simplification only when needed and only once, and have proved its soundness and completeness. As a preliminary result towards soundness, we show that the interpretation is sound with respect to subtyping and convertibility. Moreover, the simpler structure of hedges allows a less complex proof of soundness up to weakening than is required for alley bisimilarity. They are rather simple, but give rise to interesting compounds, whose respectfulness-and hence soundness-comes then for free. The following theorem shows the soundness of expansion. The following theorem shows the soundness of lifting. The soundness and completeness of the machine is proved. In this paper we present two general methods for showing the soundness of this principle. One may wonder whether the soundness of the interpretation is perhaps not an issue. The if direction is soundness, so consider the only if direction. In the next three sections, we show the intermediate results (soundness, convergence, completeness). The soundness result of simple type assignment with respect to reduction is stated as usual in the following way. The soundness and completeness results in the last section can be easily extended to this setting. Finally, we can state the soundness result: the encodings of two equivalent processes are equivalent, and vice versa. Where a lack of soundness produces weak functional synthesis, evaluation plays an important role in limiting search. With respect to that semantics we will prove type preservation and type soundness for the type system (section 3) and the flow-type system (section 7). The soundness of all these analyses involves a notion that we call consistency. Note that it is soundness, and not completeness, which is problematic in the general case. The formulation of the algorithm is judgment-based like ours and justified by a cut admissibility argument rather than a soundness proof as in our case. In this section we prove the soundness of the region analysis for the extended region calculus. No denotational semantics or soundness results are given there. The soundness of infinite unfolding follows because the semantics of a recursive type is the limit of the semantics of its finite unfoldings. They are very recent and ongoing, and they seem to be the first to present thorough soundness results. There are frameworks for evaluating the scientific soundness of health measures. We also present a procedure for goal solving, showing its soundness and completeness for computing answer constraints. We give a simple condition that ensures soundness. The usual property of subject reduction holds, which guarantees the soundness of the system by ensuring that typing is preserved by computation and structural equivalence. The following result is crucial for type soundness. A denotational semantics guarantees the soundness of this definition. In our system, the soundness of a proof must be checked by gp. Both historians were very keen on the methodological soundness of identity construction. Influential sectors of the psychiatric community now question its soundness. The following result states the soundness of the analysis based on the solution of this set of constraints. We would like to emphasize that the above result states soundness of this method, but not completeness. The soundness of the natural method follows from the following simple property. We now have most of the ingredients to prove soundness. In addition, because knowledge is implied by the cases rather than explicitly stated, soundness of design generation is not guaranteed. What teachers need is linguistic sophistication, pedagogical soundness, and cultural sensitivity. In some cases, such as the eddy viscosity hypotheses, their soundness and validity have been questioned on the basis of general physical considerations. Again, the type instantiation and substitution are not necessary for evaluation, but rather make it easier to prove type soundness. In turn, this allowed us to state and prove a type soundness theorem easily. The result then follows by soundness of the categorical interpretation. 2-7. The following asserts the soundness of the effect system. Property (3) expresses the soundness of the analysis, and (4) expresses the correctness of the transformation as justified by the analysis. As in most work of this kind, they prove the soundness of their analyses but do not prove the correctness of any program transformations. Here we extend that work by giving a more thorough and formal treatment, including a proof of type soundness. They define an inference engine based on standard flow analysis techniques and prove its soundness. One should remark that this also provides an alternative proof of the soundness of these three approaches. We can then state the soundness property of the two-phase system. We turn now to the question of soundness of type assignment for the extension of the semantics with first-class continuations. Constructors, in full generality, pose a challenge even for ordinary type soundness because partially initialized objects can be leaked. Few results exists about soundness issues for the language support. They have an attractive approach to proving noninterference by translation to ordinary unannotated types and by then appealing to a type soundness theorem. We therefore call the property that each such pattern can be reduced local soundness. In the remaining sections we introduce some technical machinery required to state and prove soundness and completeness. The soundness of pragmatic reasoning in favour of theism is unclear, as attested by its long controversial history. In practice, soundness and completeness are dicult, if not impossible, to achieve. Making a sound (empty cache) satisfiability check before committing to a solution allows the solver to re-establish soundness. Now, soundness can be proved by a straightforward induction on inference derivations. The construction of v is one of the technical difficulties of the soundness proof. The type-splitting system enjoys soundness and completeness of type inference and error-checking. However, by maintaining the safety of contracts we manage to contain the damage well enough to keep soundness intact. A novel type system is presented and type soundness is proved. Improved tool support for the semantics would be of great value, for meta-typechecking, for conformance testing, and for proofs of soundness. To ensure soundness, existing values of changed abstract types will be converted to the new representation during a garbage-collection phase at update-time. They also propose a rule for procedures that allow pointer passing and discuss its soundness and completeness. Especially they would like to thank the referee who suggested the use of safe operational semantics to simplify the presentation and proof of soundness. Philosophy is, to a large degree, about arguments and their validity and soundness. After observing this semantic update to coincide with syntactic update in the absence of aliasing, they establish soundness and relative completeness of their proof rules. To formalize and prove soundness we need the following definition. Then will still hold so soundness is assured. The system remains simple and intuitive, but it enjoys a strong soundness property whose proof is non-trivial. We shall discuss how this extension affects the properties of soundness and completeness that we proved previously. We start with soundness, whose proof is quite similar to that of soundness in the absence of splitting. Clearly the soundness of the idea rests on the requirement that prompts of different types never have the same internal representation. One may wonder whether a completeness result holds, as a converse to our soundness result. The following theorem proves the soundness of the interpretation. Results for soundness, idempotence and commutativity for abstract unification using this abstraction function are proven. The results for soundness, idempotence and commutativity for abstract unification using this abstraction function are proved. Nonetheless, it is natural to investigate some restrictions that may guarantee the soundness and/or the completeness of the answers. The soundness theorem is based on two auxiliary results. In the following we will formalize these ideas and show soundness and completeness of the proposed procedure. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。