{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:40:10Z","timestamp":1749944410042,"version":"3.41.0"},"reference-count":19,"publisher":"EDP Sciences","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1994]]},"DOI":"10.1051\/ita\/1994280605131","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:55:01Z","timestamp":1486047301000},"page":"513-555","source":"Crossref","is-referenced-by-count":0,"title":["Toward a semantics for the QUEST language"],"prefix":"10.1051","volume":"28","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Barbanera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. ABABI M., PLOTKIN G. D., A PER Model of Polymorphism and Recursive types, Proc. Symposium on Logic in Computer Science, IEEE, 1990, 355-364.1099188","DOI":"10.1109\/LICS.1990.113761"},{"key":"R2","unstructured":"2. ALESSI F., BARBANERA F., Toward a Semantics for the QUEST Language, to appear in Sixth Annual IEES Symposium on Logic in Computer Science, Amsterdam, July 1991.1305115"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. AMADIO R., Recursion over Realizability Structures, Information and Computation, 1991.10972630760.03012","DOI":"10.1016\/0890-5401(91)90074-C"},{"key":"R4","unstructured":"4. BARENDREGT H. P., The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, 103, North-Holland, 1981, Revised Edition, 1984.6229120551.03007"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. BREAZU-TANNEN V., COQUAND T., GUNTER C., SCEDROV G., Inheritance and Explicit Coercion, in Fourth Annual IEEE Symposium on Logic in Computer Science, 1989, 112-129.0716.68012","DOI":"10.1109\/LICS.1989.39166"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. BRUCE K., LONGO G., A Modest Model for Records, Inheritance and Bounded Quantification, Information and Computations 1990, 87, 196-240.10559520711.68072","DOI":"10.1016\/0890-5401(90)90062-M"},{"key":"R7","unstructured":"7. CARDELLI L., Typeful Programming, SRC report 45, 1989."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. CARDELLI L., LONGO G., A Semantic Basis for Quest SRC report 55, 1990.1140339","DOI":"10.1145\/91556.91586"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. CARDELLI L., WEGNER P., On Understanding Types, Data Abstraction and Polymorphism, Computing Surveys, 1985, 17, 471-522.","DOI":"10.1145\/6041.6042"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. CARDONE F., Recursive Types for Fun, Theoretical Computer Science, 1991.11226440746.68018","DOI":"10.1016\/0304-3975(91)90038-4"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. CARTWRIGHT R., Types as Intervals, Proc. Symposium on Principle of Programming Languages, ACM, 1984, 22-36.","DOI":"10.1145\/318593.318604"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. COPPO M., A Completeness Theorem for Recursively defined Types, Proc. 12th International Colloquium on automata, Languages and programming, LNCS 194, 1985, 120-129.8192470585.68047","DOI":"10.1007\/BFb0015737"},{"key":"R13","unstructured":"13. COPPO M., ZACCHI M., Type Inference and Logical Relations, Proc. Symposium on Logic in Computer Science, IEEE, 1986, 218-226."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. DEZANI CIANCAGLINI M., VENNERI B., Partial Types and Intervals, SIAM Journal on Computing, 1990, 19, 644-658.10539320697.03005","DOI":"10.1137\/0219043"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. GUNTER C., Universal Profinite Domains, Information and Computation, 1987, 72, 1-30.8715540628.68050","DOI":"10.1016\/0890-5401(87)90048-4"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. GUNTER C., SCOTT D., Semantic Domains, Handbook of Theoretical Computer Science, North Holland, 1990, 633-674.11271970900.68301","DOI":"10.1016\/B978-0-444-88074-1.50017-2"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. MACQUEEN D., PLOTKIN G., SETHI R., An Ideal Model for Recursive Polymorphic Types, Information and Control, 1986, 71, 95-130.8647470636.68016","DOI":"10.1016\/S0019-9958(86)80019-5"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. MARTINI S., Bounded Quantifiers have Interval Models, ACM Conference on LISP and Functional Programming Languages, 1988, 164-173.","DOI":"10.1145\/62678.62699"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. MITCHELL J. C., A Type Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions, Proceedings of ACM Conference on LISP and Functional Programming, 1986, 308-319.","DOI":"10.1145\/319838.319872"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1994280605131\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:16:30Z","timestamp":1749942990000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1994280605131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":19,"journal-issue":{"issue":"6"},"alternative-id":["ita1994280605131"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1994280605131","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[1994]]}}}