The DOI matches its Crossref record.
ECC, an extended calculus of constructions
Abstract
A higher-order calculus ECC (extended calculus of constructions) is presented which can be seen as an extension of the calculus of constructions by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics may be adequately formalized. It is shown that ECC is strongly normalizing and has other nice proof-theoretic properties. An omega -set (realizability) model is described to show how the essential properties of the calculus can be captured set-theoretically.>
Overview
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
Cited by
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
MCBRIDE, C., & MCKINNA, J. (2004) · Journal of Functional Programming · doi:10.1017/s0956796803004829 · Cited by 327
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
- Luo, Z.
- Venue
- [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-07
- Pages
- 386-395
- OpenAlex
- W2124729849
- Cited by
- 214
- References
- 0
- FWCI
- 6.87
- Type
- conference paper
- Language
- en
- Open access
- closed
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: ECC, an extended calculus of constructions. https://app.cochat.ai/papers/10.1109/lics.1989.39193
- The paper
- Luo, Z. (2003). ECC, an extended calculus of constructions. [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science. https://doi.org/10.1109/lics.1989.39193
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.