Strictness and totality analysis with conjunction [chapter]

Kirsten Lackner Solberg
1995 Lecture Notes in Computer Science  
We extend the strictness and totality analysis of [12] by allowing conjunction at all levels rather than at the top-level. We prove the strictness and totality analysis correct with respect to a denotational semantics and finally construct an algorithm for inferring the strictness and totality properties.
doi:10.1007/3-540-59293-8_216 fatcat:hrygqbrgxzfz3gn45hqlrxbjay