On the Ubiquity of Certain Total Type Structures: (Extended Abstract)
暂无分享,去创建一个
[1] John Longley,et al. Universal Types and What They are Good For , 2003 .
[2] Jan A. Bergstra. The continuous functionals and 2E , 1978 .
[3] Andrej Bauer,et al. Comparing Functional Paradigms for Exact Real-Number Computation , 2002, ICALP.
[4] Ulrich Berger,et al. Total Sets and Objects in Domain Theory , 1993, Ann. Pure Appl. Log..
[5] Matthias Felleisen,et al. Observable sequentiality and full abstraction , 1992, POPL '92.
[6] Gordon D. Plotkin,et al. Set-Theoretical and Other Elementary Models of the lambda-Calculus , 1993, Theor. Comput. Sci..
[7] Thomas Streicher,et al. Impredicativity entails untypedness , 2002, Mathematical Structures in Computer Science.
[8] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[9] Dag Normann,et al. The Continuous Functionals , 1999, Handbook of Computability Theory.
[10] John R. Longley,et al. Realizability toposes and language semantics , 1995 .
[11] Andrej Bauer,et al. The realizability approach to computable analysis and topology , 2000 .
[12] Gordon Plotkin,et al. Logical Full Abstraction and PCF , 2000 .
[13] J. Hyland,et al. Filter spaces and continuous functionals , 1979 .
[14] John Longley. The sequentially realizable functionals , 2002, Ann. Pure Appl. Log..
[15] Pierre-Louis Curien,et al. Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..
[16] David B. MacQueen,et al. The Definition of Standard ML (Revised) , 1997 .
[17] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .
[18] Guy McCusker. Games and Full Abstraction for FPC , 2000, Inf. Comput..
[19] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[20] G. Plotkin. Tω as a Universal Domain , 1978 .
[21] S. C. Kleene,et al. Recursive functionals and quantifiers of finite types. II , 1959 .
[22] John Longley,et al. Matching typed and untyped realizability , 1998, Realizability Semantics and Applications@FLoC.
[23] D. Normann. Recursion on the countable functionals , 1980 .
[24] M. Beeson. Foundations of Constructive Mathematics , 1985 .
[25] Samson Abramsky,et al. A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[26] Dag Normann. The continuous functionals; computations, recursions and degrees , 1981 .
[27] James Laird. A Categorical Semantics of Higher Order Store , 2002, CTCS.
[28] Dag Normann. Computability over The Partial Continuous Functionals , 2000, J. Symb. Log..
[29] Radha Jagadeesan,et al. Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..
[30] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..
[31] Gordon D. Plotkin,et al. Full abstraction, totality and PCF , 1999, Mathematical Structures in Computer Science.
[32] Samson Abramsky,et al. Call-by-Value Games , 1997, CSL.
[33] Pierre-Louis Curien. On the Symmetry of Sequentiality , 1993, MFPS.
[34] Ulrich Berger,et al. Computability and totality in domains , 2002, Mathematical Structures in Computer Science.
[35] Antonio Bucciarelli,et al. Sequentiality and strong stability , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[36] Gérard Berry,et al. Stable Models of Typed lambda-Calculi , 1978, ICALP.
[37] James Laird. Locally Boolean domains , 2005, Theor. Comput. Sci..
[38] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..
[39] Jaap van Oosten. The modified realizability topos , 1997 .
[40] S. Abramsky. Game Semantics , 1999 .
[41] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[42] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[43] Lars Birkedal,et al. Local Realizability Toposes and a Modal Logic for Computability , 2002, Math. Struct. Comput. Sci..
[44] R. Platek. Foundations of recursion theory , 1966 .
[45] Furio Honsell,et al. Pre-logical Relations , 1999, CSL.
[46] Roberto M. Amadio,et al. Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.
[47] Marc Bezem. Isomorphisms Between HEO and HROE, ECF and ICFE , 1985, J. Symb. Log..
[48] R. Gandy,et al. Computable and recursively countable functions of higher type , 1977 .
[49] Paul-André Melliès. Comparing hierarchies of types in models of linear logic , 2004, Inf. Comput..