On the public citation graph

βη-Equality for coproducts

https://doi.org/10.1007/bfb0014052
0 signed · 45 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-18508-9_23openalex-snapshot
Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms
inferredcites →https://doi.org/10.1007/3-540-56868-9_12openalex-snapshot
Some lambda calculi with categorical sums and products
inferredcites →https://doi.org/10.1007/3-540-56939-1_109openalex-snapshot
A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
inferredcites →https://doi.org/10.1007/bfb0037094openalex-snapshot
On Mints' reduction for ccc-calculus
inferredcites →https://doi.org/10.1007/bfb0061280openalex-snapshot
Formal Category Theory: Adjointness for 2-Categories
inferredcites →https://doi.org/10.1016/0022-4049(88)90124-7openalex-snapshot
Local adjunctions
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferredcites →https://doi.org/10.1017/cbo9780511525902.009openalex-snapshot
Modelling reduction in confluent categories
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.

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-44802-0_42openalex-snapshot
Monotone Inductive and Coinductive Constructors of Rank 2
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_12openalex-snapshot
Lambda Definability with Sums via Grothendieck Logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-60164-3_27openalex-snapshot
Categorical reconstruction of a reduction free normalization proof
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_53openalex-snapshot
On the power of simple diagrams
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_35openalex-snapshot
Eta-expansions in dependent type theory — The calculus of constructions
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_40openalex-snapshot
Simulating η-expansions with Β-reductions in the second-order polymorphic λ-rcalculus
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_181openalex-snapshot
On modular properties of higher order extensional lambda calculi
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_39openalex-snapshot
Eta-expansions in F ω
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_19openalex-snapshot
Normalization by Evaluation for λ →2
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_19openalex-snapshot
Extensional Rewriting with Sums
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_21openalex-snapshot
A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_11openalex-snapshot
Logic and Computation in a Lambda Calculus with Intersection and Union Types
inferred← citeshttps://doi.org/10.1007/bfb0014068openalex-snapshot
Categorical completeness results for the simply-typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/s11225-017-9772-6openalex-snapshot
The Naturality of Natural Deduction
inferred← citeshttps://doi.org/10.1007/s11225-019-09858-1openalex-snapshot
A Refined Interpretation of Intuitionistic Logic by Means of Atomic Polymorphism
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.031openalex-snapshot
A Local Graph-rewriting System for Deciding Equality in Sum-product Theories
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.004openalex-snapshot
Strong normalisation in the π-calculus
inferred← citeshttps://doi.org/10.1016/s0022-4049(00)00161-4openalex-snapshot
On the semantics of classical disjunction
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferred← citeshttps://doi.org/10.1017/s0956796809007278openalex-snapshot
Big-step normalisation
inferred← citeshttps://doi.org/10.1109/lics.1995.523263openalex-snapshot
Equality between functionals in the presence of coproducts
inferred← citeshttps://doi.org/10.1109/lics.2001.932506openalex-snapshot
Normalization by evaluation for typed lambda calculus with coproducts
inferred← citeshttps://doi.org/10.1109/lics.2015.22openalex-snapshot
Polarised Intermediate Representation of Lambda Calculus with Sums
inferred← citeshttps://doi.org/10.1145/2784731.2784757openalex-snapshot
Which simple types have a unique inhabitant?
inferred← citeshttps://doi.org/10.1145/2951913.2951920openalex-snapshot
Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
inferred← citeshttps://doi.org/10.1145/3009837.3009841openalex-snapshot
On the exp-log normal form of types
inferred← citeshttps://doi.org/10.1145/3093333.3009901openalex-snapshot
Deciding equivalence with sums and the empty type
inferred← citeshttps://doi.org/10.1145/3471874.3472983openalex-snapshot
Practical normalization by evaluation for EDSLs
inferred← citeshttps://doi.org/10.1145/964001.964007openalex-snapshot
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
inferred← citeshttps://doi.org/10.14418/wes01.3.7openalex-snapshot
An Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06603openalex-snapshot
The naturality of natural deduction
inferred← citeshttps://doi.org/10.5282/edoc.9761openalex-snapshot
Decidability for Non-Standard Conversions in Typed Lambda-Calculi
inferred← citeshttps://doi.org/10.70930/tac/xafus3aaopenalex-snapshot
A Note on Rewriting Theory for Uniqueness of Iteration
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.