@article{ITA_1994__28_6_513_0,
author = {Alessi, Fabio and Barbanera, Franco},
title = {Toward a semantics for the {QUEST} language},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {513--555},
year = {1994},
publisher = {EDP Sciences},
volume = {28},
number = {6},
mrnumber = {1305115},
zbl = {0884.68076},
language = {en},
url = {https://www.numdam.org/item/ITA_1994__28_6_513_0/}
}
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 SP - 513 EP - 555 VL - 28 IS - 6 PB - EDP Sciences UR - https://www.numdam.org/item/ITA_1994__28_6_513_0/ LA - en ID - ITA_1994__28_6_513_0 ER -
%0 Journal Article %A Alessi, Fabio %A Barbanera, Franco %T Toward a semantics for the QUEST language %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1994 %P 513-555 %V 28 %N 6 %I EDP Sciences %U https://www.numdam.org/item/ITA_1994__28_6_513_0/ %G en %F ITA_1994__28_6_513_0
Alessi, Fabio; Barbanera, Franco. Toward a semantics for the QUEST language. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 6, pp. 513-555. https://www.numdam.org/item/ITA_1994__28_6_513_0/
1. , , A PER Model of Polymorphism and Recursive types, Proc. Symposium on Logic in Computer Science, IEEE, 1990, 355-364. | MR
2. , , Toward a Semantics for the QUEST Language, to appear in Sixth Annual IEES Symposium on Logic in Computer Science, Amsterdam, July 1991.
3. , Recursion over Realizability Structures, Information and Computation, 1991. | Zbl | MR
4. , The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, 103, North-Holland, 1981, Revised Edition, 1984. | Zbl | MR
5. , , , , Inheritance and Explicit Coercion, in Fourth Annual IEEE Symposium on Logic in Computer Science, 1989, 112-129. | Zbl
6. , , A Modest Model for Records, Inheritance and Bounded Quantification, Information and Computations 1990, 87, 196-240. | Zbl | MR
7. , Typeful Programming, SRC report 45, 1989.
8. , , A Semantic Basis for Quest SRC report 55, 1990. | MR
9. , , On Understanding Types, Data Abstraction and Polymorphism, Computing Surveys, 1985, 17, 471-522.
10. , Recursive Types for Fun, Theoretical Computer Science, 1991. | Zbl | MR
11. , Types as Intervals, Proc. Symposium on Principle of Programming Languages, ACM, 1984, 22-36.
12. , A Completeness Theorem for Recursively defined Types, Proc. 12th International Colloquium on automata, Languages and programming, LNCS 194, 1985, 120-129. | Zbl | MR
13. , , Type Inference and Logical Relations, Proc. Symposium on Logic in Computer Science, IEEE, 1986, 218-226.
14. , , Partial Types and Intervals, SIAM Journal on Computing, 1990, 19, 644-658. | Zbl | MR
15. , Universal Profinite Domains, Information and Computation, 1987, 72, 1-30. | Zbl | MR
16. , , Semantic Domains, Handbook of Theoretical Computer Science, North Holland, 1990, 633-674. | Zbl | MR
17. , , , An Ideal Model for Recursive Polymorphic Types, Information and Control, 1986, 71, 95-130. | Zbl | MR
18. , Bounded Quantifiers have Interval Models, ACM Conference on LISP and Functional Programming Languages, 1988, 164-173.
19. , A Type Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions, Proceedings of ACM Conference on LISP and Functional Programming, 1986, 308-319.





