Monadic concurrent linear logic programming Export

@inproceedings{citeulike:2675012, abstract = {Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In this paper we extend Lolli with the remaining connectives of intuitionistic linear logic restricted to occur inside a monad, an idea taken from the concurrent logical framework (CLF). The resulting language, called LolliMon, has a natural forward chaining, committed choice operational semantics inside the monad, while retaining Lolli's semantics outside the monad. LolliMon thereby cleanly integrates both concurrency and saturation with logic programming search. We illustrate its expressive power through several examples including an implementation of the pi-calculus, a call-by-need lambda-calculus, and several saturating algorithms presented in logical form.}, address = {New York, NY, USA}, author = {L\'{o}pez, Pablo and Pfenning, Frank and Polakow, Jeff and Watkins, Kevin}, booktitle = {PPDP '05: Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming}, citeulike-article-id = {2675012}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1069774.1069778}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1069774.1069778}, doi = {10.1145/1069774.1069778}, isbn = {1-59593-090-6}, keywords = {concurrency, linear-logic, monads}, location = {Lisbon, Portugal}, pages = {35--46}, posted-at = {2008-04-15 19:46:03}, priority = {2}, publisher = {ACM}, title = {Monadic concurrent linear logic programming}, url = {http://dx.doi.org/10.1145/1069774.1069778}, year = {2005} }

TY - CONF ID - citeulike:2675012 L3 - citeulike-article-id:2675012 N2 - Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In this paper we extend Lolli with the remaining connectives of intuitionistic linear logic restricted to occur inside a monad, an idea taken from the concurrent logical framework (CLF). The resulting language, called LolliMon, has a natural forward chaining, committed choice operational semantics inside the monad, while retaining Lolli's semantics outside the monad. LolliMon thereby cleanly integrates both concurrency and saturation with logic programming search. We illustrate its expressive power through several examples including an implementation of the pi-calculus, a call-by-need lambda-calculus, and several saturating algorithms presented in logical form. CY - Lisbon, Portugal SN - 1-59593-090-6 AD - New York, NY, USA EP - 46 TI - Monadic concurrent linear logic programming PB - ACM T2 - PPDP '05: Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming SP - 35 KW - concurrency KW - linear-logic KW - monads AU - López, Pablo AU - Pfenning, Frank AU - Polakow, Jeff AU - Watkins, Kevin PY - 2005/// UR - http://dx.doi.org/10.1145/1069774.1069778 ER -