Optimizing abstract SECD machine code

MaRDI QIDQ2763597zbMATH OpenFDO

Authors L. Szarapka, Mirjana Ivanović

Publication date 20 January 2002

zbMATH Keywords

codeModula-2optimizationprogramming languageSECD machine

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• scientific article; zbMATH DE number 988749
• A Rational Deconstruction of Landin’s SECD Machine
• Optimizing structural recursion in functional programs
• Optimizing abstract abstract machines
• Compiling and optimizing methods for the functional language ASL/F

Cited in

(9)

• Low cost environment changing in a shallow binding system
• Compiling and optimizing methods for the functional language ASL/F
• scientific article; zbMATH DE number 988749 (Why is no real title available?)
• scientific article; zbMATH DE number 3947595 (Why is no real title available?)
• The bologna optimal higher-order machine
• scientific article; zbMATH DE number 756053 (Why is no real title available?)
• scientific article; zbMATH DE number 1904868 (Why is no real title available?)
• Optimizing abstract abstract machines
• A Rational Deconstruction of Landin’s SECD Machine

Describes a project that uses

Uses Software

• Modula

This page was built for publication: Optimizing abstract SECD machine code

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