On the public citation graph

The undecidability of typability in the Lambda-Pi-calculus

https://doi.org/10.1007/bfb0037103
0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(81)90040-2openalex-snapshot
The undecidability of the second-order unification problem
inferredcites →https://doi.org/10.1016/s0019-9958(73)90301-xopenalex-snapshot
The undecidability of unification in third order logic
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot
An algorithm for testing conversion in type theory
inferredcites →https://doi.org/10.1017/s0956796800020025openalex-snapshot
Introduction to generalized type systems
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08555-9openalex-snapshot
A variant of a recursively unsolvable problem
inferredcites →https://doi.org/10.1109/lics.1992.185514openalex-snapshot
Third order matching is decidable
inferredcites →https://doi.org/10.1109/lics.1992.185556openalex-snapshot
The Church-Rosser property for beta eta -reduction in typed lambda -calculi
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45685-6_2openalex-snapshot
Higher Order Unification 30 Years Later
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_20openalex-snapshot
Type Inference for First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_66openalex-snapshot
Elf: A meta-language for deductive systems
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_7openalex-snapshot
slepice: Towards a Verified Implementation of Type Theory in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_5openalex-snapshot
A Formal Treatment of Bidirectional Typing
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_6openalex-snapshot
Generic bidirectional typing for dependent type theories
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_15openalex-snapshot
Verification of PCP-Related Computational Reductions in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-03153-3_1openalex-snapshot
Introduction to Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_5openalex-snapshot
Logical Frameworks—A Brief Introduction
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot
Logical Frameworks
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50020-5openalex-snapshot
Proof-Assistants Using Dependent Type Systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80014-5openalex-snapshot
Dependent types
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80018-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00036-xopenalex-snapshot
Comparing cubes of typed and type assignment systems
inferred← citeshttps://doi.org/10.1017/s0956796800003750openalex-snapshot
Domain-free pure type systems
inferred← citeshttps://doi.org/10.1017/s0956796812000408openalex-snapshot
An insider's look at LF type reconstruction: everything you (n)ever wanted to know
inferred← citeshttps://doi.org/10.1017/s0956796899003627openalex-snapshot
Type checking dependent (record) types and subtyping
inferred← citeshttps://doi.org/10.1017/s0960129597002302openalex-snapshot
Type reconstruction in Fω
inferred← citeshttps://doi.org/10.1017/s0960129599002856openalex-snapshot
Some logical and syntactical observations concerning the first-order dependent type system λP
inferred← citeshttps://doi.org/10.1109/lics.1994.316059openalex-snapshot
The emptiness problem for intersection types
inferred← citeshttps://doi.org/10.1145/182409.182456openalex-snapshot
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
inferred← citeshttps://doi.org/10.1145/3239332.3242766openalex-snapshot
Typing the wild in Erlang
inferred← citeshttps://doi.org/10.2307/2586625openalex-snapshot
The emptiness problem for intersection types
inferred← citeshttps://doi.org/10.48550/arxiv.1711.07023openalex-snapshot
Verification of PCP-Related Computational Reductions in Coq
inferred← citeshttps://doi.org/10.70675/1423c0dez59dez4873zac7fzc6cd90f116dbopenalex-snapshot
Generic bidirectional typing in a logical framework for dependent type theories
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.