Parma—bridging the performance gap between imperative and logic programming

DOI10.1016/S0743-1066(96)00065-9zbMATH Open0877.68020MaRDI QIDQ4339844FDOQ4339844

Authors:

Publication date: 16 June 1997

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Recommendations

• PARLOG: parallel programming in logic
• Paraconsistent logic programming
• scientific article; zbMATH DE number 4026795
• scientific article; zbMATH DE number 4128360
• scientific article; zbMATH DE number 4049157
• An execution model for exploiting AND-parallelism in logic programs
• Towards a parallel virtual machine for functional logic programming

zbMATH Keywords

Prolog compilerParma

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20)

Cited In (5)

• Flat Parlog: A basis for comparison
• SMCHR: satisfiability modulo constraint handling rules
• Title not available (Why is that?)
• Notes on the implementation of PARLOG
• Title not available (Why is that?)

This page was built for publication: Parma—bridging the performance gap between imperative and logic programming

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