Type-Directed Concurrency Export

@misc{citeulike:1190622, abstract = {We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduction as computation. The concurrent core arises from interpreting proof search as computation. The two are tightly integrated via a monad that permits both sides to share the same logical meaning for the linear connectives while preserving their different computational paradigms. For example, concurrent computation...}, author = {And, Deepak G.}, citeulike-article-id = {1190622}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1659}, comment = {Also at <http://www.cs.cmu.edu/\%7Efp/publications.html> via <http://lambda-the-ultimate.org/node/2157>}, keywords = {concurrency, type-system, type-theory}, posted-at = {2007-03-28 02:39:55}, priority = {2}, title = {Type-Directed Concurrency}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1659} }

TY - GEN ID - citeulike:1190622 L3 - citeulike-article-id:1190622 N2 - We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduction as computation. The concurrent core arises from interpreting proof search as computation. The two are tightly integrated via a monad that permits both sides to share the same logical meaning for the linear connectives while preserving their different computational paradigms. For example, concurrent computation... TI - Type-Directed Concurrency KW - concurrency KW - type-system KW - type-theory N1 - Also at <http://www.cs.cmu.edu/%7Efp/publications.html> via <http://lambda-the-ultimate.org/node/2157> AU - And, Deepak UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1659 ER -