The tensor product in Wadler's analysis of lists

DOI10.1016/0167-6423(94)00009-3zbMath0810.68092OpenAlexW1483036718WikidataQ59416363 ScholiaQ59416363MaRDI QIDQ1330441

Flemming Nielson, Hanne Riis Nielson

Publication date: 21 July 1994

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(94)00009-3

zbMATH Keywords

Wadler's strictness analysis

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Data structures (68P05) Continuous lattices and posets, applications (06B35) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Galois Connections for Recursive Types ⋮ The reduced relative power operation on abstract domains

This page was built for publication: The tensor product in Wadler's analysis of lists