The Polymorphic Pi-Calculus: Theory and Implementation Export

@phdthesis{citeulike:846042, abstract = {We investigate whether the -calculus is able to serve as a good foundation for the design and implementation of a strongly-typed concurrent programming language. The first half of the dissertation examines whether the -calculus supports a simple type system which is flexible enough to provide a suitable foundation for the type system of a concurrent programming language. The second half of the dissertation considers how to implement the -calculus efficiently, starting with an abstract machine...}, author = {Turner, David N.}, citeulike-article-id = {846042}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.8278}, keywords = {concurrency, language-implementation, pi-calculus, types}, posted-at = {2008-04-11 23:42:17}, priority = {2}, title = {The Polymorphic Pi-Calculus: Theory and Implementation}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.8278}, year = {1996} }

TY - THES ID - citeulike:846042 L3 - citeulike-article-id:846042 N2 - We investigate whether the -calculus is able to serve as a good foundation for the design and implementation of a strongly-typed concurrent programming language. The first half of the dissertation examines whether the -calculus supports a simple type system which is flexible enough to provide a suitable foundation for the type system of a concurrent programming language. The second half of the dissertation considers how to implement the -calculus efficiently, starting with an abstract machine... TI - The Polymorphic Pi-Calculus: Theory and Implementation KW - concurrency KW - language-implementation KW - pi-calculus KW - types AU - Turner, David PY - 1996/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.8278 ER -