Abstract Models of Storage
暂无分享,去创建一个
[1] Kurt Sieber,et al. Full Abstraction for the Second Order Subset of an Algol-Like Language , 1996, Theor. Comput. Sci..
[2] Christopher Strachey,et al. A theory of programming language semantics , 1976 .
[3] JOHN F. Young. Machine Intelligence , 1971, Nature.
[4] Robert D. Tennent,et al. Semantical Analysis of Specification Logic , 1985, Inf. Comput..
[5] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .
[6] Philip Wadler,et al. A Syntax for Linear Logic , 1993, MFPS.
[7] C. A. R. Hoare,et al. The Varieties of Programming Language , 1989, TAPSOFT, Vol.1.
[8] Uday S. Reddy,et al. Global state considered unnecessary: An introduction to object-based semantics , 1996, LISP Symb. Comput..
[9] H. Bekić,et al. Formalization of Storage Properties , 1984, Programming Languages and Their Definition.
[10] Friedrich L. Bauer,et al. Report on the algorithmic language ALGOL 60 , 1960, Commun. ACM.
[11] John C. Reynolds,et al. Idealized ALGOL and its specification logic , 1997 .
[12] Brian Randell. System structure for software fault tolerance , 1975 .
[13] Albert R. Meyer,et al. Towards fully abstract semantics for local variables , 1988, POPL '88.
[14] John McCarthy,et al. Towards a Mathematical Science of Computation , 1962, IFIP Congress.
[15] Joseph Y. Halpern,et al. The semantics of local storage, or what makes the free-list free?(Preliminary Report) , 1984, POPL '84.
[16] Thomas B. Steel,et al. Formal language description languages for computer programming : proceedings of the IFIP Working Conference on Formal Language Description Languages , 1966 .
[17] Peter W. O'Hearn,et al. Parametricity and local variables , 1995, JACM.
[18] I. Stark,et al. Domains and Denotational Semantics History Accomplishments and Open Problems , 1996 .
[19] Samson Abramsky,et al. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..
[20] Christopher Strachey,et al. Fundamental Concepts in Programming Languages , 2000, High. Order Symb. Comput..
[21] Josva Kleist,et al. Proceedings of Second ACM SIGPLAN Workshop on State in Programming Languages , 1995 .
[22] John C. Reynolds,et al. Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.
[23] P Lucas,et al. On the formal description of PL/I , 1969 .
[24] Andrew D. Gordon,et al. Bisimilarity as a theory of functional programming , 1999, MFPS.
[25] John C. Reynolds,et al. The essence of ALGOL , 1997 .
[26] B. J. Mailloux,et al. Report on the Algorithmic Language ALGOL 68 , 1969 .
[27] Robert D. Tennent. Semantics of Interference Control , 1983, Theor. Comput. Sci..
[28] John C. Reynolds,et al. Syntactic control of interference , 1978, POPL.
[29] Peter W. O'Hearn,et al. From Algol to polymorphic linear lambda-calculus , 2000, JACM.
[30] R. D. Tennent,et al. Applications of Categories in Computer Science: Semantics of local variables , 1992 .
[31] Dana S. Scott. Mathematical concepts in programming language semantics , 1971, AFIPS '72 (Spring).
[32] Frank J. Oles. Functor Categories and Store Shapes , 1997 .
[33] Peter W. O'Hearn. A Model for Syntactic Control of Interference , 1993, Math. Struct. Comput. Sci..
[34] Christopher Strachey,et al. Toward a mathematical semantics for computer languages , 1971 .
[35] R. D. Tennent,et al. Bire ectivity , 1999 .
[36] John C. Reynolds,et al. Syntactic Control of Inference, Part 2 , 1989, ICALP.
[37] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[38] John C. Reynolds,et al. GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept , 1970, Commun. ACM.
[39] Peter W. O'Hearn,et al. Relational parametricity and local variables , 1993, POPL '93.
[40] Brian Randell,et al. System structure for software fault tolerance , 1975, IEEE Transactions on Software Engineering.
[41] Robert Milne. The Formal Semantics of Computer Languages and their Implementations , 1974 .
[42] Michael J. C. Gordon,et al. The Denotational Semantics of Sequential Machines , 1980, Inf. Process. Lett..
[43] Albert R. Meyer,et al. Towards a fully abstract semantics for local variables: Preliminary report , 1988 .
[44] Ian Stark. Categorical models for local names , 1996, LISP Symb. Comput..
[45] Peter Deuflhard,et al. Numerische Mathematik. I , 2002 .
[46] Martín Abadi,et al. A Logic for Parametric Polymorphism , 1993, TLCA.
[47] Andrew M. Pitts,et al. Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.
[48] Peter W. O'Hearn,et al. Introduction to ALGOL-like languages , 1997 .
[49] Martin Odersky,et al. Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus , 1999, Theor. Comput. Sci..
[50] Frank J. Oles,et al. Type Algebras, Functor Categories, and Block Structure , 1986 .
[51] Samson Abramsky,et al. Full Abstraction for Idealized Algol with Passive Expressions , 1999, Theor. Comput. Sci..
[52] B. J. Mailloux,et al. Report of Algorithmic Language ALGOL 68 , 1969 .
[53] Peter W. O'Hearn,et al. Semantical Analysis of Specification Logic, 2 , 1993, Inf. Comput..
[54] R. V. Book. Algol-like Languages , 1997, Progress in Theoretical Computer Science.
[55] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..
[56] John McCarthy. A Formal Description of a Subset of Algol , 1964 .
[57] Andre Scedrov,et al. Functorial Polymorphism , 1990, Theor. Comput. Sci..
[58] Dan R. Ghica,et al. Semantics of dynamic variables in Algol-like languages , 1998 .
[59] D. W. Barron,et al. The Main Features of CPL , 1963, Comput. J..
[60] J. Davenport. Editor , 1960 .
[61] Frank J. Oles,et al. A category-theoretic approach to the semantics of programming languages , 1982 .
[62] Peter W. O'Hearn,et al. Syntactic Control of Interference Revisited , 1999, Theor. Comput. Sci..
[63] Robert W. Floyd,et al. Assigning Meanings to Programs , 1993 .