نتایج جستجو برای: strict pseudo
تعداد نتایج: 80432 فیلتر نتایج به سال:
The ubiquitous schema ‘All Fs are Gs’ dominates much philosophical discussion on laws but rarely is it shown how actual laws mentioned and used in science are supposed to fit it. After consideration of a variety of laws, including those obviously conditional and those superficially not conditional (such as equations), I argue that we have good reason to support the traditional interpretation of...
What is a non-strict functional language? Is a non-strict language necessarily lazy? What additional expressiveness brings non-strictness, with or without laziness? This paper tries to shed some light on these questions. First, in order to characterize non-strictness, di1erent evaluation strategies are introduced: strict, lazy, and lenient. Then, using program examples, how these evaluation str...
Non-strict evaluation improves the expressive power of functional languages at the expense of an apparent loss of eeciency. In this paper we give examples of this expressive power, taking as an example an interactive functional program and describing the programming techniques depending on non-strict evaluation which improved its design. Implementation methods for non-strict languages have deli...
abstract: the present thesis includes ; one preface and 11speeches , that each speech considered in different researches . the prefact part , studied grammer back ground , the first speech considered a brief description about grammatical credits . the second speech considered the different typs of sentences , from structure and meaning points of view . the third speech considered the verb es...
We provide a necessary and sufficient condition for strict local minimisers of differences of convex (DC) functions, as well as related results pertaining to characterisation of (non-strict) local minimisers, and uniqueness of global minimisers.
In 1926, Ernst Mally proposed the first system of deontic logic. His system turned out to be unacceptable. How can it be repaired? We discuss several proposals to reformulate it in terms of strict implication, relevant implication and strict relevant implication.
The untilmodality of temporal logic “A until B” is called strict in its first argument when it does not constrain the value of the first argument A at the instant at which the formula is evaluated. In this paper, we show that linear metric temporal logics with bounded until modalities that are non-strict in the first argument are as expressive as those with strict modalities, when interpreted o...
1 Introduction 2 Defining conditionals 2.1 What is a conditional? 2.2 The marking of conditionals 3 Structural issues 3.1 The position of merger of the if-clause 3.1.1 If-clauses as adverbial clauses 3.1.2 Height of attachment 3.1.3 A source for sentence-initial if-clauses 3.2 Clause-internal syntax of the if-clause 3.2.1 The location of if 3.2.2 The conditional–interrogative link 3.2.3 The abs...
Theoretical codes (TC’s) are the abstract models that emerge during the sorting of mature memos in to a potential substantive theory. They conceptualize the integration of substantive codes into hypotheses of a substantive theory. The researcher is challenged to staying open to their emergence and earned relevance rather than their preconceived forcing, which is very strong. They not only bring...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید