The tensor product in Wadler's analysis of lists

DOI10.1016/0167-6423(94)00009-3MaRDI QIDQ1330441zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 860040
• Strictness analysis for higher-order functions
• scientific article; zbMATH DE number 3942992
• scientific article; zbMATH DE number 176724
• Strictness and totality analysis

Cited in

(4)

• The reduced relative power operation on abstract domains
• Galois Connections for Recursive Types
• scientific article; zbMATH DE number 3942992 (Why is no real title available?)
• On Barron and Strachey's Cartesian product function

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

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