Bounded quantifiers have Interval Models

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a sound model for an extension of the language Fun, proposed by L. Cardelli and P. Wegner as a formalization of the notion of inheritance in the context of higher order polymorphic functional languages. The model Is obtained by modifying the Interval Model proposed by R. Cartwright, In order to accomodate bounded quantifiers and to obtain a sound structure. Our extension of the language supports also a general recursion operator for functions (but not for types).

Cite

CITATION STYLE

APA

Martini, S. (1988). Bounded quantifiers have Interval Models. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming, LFP 1988 (pp. 164–173). Association for Computing Machinery, Inc. https://doi.org/10.1145/62678.62699

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free