A calculus for link-time compilation

DOI10.1007/3-540-46425-5_17MaRDI QIDQ4518885zbMATH OpenFDO

Authors Elena Machkasova, Franklyn Turbak

Publication date 3 December 2000

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

Full work available at URL https://doi.org/10.1007/3-540-46425-5_17

zbMATH Keywords

computational soundness propertyoperational semantics

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Theoretical Computer Science
• Equational reasoning for linking with first-class primitive modules
• A calculus for dynamic reconfiguration with low priority linking
• A calculus of open modules: call-by-need strategy and confluence
• A calculus of module systems

Cited in

(7)

• alto: A link-time optimizer for the Compaq Alpha
• A calculus for dynamic reconfiguration with low priority linking
• Computational soundness of a call by name calculus of recursively-scoped records
• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• Equational reasoning for linking with first-class primitive modules
• Euro-Par 2004 Parallel Processing
• Theoretical Computer Science

This page was built for publication: A calculus for link-time compilation

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