Some global optimizations for a PROLOG compiler
From MaRDI portal
Recommendations
Cited in
(26)- Inductive assertion method for logic pograms
- A backtracking algorithm for the stream AND-parallel execution of logic programs
- A methodology for detecting shared variable dependencies in logic programs
- On computational complexity of Prolog programs
- Precise goal-independent abstract interpretation of constraint logic programs.
- Set-sharing is redundant for pair-sharing
- How to invent a Prolog machine
- Design of abstract domains using first-order logic
- Automata-driven indexing of prolog clauses
- Polyvariant detection of uninitialized arguments of prolog predicates
- scientific article; zbMATH DE number 4178749 (Why is no real title available?)
- scientific article; zbMATH DE number 3907751 (Why is no real title available?)
- Analysis of sequential PROLOG programs
- scientific article; zbMATH DE number 3956406 (Why is no real title available?)
- Compiling control
- A simple code improvement scheme for prolog
- scientific article; zbMATH DE number 512886 (Why is no real title available?)
- scientific article; zbMATH DE number 572196 (Why is no real title available?)
- Design and analysis of hardware for high-performance prolog
- Detection and optimization of suspension-free logic programs
- scientific article; zbMATH DE number 1950443 (Why is no real title available?)
- scientific article; zbMATH DE number 1973219 (Why is no real title available?)
- Global Optimizations in a Prolog Compiler for the Toam
- On the complexity of dataflow analysis of logic programs
- Abstract interpretation: a kind of magic
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
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)