论文信息 - Bi-Models: Relational Versus Domain-Theoretic Approaches

Bi-Models: Relational Versus Domain-Theoretic Approaches

We introduce a technique based on logical relations, which, given two models M and N of a simply typed lambda-calculus L, allows us to construct a model M/N whose L-theory is a superset of both Th(M) and Th(N). By means of some examples, we show that classic bi-domain constructions lack this property, in general.

Antonio Bucciarelli

[1] Gérard Berry,et al. Stable Models of Typed lambda-Calculi , 1978, ICALP.

[2] Antonio Bucciarelli,et al. Sequentiality in an Extensional Framework , 1994, Inf. Comput..

[3] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..

[4] Antonio Buciarelli. Logical Reconstruction of Bi-domains , 1997 .

[5] Peter W. O'Hearn,et al. Kripke Logical Relations and PCF , 1995, Inf. Comput..

[6] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..

[7] Antonio Bucciarelli,et al. Extensional Embedding of a Strongly Stable Model of PCF , 1991, ICALP.

[8] Pierre-Louis Curien. Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[9] Albert R. Meyer,et al. Full Abstraction and the Context Lemma , 1991, TACS.

[10] Glynn Winskel. Stable Bistructure Models of PCF , 1994 .

[11] H. Friedman. Equality between functionals , 1975 .

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