Preliminary arrangements of arguments in lazy evaluation

DOI10.1007/BF03037640zbMATH Open0722.68017OpenAlexW2067104518MaRDI QIDQ756403FDOQ756403

Liao Husheng, Masato Takeichi

Publication date: 1991

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037640

zbMATH Keywords

functional languageslazy evaluatorsSECD Machine

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Cites Work

• A new implementation technique for applicative languages
• Partial parametrization eliminates multiple traversals of data structures
• Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Miranda

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Lazy Evaluation and Delimited Control 👍 👎
• Implementation of Functional Languages 👍 👎
• The adequacy of Launchbury's natural semantics for lazy evaluation 👍 👎
• A technique for doing lazy evaluation in logic 👍 👎
• The lazy logic of partial terms 👍 👎
• Lazy evaluation and delimited control 👍 👎

This page was built for publication: Preliminary arrangements of arguments in lazy evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756403)