Bounded-wait merge in Shapiro's concurrent Prolog

DOI10.1007/BF03037100MaRDI QIDQ1079007zbMATH OpenOpenAlexFDO

Authors Anthony J. Kusalik

Publication date 1984

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03037100

zbMATH Keywords

logic programmingConcurrent Prologsystems programmingbounded-wait mergebusy-wait

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
• scientific article; zbMATH DE number 4050951
• scientific article; zbMATH DE number 4030960
• On the Knuth-Bendix completion for concurrent processes
• scientific article; zbMATH DE number 879003
• Bounded quantifications for iteration and concurrency in logic programming
• scientific article; zbMATH DE number 17792
• scientific article; zbMATH DE number 67823
• Constraint-based concurrency and beyond
• Bounded-wait combining: constructing robust and high-throughput shared objects

Cited in

(2)

• Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
• Specification and initialization of a logic computer system

This page was built for publication: Bounded-wait merge in Shapiro's concurrent Prolog

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