Must Preorder in Non-deterministic Untyped -calculus
暂无分享,去创建一个
[1] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[2] Gérard Boudol,et al. A lambda-calculus for parallel functions , 1990 .
[3] Christopher P. Wadsworth,et al. The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..
[4] C.-H. Luke Ong,et al. Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..
[5] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[6] Matthew Hennessy,et al. A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus , 1980, Theor. Comput. Sci..
[7] Matthew Hennessy,et al. The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment , 1980, SIAM J. Comput..
[8] G. Longo,et al. Lambda-Calculus Models and Extensionality , 1980, Math. Log. Q..
[9] M. Hyland. A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus , 1976 .
[10] Matthew Hennessy,et al. Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.
[11] Bent Thomsen,et al. A calculus of higher order communicating systems , 1989, POPL '89.
[12] James H. Morris,et al. Lambda-calculus models of programming languages. , 1969 .
[13] Gordon D. Plotkin,et al. Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..
[14] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..
[15] Radha Jagadeesan,et al. A Domain-Theoretic Model for a Higher-Order Process Calculus , 1990, ICALP.