期刊名称:Journal of Computing and Information Technology
印刷版ISSN:1330-1136
电子版ISSN:1846-3908
出版年度:1997
卷号:5
期号:2
页码:129-138
语种:English
出版社:SRCE - Sveučilišni računski centar
摘要:Parallelism and non-determinism are fundamental concepts in the process algebra theory. Combining them with lambda-calculus can enlighten the theory of higher-order process algebras. In recent papers an analysis of a lambda-calculus containing parallel and non-deterministic operators was carried on by means of a type assignment system with intersection and union types. The present paper answers the problem of determining principal types for this system.