Show simple item record  

dc.contributor.authorCleary, John G.
dc.contributor.authorUtting, Mark
dc.contributor.authorClayton, Roger
dc.date.accessioned2013-11-12T01:19:30Z
dc.date.available2013-11-12T01:19:30Z
dc.date.issued2013-11-11
dc.identifier.citationCleary, 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.en_NZ
dc.identifier.issn1177-777X
dc.identifier.urihttps://hdl.handle.net/10289/8163
dc.description.abstractIt 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.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoenen_NZ
dc.publisherUniversity of Waikato, Department of Computer Scienceen_NZ
dc.relation.ispartofseriesComputer Science Working Papersen_NZ
dc.rights© 2013 John G. Cleary, Mark Utting and Roger Claytonen_NZ
dc.subjectcomputer scienceen_NZ
dc.subjectlogic programmingen_NZ
dc.subjectparallel evaluationen_NZ
dc.subjectstarlogen_NZ
dc.titleA Parallel semantics for normal logic programs plus timeen_NZ
dc.typeWorking Paperen_NZ
uow.relation.series05/2013


Files in this item

This item appears in the following Collection(s)

Show simple item record