A Parallel semantics for normal logic programs plus time
Cleary, J. G. Utting, M., & Clayton, R. (2013). A Parallel semantics for normal logic programs plus time. (Working paper 05/2013). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
Permanent Research Commons link: https://hdl.handle.net/10289/8163
It is proposed that Normal Logic Programs with an explicit time ordering are a suitable basis for a general purpose parallel programming language. Examples show that such a language can accept real-time external inputs and outputs, and mimic assignment, all without departing from its pure logical semantics. This paper describes a fully incremental bottom-up interpreter that supports a wide range of parallel execution strategies and can extract significant potential parallelism from programs with complex dependencies.
University of Waikato, Department of Computer Science
© 2013 John G. Cleary, Mark Utting and Roger Clayton
- 2013 Working Papers