On the public citation graph
On Mints' reduction for ccc-calculus
0 signed · 38 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-54233-7_142openalex-snapshot
A confluent reduction for the λ-calculus with surjective pairing and terminal object
inferredcites →https://doi.org/10.1007/3-540-54415-1_56openalex-snapshot
From programming-by-example to proving-by-example
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1995.1057openalex-snapshot
Parallel Reductions in λ-Calculus
inferred← citeshttps://doi.org/10.1006/inco.2000.2888openalex-snapshot
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-48167-2_4openalex-snapshot
A Modal Lambda Calculus with Iteration and Case Constructs
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_12openalex-snapshot
Some lambda calculi with categorical sums and products
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_90openalex-snapshot
Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_18openalex-snapshot
Reasoning about layered, wildcard and product patterns
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_40openalex-snapshot
Rewriting with extensional polymorphic λ-calculus
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-61464-8_64openalex-snapshot
Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_25openalex-snapshot
A λ-to-CL translation for strong normalization
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/978-3-540-24849-1_22openalex-snapshot
Some Algebraic Structures in Lambda-Calculus with Inductive Types
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/bfb0014050openalex-snapshot
Expanding extensional polymorphism
inferred← citeshttps://doi.org/10.1007/bfb0014068openalex-snapshot
Categorical completeness results for the simply-typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/s11225-021-09952-3openalex-snapshot
Curry–Howard–Lambek Correspondence for Intuitionistic Belief
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00166-2openalex-snapshot
Confluence of extensional and non-extensional λ-calculi with explicit substitutions
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00019-1openalex-snapshot
Syntactic analysis of η-expansions in Pure Type Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80193-8openalex-snapshot
Context-sensitive Conditional Expression Reduction Systems
inferred← citeshttps://doi.org/10.1017/s0956796800001696openalex-snapshot
A confluent reduction for the λ-calculus with surjective pairing and terminal object
inferred← citeshttps://doi.org/10.1017/s0960129500000505openalex-snapshot
Simulating expansions without expansions
inferred← citeshttps://doi.org/10.1017/s0960129501003346openalex-snapshot
Recursion over objects of functional type
inferred← citeshttps://doi.org/10.1017/s096012950400427xopenalex-snapshot
Operational aspects of untyped Normalisation by Evaluation
inferred← citeshttps://doi.org/10.1017/s0960129505004950openalex-snapshot
Isomorphisms of simple inductive types through extensional rewriting
inferred← citeshttps://doi.org/10.1109/lics.1995.523265openalex-snapshot
Normalization and extensionality
inferred← citeshttps://doi.org/10.11185/imt.3.13openalex-snapshot
Completeness of Modal Proofs in First-Order Predicate Logic
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.