Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1248648.1248653
DC Field | Value | |
---|---|---|
dc.title | A concurrent constraint handling rules implementation in Haskell with software transactional memory | |
dc.contributor.author | Lam, E.S.L. | |
dc.contributor.author | Sulzmann, M. | |
dc.date.accessioned | 2013-07-04T08:02:15Z | |
dc.date.available | 2013-07-04T08:02:15Z | |
dc.date.issued | 2007 | |
dc.identifier.citation | Lam, E.S.L.,Sulzmann, M. (2007). A concurrent constraint handling rules implementation in Haskell with software transactional memory. Conference Record of the Annual ACM Symposium on Principles of Programming Languages : 19-24. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/1248648.1248653" target="_blank">https://doi.org/10.1145/1248648.1248653</a> | |
dc.identifier.isbn | 1595936904 | |
dc.identifier.issn | 07308566 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/40348 | |
dc.description.abstract | Constraint Handling Rules (CHR) is a concurrent committed-choice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (atomic formulae). CHR is widely used in a range of applications spanning from type system design to artificial intelligence. However, none of the existing CHR implementations we are aware of exploits concurrency or parallelism explicitly. We give a concurrent CHR implementation using GHC (Glasgow Haskell Compiler) with support for Software Transactional Memory. We achieve some significant performance improvements compared to a single-threaded CHR implementation. We obtain a further speed-up, in some cases nearly close to the optimum of 100%, when running programs under under a dual-core processor architecture. Our results show that CHR can be implemented efficiently on a multi-core architecture. Copyright 2007 ACM. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1248648.1248653 | |
dc.source | Scopus | |
dc.subject | Parallel implementation of concurrent language | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1145/1248648.1248653 | |
dc.description.sourcetitle | Conference Record of the Annual ACM Symposium on Principles of Programming Languages | |
dc.description.page | 19-24 | |
dc.description.coden | CRLAD | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.