Automatic mode inference for logic programs

DOI10.1016/0743-1066(88)90010-6zbMath0647.68010OpenAlexW1975813326MaRDI QIDQ3792215

Saumya Debray, David S. Warren

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0743-1066(88)90010-6

zbMATH Keywords

unificationlogic programshashingaliasingdataflow analysismulti-disk data allocationeffttribute records on several disks so as to achieve high degree of concurrency of disk accessmode informationProlog compiler

Mathematics Subject Classification ID

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

Related Items (8)

An Improved Proof-Theoretic Compilation of Logic Programs ⋮ Optimization schemas for parallel implementation of non‐deterministic languages and systems ⋮ Termination of narrowing via termination of rewriting ⋮ From LCF to Isabelle/HOL ⋮ On the complexity of dataflow analysis of logic programs ⋮ A mode analysis of logic programs by abstract interpretation ⋮ Type inference in Prolog: A new approach ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

This page was built for publication: Automatic mode inference for logic programs