نتایج جستجو برای: orientedness

تعداد نتایج: 86  

1992
G. CASTAGNA G. GHELLI G. LONGO Giuseppe Castagna Giorgio Ghelli Giuseppe Longo

We present a simple extension of typed-calculus where functions can be overloaded by putting diierent \branches of code" together. When the function is applied, the branch to execute is chosen according to a particular selection rule which depends on the type of the argument. The crucial feature of the present approach is that the branch selection depends on the \run-time type" of the argument ...

2017
Megan Squire

At its core, free, libre, and open source software (FLOSS) is defined by its adherence to a set of licenses that give various freedoms to the users of the software, for example the ability to use the software, to read or modify its source code, and to distribute the software to others. In addition, many FLOSS projects and developers also champion other values related to "freedom" and "openness"...

Journal: :Mathematical Structures in Computer Science 1998
Burghard von Karger

We develop temporal logic from the theory of complete lattices, Galois connections, and xed points. In particular, we prove that all seventeen axioms of Manna and Pnueli's sound and complete proof system for linear temporal logic can be derived from just two postulates, namely that (+; e ?) is a Galois connection and that (?; +) is a perfect Galois connection. For the branching time logic CTL w...

1994
S. Barbey A. Strohmeier

Within object-oriented methods, testing has received less attention than analysis, design, and coding. However, object-orientedness does not make testing obsolete and can even introduce new problems into the production of correct programs and their testing. Most work in testing has been done with "procedure-oriented" software in mind. Traditional methods, despite their efficiency, cannot be app...

This study was aimed to present a model for social responsibility of audit firms using the grounded theory method. To this end, the components and dimensions of social responsibility model of audit firms were identified and explained. The research method was applied in terms of purpose, mixed (qualitative-quantitative)exploratoryin termsof datatype, anddescriptive-correlationalinterms of data c...

1997
António Branco Palmira Marrafa

We discuss data showing that, unlike other long-distance anaphors widely documented in the literature (e.g. ziji from Chinese, caki from Korean, zibun, from Japanese, etc.), the Portuguese ele próprio is not subject-oriented. This supports a reformulation of Principle Z, encompassing subject-oriented and non subject-oriented long-distance anaphora, which shows up as the fourth binding principle...

1992
Raghu Ramakrishnan Divesh Srivastava S. Sudarshan

Bottom-up evaluation of queries on deductive databases has many advantages over an evaluation scheme such as Prolog. It is sound and complete with respect to the declarative semantics of least Herbrand models for positive Horn clause programs. In particular, it is able to avoid innnite loops by detecting repeated (possibly cyclic) subgoals. Further, in many database applications , it is more ee...

2003
Vashti Galpin Ian Sanders Heather Turner Bernadine Venter

This report describes research into gender and educational background and its relationship with computer self-efficacy and perceptions of Computer Science amongst university students and school students in South Africa. It is important to understand these issues in the specific cultural and economic environment of South Africa. The main focus of this report is on self-efficacy which is defined ...

2007
J. Malenfant C. Dony

In MCD92], we have contributed a reeective model for a prototype-based language based on the lookup apply re-ective introspection protocol. Here, we pursue this work by including a reiication of continuations. Hence, we provide continuations as rst-class objects and convert our previous protocol to handle them. First-class continuations provide much more control over the current computation. Al...

1995
Giuseppe Castagna Giorgio Ghelli Giuseppe Longo

We present a simple extension of typed-calculus where functions can be overloaded by adding diier-ent \pieces of code". In short, the code of an overloaded function is formed by several branches of code; the branch to execute is chosen, when the function is applied, according to a particular selection rule which depends on the type of the argument. The crucial feature of the present approach is...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید