ACM Home Page
Please provide us with feedback. Feedback
Bounded quantifiers have interval models
Full text PdfPdf (1.04 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1988 ACM conference on LISP and functional programming table of contents
Snowbird, Utah, United States
Pages: 164 - 173  
Year of Publication: 1988
ISBN:0-89791-273-X
Author
Simon Martini  Departimento di Informatica, Università di Pisa, Corso Italia, 40, I-56100 Pisa, Italy
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/62678.62699
What is a DOI?

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 1anguages. The model is obtained by modifying the Interval Model proposed by R. Cartwright, in order to accommodate 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).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Amadio R. {1988} 'A fixed point extension to the polymorphic lambda calculus", IEEE Conference on Log/c 01 Computer Science 88, Edinburgh, July.
 
2
Bruce K,, Longo G, {1988} "A modest model of records, inheritance and bounded quantification", IEEE Conference on Logic in Computer Science 88, Edinburgh, July.
 
3
 
4
 
5
CardeUi L. {1984} 'A semantics of rnultiple inheritance~, Intl. and Computation, to appear.
6
7
8
 
9
Dezanl M., Vennerl B. {1987} 'Partial types and intervals', preprtnt, Dip. di Informatica, Universit~ di Torino, October.
 
10
Girard, J. {1972} Interpretation fonclionelle et elimination des coupures darts l'arithmetique d'ordre superieur, Th~se de Doctorat d'Etat, Paris.
 
11
 
12
 
13
 
14
Martini S. {1988} ModeUl non estensionali del polimorfismo in programmazione funzionale, tesl di Dottorato dt Ricerca, Unlversita di Pisa, January.
 
15
Milner R. {1978} ',% theory of type polymorphism in progrmnming', Journal of Computer and Systems Sc~, 3 (348-375).
 
16
 
17
 
18
 
19
Seely R.A.G. {1986} 'Categorical semantics for higher order polymorphic lambda calculus", J. of Symbolic Logic, vol 52, n. 4 (Dec 87), 969-989.