Automatic mode inference for logic programs

DOI10.1016/0743-1066(88)90010-6MaRDI QIDQ3792215zbMATH OpenOpenAlexFDO

Authors Saumya K. 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

aliasingunificationhashinglogic programsdataflow 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

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

Recommendations

• scientific article; zbMATH DE number 1615253
• scientific article; zbMATH DE number 516999
• Efficient dataflow analysis of logic programs
• Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
• Determinacy Analysis for Logic Programs Using Mode and Type Information

Cited in

(9)

• Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
• A mode analysis of logic programs by abstract interpretation
• Termination of narrowing via termination of rewriting
• Optimization schemas for parallel implementation of non-deterministic languages and systems
• An improved proof-theoretic compilation of logic programs
• Type inference in Prolog: A new approach
• On the complexity of dataflow analysis of logic programs
• From LCF to Isabelle/HOL
• Derivation of efficient logic programs by specialization and reduction of nondeterminism

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

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