On the public citation graph
The Language χ: Circuits, Computations and Classical Logic
0 signed · 49 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.1006/inco.1996.0025openalex-snapshot
A Symmetric Lambda Calculus for Classical Program Extraction
inferredcites →https://doi.org/10.1007/3-540-58216-9openalex-snapshot
Logic Programming and Automated Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-24849-1_15openalex-snapshot
Classical Proofs, Typed Processes, and Intersection Types
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.ic.2003.09.004openalex-snapshot
Intersection types for explicit substitutions
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1016/s0304-3975(01)00148-7openalex-snapshot
Computational isomorphisms in classical logic
inferredcites →https://doi.org/10.1016/s1571-0661(05)80417-7openalex-snapshot
Computational isomorphisms in classical logic
inferredcites →https://doi.org/10.1016/s1571-0661(05)82619-2openalex-snapshot
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus
inferredcites →https://doi.org/10.1017/cbo9780511623585openalex-snapshot
Principia Mathematica to *56
inferredcites →https://doi.org/10.1017/s0956796899003524openalex-snapshot
Lambda terms for natural deduction, sequent calculus and cut elimination
inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot
A new constructive logic: classic logic
inferredcites →https://doi.org/10.1021/jp972232zopenalex-snapshot
Molecular Simulation of Peptide Interactions with an RP-HPLC Sorbent
inferredcites →https://doi.org/10.1090/mmono/067openalex-snapshot
Mathematical Intuitionism: Introduction to Proof Theory
inferredcites →https://doi.org/10.1145/263699.263722openalex-snapshot
A Curry-Howard foundation for functional computation with control
inferredcites →https://doi.org/10.1145/75277.75303openalex-snapshot
Continuation-passing, closure-passing style
inferredcites →https://doi.org/10.1145/944705.944723openalex-snapshot
Call-by-value is dual to call-by-name
inferredcites →https://doi.org/10.2307/2275572openalex-snapshot
A new deconstructive logic: linear 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/11591191_13openalex-snapshot
Strong Normalization of the Dual Classical Sequent Calculus
inferred← citeshttps://doi.org/10.1007/11693024_7openalex-snapshot
Approaches to Polymorphism in Classical Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_28openalex-snapshot
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_7openalex-snapshot
A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.007openalex-snapshot
Kripke models for classical logic
inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.010openalex-snapshot
Completeness and partial soundness results for intersection and union typing for λ¯μμ
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.12.039openalex-snapshot
On the Computational Representation of Classical Logical Connectives
inferred← citeshttps://doi.org/10.1017/s0960129508006762openalex-snapshot
Computation with classical sequents
inferred← citeshttps://doi.org/10.1063/1.3636852openalex-snapshot
Classical Proofs’ Essence and Diagrammatic Computation
inferred← citeshttps://doi.org/10.1093/jigpal/jzq013openalex-snapshot
Soundness and principal contexts for a shallow polymorphic type system based on classical logic
inferred← citeshttps://doi.org/10.1145/3149823openalex-snapshot
Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types
inferred← citeshttps://doi.org/10.3233/fi-2012-770openalex-snapshot
Completeness and Soundness Results for 𝒳 with Intersection and Union Types
inferred← citeshttps://doi.org/10.4204/eptcs.45.3openalex-snapshot
Sound and Complete Typing for lambda-mu
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4570openalex-snapshot
Reduction in X does not agree with Intersection and Union Types (Extended abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4817openalex-snapshot
From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4754openalex-snapshot
Computational interpretation of classical logic with explicit structural rules
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.