This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate.
Gopal GuptaEnrico PontelliKhayri A. M. AliMats CarlssonManuel V. Hermenegildo
Michæl PhilippsenErnst A. HeinzPaul Lukowicz
Laxmikant V. KaléDavid PaduaDavid Sehr