Strictness optimization for graph reduction machines (why id might not be strict)

Marcel Beemster
1994 ACM Transactions on Programming Languages and Systems  
doi:10.1145/186025.186040 fatcat:q4emkta32vgxblaqqrfeisnhnu