Bounded quantifications for iteration and concurrency in logic programming

DOI10.1007/BF03037340zbMath0804.68022MaRDI QIDQ1326573

Jonas Barklund

Publication date: 18 May 1994

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

zbMATH Keywords

parallel computationarraysPrologquantifierslogic programming languagesbounded quantificationdata parallelismdefinite interaction

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Haskell
• Multilisp
• GHC

Cites Work

• First order compiler: A deterministic logic program synthesis algorithm
• {log}: A language for programming in logic with finite sets
• MULTILISP: a language for concurrent symbolic computation
• Making prolog more expressive
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded quantifications for iteration and concurrency in logic programming