Strictness logic and polymorphic invariance

DOI10.1007/BFB0023861MaRDI QIDQ2757801zbMATH OpenFDO

Authors P. N. Benton

Publication date 4 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Strictness and totality analysis
• Strictness, totality, and non-standard-type inference
• Derivation and inference of higher-order strictness types
• On strictness and totality
• Conjunctive Type Systems and Abstract Interpretation of Higher-order Functional Programs

Cited in

(17)

• Strictness analysis of the untyped \(\lambda\)-calculus
• Polymorphic rewriting conserves algebraic strong normalization
• Derivation and inference of higher-order strictness types
• scientific article; zbMATH DE number 4014021 (Why is no real title available?)
• Abstract Interpretation from a Topological Perspective
• A two-valued logic for properties of strict functional programs allowing partial functions
• Inverse-limit and topological aspects of abstract interpretation
• scientific article; zbMATH DE number 1231611 (Why is no real title available?)
• Projections for polymorphic first-order strictness analysis
• On strictness and totality
• Untyped strictness analysis
• scientific article; zbMATH DE number 6307924 (Why is no real title available?)
• Projections for polymorphic strictness analysis
• Effect polymorphism in higher-order logic (proof pearl)
• Strictness, totality, and non-standard-type inference
• Making ``stricterness more relevant
• Strictness analysis aids inductive proofs

This page was built for publication: Strictness logic and polymorphic invariance

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