A unification algorithm for typed λ-calculus
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Most knowledge representation languages avoid higher-order quantification owing to problems with decidability and theorem-proving efficiency.
“Although McCarthy (1999) long advocated the use of higher-order logic for representing common sense reasoning, most knowledge representation languages avoid higher-order quantification owing to problems with decidability (Huet 1975) and theorem-proving efficiency.”
From Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (2015) · cites this paper as Huet 1975
Cited by
Sorted by citations
Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
Muggleton, S. H., Lin, D., & Tamaddoni-Nezhad, A. (2015) · Machine Learning · doi:10.1007/s10994-014-5471-y · Cited by 184 · see citing works
Top-Down Synthesis for Library Learning
Bowers, M., Olausson, T. X., Wong, L., Grand, G., Tenenbaum, J. B., Ellis, K., & Solar-Lezama, A. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3571234 · Cited by 33 · see citing works
- Authors
- Huet, G. P.
- Affiliations
- Institut national de recherche en sciences et technologies du numérique (FR)
- Corresponding author
- Huet, G.P.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1975-06
- Volume
- 1
- Issue
- 1
- Pages
- 27-57
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2034676877
- Cited by
- 510
- References
- 0
- Citations by year
- 2026: 4 · 2025: 2 · 2024: 7 · 2023: 5 · 2022: 2 · 2021: 13 · 2020: 7 · 2019: 10 · 2018: 6 · 2017: 5 · 2016: 4 · 2015: 8 · 2014: 6 · 2013: 11 · 2012: 10
- FWCI
- 3.66
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Theoretical Computer Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- unification algorithms, typed lambda calculus, most general unifier, search space reduction, algorithm correctness, directionality, convergence
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
