Results 251 to 260 of about 1,160,550 (308)
Some of the next articles are maybe not open access.
ACM Transactions on Programming Languages and Systems, 1996
A relation between recursive object types, called matching , has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded
MartÃn Abadi, Luca Cardelli
openaire +1 more source
A relation between recursive object types, called matching , has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded
MartÃn Abadi, Luca Cardelli
openaire +1 more source
Subtypes for specifications: predicate subtyping in PVS
IEEE Transactions on Software Engineering, 1998A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, type checking for the language can exploit the services of the theorem prover. We describe a feature called "predicate subtyping" that uses this capability and illustrate its utility as ...
John M. Rushby +2 more
openaire +1 more source