Full abstraction, totality and PCF
暂无分享,去创建一个
[1] Geir Waagbø. Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality , 1999, Arch. Math. Log..
[2] Gordon Plotkin,et al. Logical Full Abstraction and PCF , 2000 .
[3] C.-H. Luke Ong,et al. On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..
[4] John C. Mitchell,et al. Foundations for programming languages , 1996, Foundation of computing series.
[5] Dag Normann. Closing the gap between the continuous functionals and recursion in $^3E$ , 1997, Arch. Math. Log..
[6] Dag Normann,et al. Total objects in inductively defined types , 1997, Arch. Math. Log..
[7] Yu. L. Ershov,et al. Maximal and everywhere-defined functionals , 1974 .
[8] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .
[9] Jean-Jacques Lévy,et al. Full abstraction for sequential languages : The states of the art , 1983 .
[10] Stephen A. Cook,et al. Computability and Complexity of Higher Type Functions , 1992 .
[11] Ewen Denney. Refinement types for specification , 1998, PROCOMET.
[12] Ulrich Berger,et al. Continuous Functionals of Dependent and Transfinite Types , 1999 .
[13] Patrick Cousot,et al. Abstract interpretation , 1996, CSUR.
[14] Dag Normann,et al. Semantics for some constructors of type theory , 1995 .
[15] Bruce M. Kapron,et al. A New Characterization of Type-2 Feasibility , 1996, SIAM J. Comput..
[16] R. Gandy,et al. Computable and recursively countable functions of higher type , 1977 .
[17] Samson Abramsky,et al. Domain theory , 1995, LICS 1995.
[18] Samson Abramsky,et al. Abstract Interpretation, Logical Relations and Kan Extensions , 1990, J. Log. Comput..
[19] Dag Normann. A hierarchy of domains with totality, but without density , 1996 .
[20] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..
[21] Giuseppe Longo,et al. The hereditary partial effective functionals and recursion theory in higher types , 1984, Journal of Symbolic Logic.
[22] Ralph Loader,et al. Equational Theories for Inductive Types , 1997, Ann. Pure Appl. Log..
[23] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..
[24] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .
[25] Alley Stoughton. Interdefinability of Parallel Operations in PCF , 1991, Theor. Comput. Sci..
[26] J. Ersov. Theorie der Numerierungen II , 1973 .
[27] Y. Ershov. Model of Partial Continuous Functionals , 1977 .
[28] Yu. L. Ershov,et al. Hereditarily effective operations , 1976 .
[29] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..
[30] Dag Normann,et al. Categories of domains with totality , 1997 .
[31] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[32] Dag Normann,et al. The Continuous Functionals , 1999, Handbook of Computability Theory.
[33] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[34] Paola Giannini,et al. On Strictness and Totality , 1997, TACS.
[35] Viggo Stoltenberg-Hansen,et al. Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.
[36] I. Stark,et al. Domains and Denotational Semantics History Accomplishments and Open Problems , 1996 .
[37] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .
[38] Guy McCusker. Games and Full Abstraction for FPC , 2000, Inf. Comput..
[39] G. Winskel. The formal semantics of programming languages , 1993 .
[40] J. U. L. Ersov,et al. Theorie der Numerierungen II , 1975, Math. Log. Q..
[41] Glynn Winskel,et al. The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.