Linear logic without boxes
暂无分享,去创建一个
[1] John Lamping,et al. An algorithm for optimal lambda calculus reduction , 1989, POPL '90.
[2] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..
[3] Jean-Yves Girard,et al. On the Unity of Logic , 1993, Ann. Pure Appl. Log..
[4] Yves Lafont,et al. Interaction nets , 1989, POPL '90.
[5] Vinod Kathail,et al. Optimal interpreters for lambda-calculus based functional languages , 1990 .
[6] Jean-Yves Girard,et al. Geometry of Interaction 1: Interpretation of System F , 1989 .
[7] Jean-Yves Girard,et al. A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.
[8] Jean-Yves Girard,et al. Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.
[9] Philip Wadler,et al. Linear Types can Change the World! , 1990, Programming Concepts and Methods.
[10] Martín Abadi,et al. The geometry of optimal lambda reduction , 1992, POPL '92.
[11] Samson Abramsky,et al. Computational Interpretations of Linear Logic , 1993, Theor. Comput. Sci..
[12] P. Lincoln,et al. Operational aspects of linear lambda calculus , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.