Binding-time analysis for polymorphic types

MaRDI QIDQ3043822zbMATH OpenFDO

Authors R. Heldal, John Hughes

Publication date 6 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2244/22440191.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Binding-time analysis in partial evaluation: One size does not fit all
• Fully Automatic Binding-Time Analysis for Prolog
• Tag-free combinators for binding-time polymorphic program generation
• scientific article; zbMATH DE number 1231585
• Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity

Cited in

(12)

• Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
• Enhanced type inference for binding-time analysis
• Binding-time analysis in partial evaluation: One size does not fit all
• Binding-Time Annotations without Binding-Time Analysis
• Tag-free combinators for binding-time polymorphic program generation
• scientific article; zbMATH DE number 1070361 (Why is no real title available?)
• Finiteness analysis in polynomial time
• scientific article; zbMATH DE number 1508929 (Why is no real title available?)
• Boolean constraints for binding-time analysis
• On the runtime complexity of type-directed unboxing
• Fully Automatic Binding-Time Analysis for Prolog
• Binding-time analysis for both static and dynamic expressions

This page was built for publication: Binding-time analysis for polymorphic types

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