M. P. Jones. A theory of qualified types. Science of Computer Programming, 22(3):231--256, June 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Enforcing High-Level Protocols in Low-Level Software - DeLine, Fahndrich (2001) (131 citations) (Correct)
....to type qualifiers [7] However, type qualifiers refine the type (how the object can be manipulated) rather than guarding the access (when the object can be accessed) Furthermore, type qualifiers are constant and cannot change state. Guarded types can be viewed as a form of qualified types [9, 10] N , where the qualification quantifies over the abstract store . At each use, the type must be instantiable to the current store and the predicate must be satisfied . However, the framework of qualified types lacks a notion of state. Vault shares much of the ....
M. P. Jones. A theory of qualified types. Science of Computer Programming, 22(3):231--256, June 1994.
Machine-Assisted Theorem-Proving for Software Engineering - Martin (1994) (6 citations) (Correct)
....a critical one. The introduction to [WB92] surveys the competing options. Some authors have avoided confronting this issue, using fragments of logics which give sound inferences (or indeed, unsound ones, as above) within Z without addressing difficulties such as the ones above (see, for example, Jon91b] on [Dil90] Most of the impetus for providing a complete logic for Z has come from those seeking to provide proof tools for Z. The 1 The meta logic also needs to be shown to be sound. This is claimed for 2OBJ (it has an extensive underlying theory) but a demonstration of the actual ....
R. B. Jones. Book review of [Dil90]. Science of Computer Programming, 16(3):286--288, 1991.
Syntactic Properties of Polymorphic Subtyping - Henglein (1996) (6 citations) (Correct)
....with subtyping has been studied by Kaes [Kae92] and 7 Though it should be noted that having logical type operators such as disjunction or conjunction available does make a difference. Smith [Smi91, Smi93, Smi94] 8 Kaes presents a qualified type inference system that, in contrast to Jones s [Jon92, Jon94], allows incorporating subtyping steps. He presents a type inference algorithm that computes principal types and applies some simplifications analogous to Fuh and Mishra s application of matching substitutions [FM88, FM90] His system includes a form of overloading and allows, with some ....
Mark Jones. A theory of qualified types. Science of Computer Programming, 22:231--256, 1994.
Design, Analysis and Reasoning about Tools: Abstracts from.. - Nielson, (Ed.) (1993) (Correct)
No context found.
N. D. Jones, ed., Selected Papers of ESOP'90. Science of Computer Programming. Volume 17, numbers 1-3, pages 1-271, Elsevier, 1991. [DART-62]. #
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC