Principal typing schemes in a polyadic π-calculus
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 524-538
- https://doi.org/10.1007/3-540-57208-2_36
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Typing and subtyping for mobile processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A sort inference algorithm for the polyadic π-calculusPublished by Association for Computing Machinery (ACM) ,1993
- On asynchronous communication semanticsPublished by Springer Nature ,1992
- A Simple Algorithm and Proof for Type Inference1Fundamenta Informaticae, 1987
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982