On Berry's conjectures about the stable order in PCF
暂无分享,去创建一个
[1] Martín Hötzel Escardó,et al. Operational Domain Theory and Topology of a Sequential Programming Language , 2005, LICS.
[2] Roberto M. Amadio,et al. Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.
[3] Jean-Yves Girard,et al. The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..
[4] Glynn Winskel,et al. Bistructures, Bidomains and Linear Logic , 1994 .
[5] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[6] Vladimir Yu. Sazonov,et al. The extensional ordering of the sequential functionals , 2012, Ann. Pure Appl. Log..
[7] Jean-Jacques Lévy,et al. Full abstraction for sequential languages : The states of the art , 1983 .
[8] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..
[9] Alley Stoughton. Mechanizing Logical Relations , 1993, MFPS.
[10] Ralph Loader. Finitary PCF is not decidable , 2001, Theor. Comput. Sci..
[11] J. Girard,et al. Proofs and types , 1989 .
[12] K. Sieber. Applications of Categories in Computer Science: Reasoning about sequential functions via logical relations , 1992 .
[13] Maribel Fernández. The Lambda Calculus , 2009 .
[14] Hanno Nickau. Hereditarily Sequential Functionals , 1994, LFCS.
[15] Vladimir Sazonov. Inductive Definition and Domain Theoretic Properties of Fully Abstract Models for PCF and PCF+ , 2007, Log. Methods Comput. Sci..
[16] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..
[17] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[18] Vladimir Sazonov. Natural non-dcpo domains and f-spaces , 2009, Ann. Pure Appl. Log..
[19] P. Wegner. Lambda calculus , 2003 .
[20] James Laird. On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF , 2007, Fundam. Informaticae.
[21] Dag Normann. On sequential functionals of type 3 , 2006, Math. Struct. Comput. Sci..
[22] C.-H.L. Ong,et al. Correspondence between operational and denotational semantics: the full abstraction problem for PCF , 1995, LICS 1995.
[23] Alley Stoughton,et al. Substitution Revisited , 1988, Theor. Comput. Sci..
[24] John Longley. The sequentially realizable functionals , 2002, Ann. Pure Appl. Log..
[25] Paul Taylor. An algebraic approach to stable domains , 1990 .
[26] Fritz Müller,et al. Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting , 1992, Inf. Process. Lett..
[27] James Laird. Sequentiality in Bounded Biorders , 2005, Fundam. Informaticae.
[28] Peter W. O'Hearn,et al. Kripke Logical Relations and PCF , 1995, Inf. Comput..
[29] Luca Paolini. A stable programming language , 2006, Inf. Comput..