Faithful ideal models for recursive polymorphic types

Ideal models are explored for a programming language with recursive polymorphic types, variants of the model studied by D. MacQueen et al. (Inf. Control, vol.71, pp.95-130, 1986). The use of suitable ideals yields a close fit between models and programming language. Two of the authors' semantics of type expressions are faithfully, in the sense that programs that behave identically in all contexts have exactly the same types.<<ETX>>

[1]  Robin Milner,et al.  A proposal for standard ML , 1984, LFP '84.

[2]  Gordon D. Plotkin,et al.  An ideal model for recursive polymorphic types , 1984, Inf. Control..

[3]  Stavros S. Cosmadakis,et al.  Computing with recursive types , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[4]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[5]  Albert R. Meyer,et al.  Semantical paradigms: notes for an invited lecture , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[6]  Alley Stoughton,et al.  Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[7]  Wacław Sierpiński,et al.  Sur une propriété des ensembles frontières , 2022 .

[8]  S. Banach.  Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales , 1922 .

[9]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[10]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .