Boolean constraints for binding-time analysis

DOI10.1007/3-540-44978-7_4MaRDI QIDQ4529772zbMATH OpenFDO

Authors Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard

Publication date 6 May 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2053/20530039

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Program Development in Computational Logic
• Binding-time analysis by constraint solving. A modular and higher-order approach for Mercury
• scientific article; zbMATH DE number 2084340
• Effective strictness analysis with HORN constraints
• Binding-time analysis for both static and dynamic expressions

Cited in

(8)

• Binding-time analysis by constraint solving. A modular and higher-order approach for Mercury
• scientific article; zbMATH DE number 5840258 (Why is no real title available?)
• scientific article; zbMATH DE number 1231585 (Why is no real title available?)
• scientific article; zbMATH DE number 791802 (Why is no real title available?)
• Global program analysis in constraint form
• Higher-ranked annotation polymorphic dependency analysis
• Comparing flow-based binding-time analyses
• Program Development in Computational Logic

This page was built for publication: Boolean constraints for binding-time analysis

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