An operational semantics of sharing in lazy evaluation

Abadi, 1991, Explicit substitutions, J. Funct. Program, 1, 375, 10.1017/S0956796800000186 Barendregt, 1984, The Lambda Calculus: Its Syntax and Semantics, Vol. 103 Bloss, 1989, Path analysis and the optimization of non-strict functional languages Crégut, 1990, An abstract machine for the normalization of λ-terms, 333 Draghicescu, 1993, A uniform treatment of order of evaluation and aggregate update, Theoret. Comput. Sci., 118, 231, 10.1016/0304-3975(93)90110-F Fairbairn, 1987, TIM: a simple, lazy abstract machine to execute supercombinators, Vol. 274, 34 Field, 1990, On laziness and optimality in lambda interpreters: Tools for specification and analysis, 1 Gunter, 1992 Guzman, 1990, Single-threaded polymorphic lambda calculus Johnsson, 1984, Efficient compilation of lazy evaluation, 58 Kahn, 1987 Lamping, 1990, An algorithm for optimal lambda calculus reduction Launchbury, 1993, A natural semantics for lazy evaluation, 144 Maranget, 1991, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, 255 Plotkin, 1977, LCF considered as a programming language, Theoret. Comput. Sci., 5, 223, 10.1016/0304-3975(77)90044-5 Purushothaman, 1992, An adequate operational semantics of sharing in lazy evaluation, Vol. 582, 435 Purushothaman, 1993, From operational definitions to abstract semantics, 276 Seaman, 1993 Yoshida, 1993, Optimal reduction in weak-λ-calculus with shared environments, 243