Strictness and totality analysis with conjunction

DOI10.1007/3-540-59293-8_216zbMath1496.68096OpenAlexW1498394860MaRDI QIDQ5096753

Kirsten Lackner Solberg

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_216

Mathematics Subject Classification ID

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

Related Items (1)

Strictness, totality, and non-standard-type inference

Cites Work

• Strictness analysis for higher-order functions
• Strictness and totality analysis
• Abstract Interpretation, Logical Relations, and Kan Extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strictness and totality analysis with conjunction