The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The calculus of constructions
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 formulation of the simple theory of types
Church, A. (1940) · Journal of Symbolic Logic · doi:10.2307/2266170 · Cited by 1,903
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
Martin-Löf, P. (1984) · Bibliopolis eBooks · Cited by 1,274
de Bruijn, N. G. (1972) · Indagationes Mathematicae (Proceedings) · doi:10.1016/1385-7258(72)90034-0 · Cited by 1,049
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
Curry, H. B., Hindley, J. R., & Seldin, J. P. (1980) · Academic Press eBooks · Cited by 924
Towards a theory of type structure
Reynolds, J. C. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_148 · Cited by 815
A Set of Postulates for the Foundation of Logic
Church, A. (1932) · The Annals of Mathematics · doi:10.2307/1968337 · Cited by 583
A unification algorithm for typed λ-calculus
Huet, G. P. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90011-0 · Cited by 510
Self-citationConstructive mathematics and computer programming
Martin-Lof, P. (1984) · Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences · doi:10.1098/rsta.1984.0073 · Cited by 499
Girard, J.-Y. (1971) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70843-7 · Cited by 452
Cited by
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
The Lean Theorem Prover (System Description)
de Moura, L., Kong, S., Avigad, J., van Doorn, F., & von Raumer, J. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-21401-6_26 · Cited by 416
A Machine-Checked Proof of the Odd Order Theorem
Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Le Roux, S., Mahboubi, A., O’Connor, R., Ould Biha, S., et al. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39634-2_14 · Cited by 290
The Lean 4 Theorem Prover and Programming Language
Moura, L. D., & Ullrich, S. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-79876-5_37 · Cited by 258
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Metadata
- Authors
- Coquand, T., & Huet, G.
- Venue
- Information and Computation
- Publisher
- Elsevier BV
- Published
- 1988-02
- Volume
- 76
- Issue
- 2-3
- Pages
- 95-120
- ISSN
- 0890-5401 (ISSN-L)
- OpenAlex
- W1986402635
- Cited by
- 1,082
- References
- 14
- FWCI
- 23.61
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The calculus of constructions. https://app.cochat.ai/papers/10.1016/0890-5401(88)90005-3
- The paper
- Coquand, T., & Huet, G. (1988). The calculus of constructions. Information and Computation. https://doi.org/10.1016/0890-5401(88)90005-3
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.
