Some global optimizations for a PROLOG compiler

DOI10.1016/0743-1066(85)90004-4zbMATH Open0575.68003OpenAlexW2098120938WikidataQ121367928 ScholiaQ121367928MaRDI QIDQ3694653FDOQ3694653

Author name not available (Why is that?)

Publication date: 1985

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(85)90004-4

zbMATH Keywords

PROLOG programsPROLOG compiler

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (17)

• Precise goal-independent abstract interpretation of constraint logic programs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A backtracking algorithm for the stream AND-parallel execution of logic programs
• How to invent a Prolog machine
• Title not available (Why is that?)
• Title not available (Why is that?)
• On computational complexity of Prolog programs
• Inductive assertion method for logic pograms
• On the complexity of dataflow analysis of logic programs
• Set-sharing is redundant for pair-sharing
• Global Optimizations in a Prolog Compiler for the Toam
• A methodology for detecting shared variable dependencies in logic programs
• Design of abstract domains using first-order logic
• Derivation of efficient logic programs by specialization and reduction of nondeterminism
• A simple code improvement scheme for prolog
• Abstract interpretation: a kind of magic

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A verified prolog compiler for the Warren Abstract Machine 👍 👎
• Title not available (Why is that?) 👍 👎
• Global Optimizations in a Prolog Compiler for the Toam 👍 👎

This page was built for publication: Some global optimizations for a PROLOG compiler

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