Affiliation:
1. Auburn Univ., Auburn, AL
Abstract
In parallel programming languages multityped data structures may be shared by two or more processes. Process I/O to these structures is assumed to be physically interleaved but logically parallel. This article addresses a syntactic mechanism to specify a type for such structures and extends an example language and its type-checking algorithm to these structures.
Publisher
Association for Computing Machinery (ACM)
Reference17 articles.
1. CONWAY J.H. 1971. Regular Algebra and Finite Machines. Chapman & Hall London. CONWAY J.H. 1971. Regular Algebra and Finite Machines. Chapman & Hall London.
2. A critique of Occam channel types