On the public citation graph

Data types, infinity and equality in system AF 2

https://doi.org/10.1007/bfb0049337
0 signed · 20 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/3-540-52753-2_47openalex-snapshot
On the representation of data in lambda-calculus
inferredcites →https://doi.org/10.1007/3-540-57182-5_52openalex-snapshot
Constant time reductions in λ-calculus
inferredcites →https://doi.org/10.1007/bfb0060623openalex-snapshot
The mathematical language AUTOMATH, its usage, and some of its extensions
inferredcites →https://doi.org/10.1016/0304-3975(86)90044-7openalex-snapshot
The system F of variable types, fifteen years later
inferredcites →https://doi.org/10.1016/0304-3975(86)90109-xopenalex-snapshot
Typing and computational properties of lambda expressions
inferredcites →https://doi.org/10.1016/0304-3975(92)90042-eopenalex-snapshot
Recursive programming with proofs
inferredcites →https://doi.org/10.1016/0304-3975(94)90204-6openalex-snapshot
Realizability interpretation of coinductive definitions and program synthesis with streams
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1184/r1/6604463openalex-snapshot
Contracting proofs to 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-44904-3_1openalex-snapshot
Termination and Productivity Checking with Continuous Types
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_3openalex-snapshot
Strong Normalization and Equi-(Co)Inductive Types
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_19openalex-snapshot
Mixed Inductive/Coinductive Types and Strong Normalization
inferred← citeshttps://doi.org/10.1007/978-3-540-78969-7_15openalex-snapshot
Types for Hereditary Head Normalizing Terms
inferred← citeshttps://doi.org/10.1007/bfb0054298openalex-snapshot
Realizability of monotone coinductive definitions and its application to program synthesis
inferred← citeshttps://doi.org/10.1109/lics.2017.8005103openalex-snapshot
Infinitary intersection types as sequences: A new answer to Klop's problem
inferred← citeshttps://doi.org/10.1145/2933575.2934505openalex-snapshot
Infinitary Lambda Calculi from a Linear Perspective
inferred← citeshttps://doi.org/10.4204/eptcs.81.3openalex-snapshot
Mendler-style Iso-(Co)inductive predicates: a strongly normalizing approach
inferred← citeshttps://doi.org/10.5555/1788446.1788468openalex-snapshot
Types for hereditary head normalizing terms
inferred← citeshttps://doi.org/10.5555/3329995.3330038openalex-snapshot
Infinitary intersection types as sequences: a new answer to Klop's problem
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.