The Intensional Implementation Technique for Chain Datalog Programs

@inproceedings{Rondogiannis1998TheII,
  title={The Intensional Implementation Technique for Chain Datalog Programs},
  author={Panos Rondogiannis and Manolis Gergatsoulis},
  year={1998}
}
The notion of branching time has been shown to be a promising means of implementing rst and higher-order functional languages. More speciically, functional programs are transformed into zero-order branching-time programs which can then be executed in a tagged demand-driven way. Although this approach has been widely used in Lucid implementations, it has not been shown to apply to logic programming languages as well. In this paper we propose a transformation algorithm from a subclass of logic… CONTINUE READING
2 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Unfold / fold transformations for de nite clauseprograms

  • P. Rondogiannis M. Gergatsoulis
  • Programming Language Implementation and Logic…
  • 1994

An Overview of an Eductive Evaluation Mechanism for LogicPrograms

  • T. Faustini.
  • Proceedings of the Sixth International Symposium…
  • 1993

Towards a uni ed theory of intensional logic program

  • W. W. Wadge
  • The Journal of Logic Programming
  • 1992

Tense logic programming: A respectable alternative

  • W. W. Wadge
  • In Proc. of the
  • 1988

Cactus : A branchingtimelogic programming language

  • T. Panayiotopoulos.

Similar Papers

Loading similar papers…