Advertisement

Design and evaluation of a Prolog compiler

  • M. Kishimoto
  • T. Shinogi
  • Y. Kimura
  • A. Hattori
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 221)

Abstract

This paper discusses a Prolog compiler for the FACOM α, a symbolic data processing machine. The compiler includes several optimization algorithms, such as separated predicate frames, extended mode declaration, and fast goal invocation. Compiled programs run at 30 to 40 KLIPS.

Keywords

Machine Instruction Actual Argument Control Frame Garbage Collector Branch Instruction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AKIMOTO H (1985) Evaluation of the dedicated Hardware in FACOM ALPHA. IEEE 1985 COMPCON SPRINGGoogle Scholar
  2. Okuno H (1984) Proposed problems for 3rd LISP contest and 1st Prolog contest. (In Japanese) IPSJ, SYM, 28-4Google Scholar
  3. Tick E, Warren DHD (1984) Towards a pipelined Prolog processor. 1984 International Symposium on Logic ProgrammingGoogle Scholar
  4. Warren DHD (1977) Implementing Prolog — compiling predicate programs. DAI Research Report 39-40, Univ. of EdinburghGoogle Scholar
  5. Warren DHD (1980) An improved Prolog implementation which optimizes tail recursion. 1980 Logic Programming Workshop, Debrecen, HungaryGoogle Scholar
  6. Warren DHD (1983) An abstract Prolog instruction set. Tech Note 309, AIC SRI InternationalGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • M. Kishimoto
    • 1
  • T. Shinogi
    • 1
  • Y. Kimura
    • 1
  • A. Hattori
    • 1
  1. 1.FUJITSU LIMITEDKawasakiJapan

Personalised recommendations