@article{ITA_1993__27_3_221_0, author = {Poll, E. and Hemerik, C. and Ten Eikelder, H. M. M.}, title = {CPO-models for second order lambda calculus with recursive types and subtyping}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {221--260}, publisher = {EDP-Sciences}, volume = {27}, number = {3}, year = {1993}, mrnumber = {1227944}, zbl = {0788.03016}, language = {en}, url = {http://www.numdam.org/item/ITA_1993__27_3_221_0/} }
TY - JOUR AU - Poll, E. AU - Hemerik, C. AU - Ten Eikelder, H. M. M. TI - CPO-models for second order lambda calculus with recursive types and subtyping JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1993 SP - 221 EP - 260 VL - 27 IS - 3 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1993__27_3_221_0/ LA - en ID - ITA_1993__27_3_221_0 ER -
%0 Journal Article %A Poll, E. %A Hemerik, C. %A Ten Eikelder, H. M. M. %T CPO-models for second order lambda calculus with recursive types and subtyping %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1993 %P 221-260 %V 27 %N 3 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1993__27_3_221_0/ %G en %F ITA_1993__27_3_221_0
Poll, E.; Hemerik, C.; Ten Eikelder, H. M. M. CPO-models for second order lambda calculus with recursive types and subtyping. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 27 (1993) no. 3, pp. 221-260. http://www.numdam.org/item/ITA_1993__27_3_221_0/
[ABL86] The finitary projection model for second order lambda calculus and higher order domain equations, Logic in Computer Science, 1986, pp. 122-135, IEEE.
, and ,[AC90] Subtyping recursive types, Technical Report 62, Digital Systems Research Centre, 1990.
and ,[Bar9 + ] Typed lambda calculi. In D. M. GABBAI, S. ABRAMSKY and T. S. E. MAIBAUM, Eds., Handbook of Logic in Computer Science, volume 1.Oxford University Press, to appear. | MR
,[BH88] An introduction to the category-theoretic solution of recursive domain equations, Technical Report 15, Eindhoven University of Technology, 1988.
and ,[BL90] A modest model of records, iheritance and bounded quantification, Information and Computation, 1990, 87, pp. 196-240. | MR | Zbl
and ,[BMM90] The semantics of second-order lambda calculus, Information and Computation, 1990, 85, pp. 76-134. | MR | Zbl
, and ,[BCGS91] Inheritance as explicit coercion. Information and Computation, 1991, 93, (1), pp. 172-221. | MR | Zbl
, , and[CC91] Type inference with recursive types: Syntax and semantics, Information and Computation, 1991, 92, (1), pp.48-80. | MR | Zbl
and ,[CG90] Coherence of subsumption. In A. ARNOLD, Ed., Colloquium on Trees in Algebras and Programming, Vol. 431 of LNCS, 1990, pp. 132-146, Springer. | MR | Zbl
and ,[CHC90] Inheritance is not subtyping, Principles of Programming Languages, 1990, pp. 125-135, ACM.
, and ,[CL90] A semantic basis for Quest, Technical Report 55, Digital Systems Research Center, Palo Alto, California 94301, 1990. | MR
and ,[CM89] Operations on records, in M. MAIN et al., Ed., Fifth International Conference on Mathematical Foundations of Programming Semantics, Vol. 442 of LNCS, 1989, pp. 22-53.
and ,[Cou83] Fundamental properties of infinite trees, Theoretical Computer Science, 1983, 25, pp.95-169. | MR | Zbl
,[CW85] On understanding types, data abstraction and polymorphism, Computing Surveys, 1985, 17, (4), pp.471-522.
and ,[Gir72] Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur, Ph. D. thesis, Université Paris-VII, 1972.
,[Gir86] The System F of variable types, fifteen years later. Theoretical Computer Science, 1986, 45, pp. 159-192. | MR | Zbl
,[HS73] Category Theory. Allyn and Bacon, 1973. | MR | Zbl
and .[LS81] Algebraic specification of data types: a synthetic approach, Math. Syst. Theory, 1981, 11, pp. 97-139. | MR | Zbl
and ,[McC79] An Investigation of a Programming Language with a Polymorphic Type Structure, Ph. D. thesis, Syracuse University New York, 1979.
,[Mit84] Semantic models for second-order lambda calculus, Foundations of Computer Science, 1984, pp. 289-299, IEEE.
,[MP88] Abstract types have existential type, ACM Trans. on Prog. Lang. and Syst., 1988, 10, (3), pp. 470-502.
and ,[Pol91] Cpo-models for second order lambda calculus with recursive types and subtyping, Computing Science Note (91/07), Eindhoven University of Technology, 1991.
,[Rey74] Towards a theory of type structure, Programming Symposium: Colloque sur la Programmation, LNCS, 1974, pp. 408-425, Springer. | MR | Zbl
,[SP82] The category-theoretic solution of recursive domain equations, S.I.A.M. Journal of Computing, 1982, 11, pp. 761-783. | MR | Zbl
and ,[tEH89a] The construction of a cpo model for second order lambda calculus with recursion, Procs, CNS'89 Computing Science in the Netherlands, 1989, pp. 131-148.
and ,[tEH89b] Some category-theoretical properties related to a model for a polymorphic lambda calculus, Computing Science Note (89/03), Eindhoven University of Technology, 1989.
and ,