EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 28 / No 6 (1994) RAIRO-Theor. Inf. Appl., 28 6 (1994) 513-555 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 28, Number 6, 1994
Page(s) 513 - 555
DOI https://doi.org/10.1051/ita/1994280605131
Published online 01 February 2017
  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. [MR: 1099188] [Google Scholar]
  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. [MR: 1305115] [Google Scholar]
  3. 3. R. AMADIO, Recursion over Realizability Structures, Information and Computation, 1991. [MR: 1097263] [Zbl: 0760.03012] [Google Scholar]
  4. 4. H. P. BARENDREGT, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, 103, North-Holland, 1981, Revised Edition, 1984. [MR: 622912] [Zbl: 0551.03007] [Google Scholar]
  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. [Zbl: 0716.68012] [Google Scholar]
  6. 6. K. BRUCE, G. LONGO, A Modest Model for Records, Inheritance and Bounded Quantification, Information and Computations 1990, 87, 196-240. [MR: 1055952] [Zbl: 0711.68072] [Google Scholar]
  7. 7. L. CARDELLI, Typeful Programming, SRC report 45, 1989. [Google Scholar]
  8. 8. L. CARDELLI, G. LONGO, A Semantic Basis for Quest SRC report 55, 1990. [MR: 1140339] [Google Scholar]
  9. 9. L. CARDELLI, P. WEGNER, On Understanding Types, Data Abstraction and Polymorphism, Computing Surveys, 1985, 17, 471-522. [Google Scholar]
  10. 10. F. CARDONE, Recursive Types for Fun, Theoretical Computer Science, 1991. [MR: 1122644] [Zbl: 0746.68018] [Google Scholar]
  11. 11. R. CARTWRIGHT, Types as Intervals, Proc. Symposium on Principle of Programming Languages, ACM, 1984, 22-36. [Google Scholar]
  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. [MR: 819247] [Zbl: 0585.68047] [Google Scholar]
  13. 13. M. COPPO, M. ZACCHI, Type Inference and Logical Relations, Proc. Symposium on Logic in Computer Science, IEEE, 1986, 218-226. [Google Scholar]
  14. 14. M. DEZANI CIANCAGLINI, B. VENNERI, Partial Types and Intervals, SIAM Journal on Computing, 1990, 19, 644-658. [MR: 1053932] [Zbl: 0697.03005] [Google Scholar]
  15. 15. C. GUNTER, Universal Profinite Domains, Information and Computation, 1987, 72, 1-30. [MR: 871554] [Zbl: 0628.68050] [Google Scholar]
  16. 16. C. GUNTER, D. SCOTT, Semantic Domains, Handbook of Theoretical Computer Science, North Holland, 1990, 633-674. [MR: 1127197] [Zbl: 0900.68301] [Google Scholar]
  17. 17. D. MACQUEEN, G. PLOTKIN, R. SETHI, An Ideal Model for Recursive Polymorphic Types, Information and Control, 1986, 71, 95-130. [MR: 864747] [Zbl: 0636.68016] [Google Scholar]
  18. 18. S. MARTINI, Bounded Quantifiers have Interval Models, ACM Conference on LISP and Functional Programming Languages, 1988, 164-173. [Google Scholar]
  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. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.