A modal typing system for self-referential programs and specifications
نویسنده
چکیده
This paper proposes a modal typing system that enables us to handle self-referential formulae, including ones with negative self-references, which on one hand, would introduce a logical contradiction, namely Russell’s paradox, in the conventional setting, while on the other hand, are necessary to capture a certain class of programs such as fixed-point combinators and objects with so-called binary methods in object-oriented programming. The proposed system provides a basis for axiomatic semantics of such a wider range of programs and a new framework for natural construction of recursive programs in the proofs-as-programs paradigm.
منابع مشابه
Exploiting Persistent Linkage in Software Engineering Environments
Persistent programming systems are designed to provide technology for the construction and maintenance of large, long-lived object-based application systems. Many successful prototypes have been constructed and a large body of application building experience is emerging. Three common attributes of persistent systems are persistent linkage, strong typing, and the referential integrity of data. P...
متن کاملA Modality for Recursion
We propose a modal logic that enables us to handle self-referential formulae, including ones with negative selfreferences, which on one hand, would introduce a logical contradiction, namely Russell’s paradox, in the conventional setting, while on the other hand, are necessary to capture a certain class of programs such as fixed point combinators and objects with so-called binary methods in obje...
متن کاملOn Modal Systems with Rosser Modalities
Sufficiently strong axiomatic theories allow for the construction of self-referential sentences, i.e. sentences saying something about themselves. After the Gödel’s paper on incompleteness (Gödel, 1931) the self-reference method found further applications—some are listed below—and became even more important. Around say 1970 it appeared that the self-reference method was not only a useful tool, ...
متن کاملPersistent Possibilities for Software Environments
Persistent programming systems are generally recognised as the appropriate technology for the construction and maintenance of large, long-lived object based application systems such as software environments. Here some of the advantages of providing all the support required for the software process within a persistent object store with referential integrity are examined. It is shown that powerfu...
متن کاملSelf-referentiality of Justified Knowledge
The language of justification logic makes it possible to define what it means for knowledge/belief described by an epistemic modality to be self-referential. Building on an earlier result that S4 and its justification counterpart LP describe knowledge that is self-referential, we show that the same is true for K4, D4, and T with their justification counterparts, whereas for K and D self-referen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.09907 شماره
صفحات -
تاریخ انتشار 2017