The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Types for dyadic interaction
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A calculus of mobile processes, I
Milner, R., Parrow, J., & Walker, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90008-4 · Cited by 2,845
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Computational interpretations of linear logic
Abramsky, S. (1993) · Theoretical Computer Science · doi:10.1016/0304-3975(93)90181-r · Cited by 409
The Principal Type-Scheme of an Object in Combinatory Logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.2307/1995158 · Cited by 319
Lafont, Y. (1990) · Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90 · doi:10.1145/96709.96718 · Cited by 316
Milner, R. (2005) · Springer eBooks · doi:10.1007/bfb0032030 · Cited by 129
Types in lambda calculi and programming languages
Barendregt, H. P., & Hemerik, K. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52592-0_53 · Cited by 38
Cited by
Subtyping for session types in the pi calculus
Gay, S., & Hole, M. (2005) · Acta Informatica · doi:10.1007/s00236-005-0177-z · Cited by 373
Idris 2: Quantitative Type Theory in Practice
Brady, E. (2021) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2021.9 · Cited by 47
“In Section 5 we gave an example of using QTT to implement Dyadic Session Types [21].”
BackgroundMethodInfluential
Metadata
- Authors
- Honda, K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1993
- Volume
- 851
- Pages
- 509-523
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1941373452
- Cited by
- 396
- References
- 7
- FWCI
- 3.67
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.