Integrating Strict and Lazy Evaluation: The lambda-sl-Calculus
暂无分享,去创建一个
[1] Martín Abadi,et al. Explicit substitutions , 1989, POPL '90.
[2] Samson Abramsky,et al. The Lazy λ−Calculus , 1990 .
[3] Bernard Robinet,et al. Combinators and Functional Programming Languages , 1986 .
[4] Giuseppe Longo,et al. Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.
[5] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[6] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..
[7] Michel Mauny. Compilation des Langages Fonctionnels dans les Combinateurs Catégoriques -- Application au langage ML , 1985 .
[8] Susumu Hayashi,et al. Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus , 1985, Theor. Comput. Sci..
[9] Jon Fairbairn,et al. TIM: A simple, lazy abstract machine to execute supercombinatorics , 1987, FPCA.
[10] Gordon D. Plotkin,et al. Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..
[11] Luca Cardelli. The Amber Machine , 1985, Combinators and Functional Programming Languages.
[12] Pierre-Louis Curien,et al. The Categorical Abstract Machine , 1987, Sci. Comput. Program..
[13] Pierre-Louis Curien,et al. An Abstract Framework for Environment Machines , 1991, Theor. Comput. Sci..