On behalf of:

Introduction: Two dogmas of reificatory semantics What is meaning, what is it for a sign to be meaningful, how can meaning best be analyzed, and in what sense is linguistic meaning proper or unique to language? Cognitive linguistics offers answers to these questions that challenge two traditional dogmas of linguistic theory, philosophy of language and cognitive science. However, although they have notionally abandoned both these dogmas, many cognitive linguists retain an ambiguous loyalty to some of their underlying presuppositions. I hope to convince them of the necessity to review their deep theoretical commitments, in order to rebut, once and for all, the charge that cognitive semantics entails a Subjectivist theory of meaning. The two dogmas are: (1) the Dogma of the Autonomy of linguistic meaning; and (2) the Dogma of the Compositionality of linguistic meaning. Both these dogmas are variants of a more general, fatal misconception of the nature of linguistic meaning, namely that

The ultimate goal of all computer science is the program. The performance of programs was once the noblest function of computer science, and computer science was indispensable to great programs. Today, programming and computer science exist in complacent isolation, and can only be rescued by the conscious co-operation and collaboration of all programmers. The universities were unable to produce this unity; and how indeed, should they have done so, since creativity cannot be taught? Designers, programmers and engineers must once again come to know and comprehend the composite character of a program, both as an entity and in terms of its various parts. Then their work will be filled with that true software spirit which, as “theory of computing”, it has lost. Universities must return to programming. The worlds of the formal methods and algorithm analysis, consisting only of logic and mathematics, must become once again a world in which things are built. If the young person who rejoices in creative activity now begins his career as in the older days by learning to program, then the unproductive “scientist ” will no longer be condemned to inadequate science, for their skills will be preserved for the programming in which they can achieve great things. Designers, programmers, engineers, we must all return to programming! There is no essential difference between the computer scientist and the programmer. The computer scientist is an exalted programmer. By the grace of Heaven and in rare moments of inspiration which transcend the will, computer science may unconsciously blossom from the labour of the hand, but a base in programming is essential to every computer scientist. It is there that the original source of creativity lies. Let us therefore create a new guild of programmers without the class-distinctions that raise an arrogant barrier between programmers and computer scientists! Let us desire, conceive, and create the new program of the future together. It will combine design, user-interfaces, and programming in a single form, and will one day rise towards the heavens from the hands of a million workers as the crystalline symbol of a new and coming faith. 1 1

this paper is the paradox that the utter unpredictibility of language is nevertheless governed by laws.

Evaluating and comparing modelling languages is a prerequisite for progress in the field of conceptual modelling. However, only little research has been dedicated to the investigation of appropriate evaluation methods. It is common practice that mainly those who design modelling language decide about the relevance of particular features. In this paper, we argue that such an approach does not satisfy common academic standards. The quality of a modelling language depends on a variety of tasks and potential users, some of which are beyond the scope of language designers. Therefore, the evaluation of modelling languages requires a cross-disciplinary approach. Furthermore, it has to be taken into account that the analysis of a language imposes severe epistemological problems. Against this background, we introduce a meta-framework for the evaluation of modelling languages. It includes a conceptual model to guide and structure multi-perspective evaluations.

ion is in a precise sense a converse operation to application. Given 49 50 CHAPTER 5. PRIMITIVE BASIS OF HOL LIGHT a variable x and a term t, which may or may not contain x, one can construct the so-called lambda-abstraction x: t, which means `the function of x that yields t'. (In HOL's ASCII concrete syntax the backslash is used, e.g. \x. t.) For example, x: x + 1 is the function that adds one to its argument. Abstractions are not often seen in informal mathematics, but they have at least two merits. First, they allow one to write anonymous function-valued expressions without naming them (occasionally one sees x 7! t[x] used for this purpose), and since our logic is avowedly higher order, it's desirable to place functions on an equal footing with rstorder objects in this way. Secondly, they make variable dependencies and binding explicit; by contrast in informal mathematics one often writes f(x) in situations where one really means x: f(x). We should give some idea of how ordina...

"Industrial strength" software development environments (SDEs) must provide facilities to address three essential properties of multi-developer software systems: evolution, complexity and scale. It is my contention that in order to be an industrial strength SDE, an environment must support at least a city model environment. Moreover, SDEs must include such high level policies as supporting cooperation and communication, supporting a unified process and product, providing multiple means of expression, supporting inter- and intraconnections, managing the change process and managing the multiplicity of versions. Underlying the implementation of these policies are three themes: developer-machine symbiosis in which the machine becomes an active partner in system development and evolution; formalization of the development/evolution process so that we can reason about the process and automate its support; and finally, formalization of the software product so that we can reason about it and au...

Formal ontology, as the science of the formal relations that structure reality as a whole, aims at a theory of categories corresponding to the most general features of possible objects, whether existing or non-existing. The present paper is an attempt to summarise and extend recent research in analytical metaphysics in a formalised theory of objects. Existence is characterised as a formal property, suggesting that the use of quantifiers alone does not involve any existential assumptions about the objects quantified over. However, the only non-existing objects allowed for in the present account are real or objective possibilities. De re modalities as well as ontological dependence are defined on the basis of a counterpart-theoretic specification of possibilia. The present framework allows for necessary and non-relative identity as well as for a granular parthood relationship satisfying the thesis of composition as partial identity. The paper culminates in the formalisation of an Aristotelian four-category ontology allowing for universals and particulars, substances and particularised properties; in this context, the redundance of higher-order material universals as well as moderate haecceitism is argued for. After a short analysis of relationality and extrinsicness, a theory of spatial and temporal objects is sketched and a temporal counterpart theory is proposed as a solution to the problem of temporary intrinsics. The paper concludes with some general remarks on the relation between ontology and the theory of subjectivity, defending a modal approach to consciousness and a counterpart theoretic analysis of intentionality.

Dynamic compilation often comes at the price of reduced code quality, because there is not enough time available to perform expensive optimizations. One solution to this problem has been the addition of annotations by the code producer that enable a dynamic code generator on the code consumer 's side to shortcut certain analysis and optimization steps. However, code annotation often creates a new problem, in that most such annotations are unsafe|if they become corrupted during transit, then the safety of the target system is in jeopardy.

The notion of tacit knowledge has been widely and diversely adopted in the knowledge management literature. It is used to cover knowledge which hasn’t yet been articulated as well as knowledge which various authors argue cannot ever be articulated. This paper seeks to review these differences and proposes a conceptual means of understanding the issues associated with tacit knowledge. It draws on the work of Collins and Kusch to introduce notions of polimorphic and mimeomorphic actions before raising implications for the practice of knowledge management.