Some global optimizations for a PROLOG compiler
From MaRDI portal
Publication:3694653
DOI10.1016/0743-1066(85)90004-4zbMath0575.68003OpenAlexW2098120938WikidataQ121367928 ScholiaQ121367928MaRDI QIDQ3694653
No author found.
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
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items
Inductive assertion method for logic pograms, A backtracking algorithm for the stream AND-parallel execution of logic programs, Precise goal-independent abstract interpretation of constraint logic programs., Design of abstract domains using first-order logic, A methodology for detecting shared variable dependencies in logic programs, Abstract interpretation: a kind of magic, On the complexity of dataflow analysis of logic programs, How to invent a Prolog machine, Set-sharing is redundant for pair-sharing, Derivation of efficient logic programs by specialization and reduction of nondeterminism
