Toward a semantics for the QUEST language

Fabio Alessi; Franco Barbanera

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1994)

  • Volume: 28, Issue: 6, page 513-555
  • ISSN: 0988-3754

How to cite

top

Alessi, Fabio, and Barbanera, Franco. "Toward a semantics for the QUEST language." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 28.6 (1994): 513-555. <http://eudml.org/doc/92492>.

@article{Alessi1994,
author = {Alessi, Fabio, Barbanera, Franco},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {second-order lambda calculus; QUEST language},
language = {eng},
number = {6},
pages = {513-555},
publisher = {EDP-Sciences},
title = {Toward a semantics for the QUEST language},
url = {http://eudml.org/doc/92492},
volume = {28},
year = {1994},
}

TY - JOUR
AU - Alessi, Fabio
AU - Barbanera, Franco
TI - Toward a semantics for the QUEST language
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1994
PB - EDP-Sciences
VL - 28
IS - 6
SP - 513
EP - 555
LA - eng
KW - second-order lambda calculus; QUEST language
UR - http://eudml.org/doc/92492
ER -

References

top
  1. 1. M. ABABI, G. D. PLOTKIN, A PER Model of Polymorphism and Recursive types, Proc. Symposium on Logic in Computer Science, IEEE, 1990, 355-364. MR1099188
  2. 2. F. ALESSI, F. BARBANERA, Toward a Semantics for the QUEST Language, to appear in Sixth Annual IEES Symposium on Logic in Computer Science, Amsterdam, July 1991. MR1305115
  3. 3. R. AMADIO, Recursion over Realizability Structures, Information and Computation, 1991. Zbl0760.03012MR1097263
  4. 4. H. P. BARENDREGT, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, 103, North-Holland, 1981, Revised Edition, 1984. Zbl0551.03007MR622912
  5. 5. V. BREAZU-TANNEN, T. COQUAND, C. GUNTER, G. SCEDROV, Inheritance and Explicit Coercion, in Fourth Annual IEEE Symposium on Logic in Computer Science, 1989, 112-129. Zbl0716.68012
  6. 6. K. BRUCE, G. LONGO, A Modest Model for Records, Inheritance and Bounded Quantification, Information and Computations 1990, 87, 196-240. Zbl0711.68072MR1055952
  7. 7. L. CARDELLI, Typeful Programming, SRC report 45, 1989. 
  8. 8. L. CARDELLI, G. LONGO, A Semantic Basis for Quest SRC report 55, 1990. MR1140339
  9. 9. L. CARDELLI, P. WEGNER, On Understanding Types, Data Abstraction and Polymorphism, Computing Surveys, 1985, 17, 471-522. 
  10. 10. F. CARDONE, Recursive Types for Fun, Theoretical Computer Science, 1991. Zbl0746.68018MR1122644
  11. 11. R. CARTWRIGHT, Types as Intervals, Proc. Symposium on Principle of Programming Languages, ACM, 1984, 22-36. 
  12. 12. M. COPPO, A Completeness Theorem for Recursively defined Types, Proc. 12th International Colloquium on automata, Languages and programming, LNCS 194, 1985, 120-129. Zbl0585.68047MR819247
  13. 13. M. COPPO, M. ZACCHI, Type Inference and Logical Relations, Proc. Symposium on Logic in Computer Science, IEEE, 1986, 218-226. 
  14. 14. M. DEZANI CIANCAGLINI, B. VENNERI, Partial Types and Intervals, SIAM Journal on Computing, 1990, 19, 644-658. Zbl0697.03005MR1053932
  15. 15. C. GUNTER, Universal Profinite Domains, Information and Computation, 1987, 72, 1-30. Zbl0628.68050MR871554
  16. 16. C. GUNTER, D. SCOTT, Semantic Domains, Handbook of Theoretical Computer Science, North Holland, 1990, 633-674. Zbl0900.68301MR1127197
  17. 17. D. MACQUEEN, G. PLOTKIN, R. SETHI, An Ideal Model for Recursive Polymorphic Types, Information and Control, 1986, 71, 95-130. Zbl0636.68016MR864747
  18. 18. S. MARTINI, Bounded Quantifiers have Interval Models, ACM Conference on LISP and Functional Programming Languages, 1988, 164-173. 
  19. 19. J. C. MITCHELL, A Type Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions, Proceedings of ACM Conference on LISP and Functional Programming, 1986, 308-319. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.