The discriminating power of multiplicities in the-calculus
暂无分享,去创建一个
[1] Davide Sangiorgi. The Lazy Lambda Calculus in a Concurrency Scenario , 1994, Inf. Comput..
[2] Robin Milner. Functions as Processes , 1990, ICALP.
[3] Gérard Boudol,et al. A lambda-calculus for parallel functions , 1990 .
[4] Cosimo Laneve,et al. Termination, deadlock and divergence in the λ-calculus with multiplicities1 1Partially supported by the ESPRIT Basic Research Project 6454 - CONFER. , 1995 .
[5] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[6] C.-H. Luke Ong. The Lazy Lambda Calculus : an investigation into the foundations of functional programming , 1988 .
[7] 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..
[8] C.-H. Luke Ong,et al. Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract) , 1992, ICALP.
[9] Gérard Boudol,et al. The Lambda-Calculus with Multiplicities (Abstract) , 1993, CONCUR.
[10] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .
[11] C.-H. Luke Ong,et al. Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..
[12] Gérard Boudol,et al. Lambda-Calculi for (Strict) Parallel Functions , 1994, Inf. Comput..
[13] Martín Abadi,et al. Explicit substitutions , 1989, POPL '90.
[14] Giuseppe Longo,et al. Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..