On the public citation graph
A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure
0 signed · 136 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.1016/0003-4843(74)90010-2openalex-snapshot
The correspondence between cut-elimination and normalization
inferredcites →https://doi.org/10.1016/0304-3975(93)90011-hopenalex-snapshot
Constructive logics Part I: A tutorial on proof systems and typed λ-calculi
inferredcites →https://doi.org/10.1016/s0003-4843(77)80004-1openalex-snapshot
Normalization as a homomorphic image of cut-elimination
inferredcites →https://doi.org/10.1017/s0956796800001945openalex-snapshot
λν, a calculus of explicit substitutions which preserves strong normalisation
inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot
A new constructive logic: classic logic
inferredcites →https://doi.org/10.1090/mmono/067openalex-snapshot
Mathematical Intuitionism: Introduction to Proof Theory
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11506676_17openalex-snapshot
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
inferred← citeshttps://doi.org/10.1007/11780342_19openalex-snapshot
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/11805618_15openalex-snapshot
Structural Proof Theory as Rewriting
inferred← citeshttps://doi.org/10.1007/11874683_29openalex-snapshot
A Sequent Calculus for Type Theory
inferred← citeshttps://doi.org/10.1007/11916277_9openalex-snapshot
On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_24openalex-snapshot
An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_20openalex-snapshot
Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_51openalex-snapshot
Revisiting the Correspondence between Cut Elimination and Normalisation
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_68openalex-snapshot
Minimal Classical Logic and Control Operators
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_32openalex-snapshot
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_7openalex-snapshot
Fully Automatic Adaptation of Software Components Based on Semantic Specifications*
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_23openalex-snapshot
A CPS-Transform of Constructive Classical Logic
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_20openalex-snapshot
A Curry-Howard Isomorphism for Compilation and Program Execution
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_26openalex-snapshot
Strong Normalisation of Cut-Elimination in Classical Logic
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_5openalex-snapshot
Cut Elimination for Classical Proofs as Continuation Passing Style Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-05998-9_8openalex-snapshot
A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_10openalex-snapshot
Lorenzen-Style Strategies as Proof-Search Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-50981-0openalex-snapshot
Peter Schroeder-Heister on Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-50981-0_9openalex-snapshot
Focusing Gentzen’s LK Proof System
inferred← citeshttps://doi.org/10.1007/978-3-031-66997-2_16openalex-snapshot
Partial Proof Terms in the Study of Idealized Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_1openalex-snapshot
The Vanilla Sequent Calculus is Call-by-Value
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_18openalex-snapshot
Proof Search in Classical Propositional Logic with Partial Proof Terms
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_5openalex-snapshot
A Focused Sequent Calculus for Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_7openalex-snapshot
A Translation of Intersection and Union Types for the λμ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_23openalex-snapshot
A Resource Aware Computational Interpretation for Herbelin’s Syntax
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_18openalex-snapshot
A Direct Proof of Strong Normalization for an Extended Herbelin’s Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_13openalex-snapshot
Confluence and Strong Normalisation of the Generalised Multiary λ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_30openalex-snapshot
Extending the Explicit Substitution Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_6openalex-snapshot
Characterising Strongly Normalising Intuitionistic Sequent Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_27openalex-snapshot
Refocusing Generalised Normalisation
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_1openalex-snapshot
On a Logical Foundation for Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_10openalex-snapshot
Completing Herbelin’s Programme
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_24openalex-snapshot
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_20openalex-snapshot
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_3openalex-snapshot
On a Logical Foundation for Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_20openalex-snapshot
The Theory of Calculi with Explicit Substitutions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_27openalex-snapshot
Strong Normalisation of Cut-Elimination That Simulates β-Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_6openalex-snapshot
The Logic of Proofs as a Foundation for Certifying Mobile Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_17openalex-snapshot
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-11931-6_9openalex-snapshot
Recent Improvements of MagicHaskeller
inferred← citeshttps://doi.org/10.1007/978-3-642-15640-3_5openalex-snapshot
Functions as Processes: Termination and the $\lambda\mu\widetilde{\mu}$ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-22303-7_7openalex-snapshot
Intuitionistic Sequent-Style Calculus with Explicit Structural Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_10openalex-snapshot
Intersection Types for the Resource Control Lambda Calculi
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_1openalex-snapshot
Inhabitants of Intuitionistic Implicational Theorems
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_2openalex-snapshot
Revisiting Zucker’s Work on the Correspondence Between Cut-Elimination and Normalisation
inferred← citeshttps://doi.org/10.1007/978-981-99-8311-7_5openalex-snapshot
Proofs as Terms, Terms as Graphs
inferred← citeshttps://doi.org/10.1007/bf02390456openalex-snapshot
On the linear decoration of intuitionistic derivations
inferred← citeshttps://doi.org/10.1007/bfb0027414openalex-snapshot
Two loop detection mechanisms: A comparison
inferred← citeshttps://doi.org/10.1007/s00224-009-9183-9openalex-snapshot
The λ-Calculus and the Unity of Structural Proof Theory
inferred← citeshttps://doi.org/10.1007/s10817-017-9427-3openalex-snapshot
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.1007/s10992-020-09577-2openalex-snapshot
What is the Meaning of Proofs?
inferred← citeshttps://doi.org/10.1007/s11787-010-0011-4openalex-snapshot
Some General Results About Proof Normalization
inferred← citeshttps://doi.org/10.1007/s11787-014-0099-zopenalex-snapshot
Extracting BB′IW Inhabitants of Simple Types From Proofs in the Sequent Calculus $${LT_\to^{t}}$$ L T → t for Implicational Ticket Entailment
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.002openalex-snapshot
Call-by-name reduction and cut-elimination in 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.apal.2011.09.007openalex-snapshot
Justification Logic as a foundation for certifying mobile computation
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.1016/j.entcs.2015.04.007openalex-snapshot
Yet Another Bijection Between Sequent Calculus and Natural Deduction
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.008openalex-snapshot
Focused Linear Logic and the λ-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.011openalex-snapshot
Multi-focused Proofs with Different Polarity Assignments
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.09.014openalex-snapshot
A Unified Procedure for Provability and Counter-Model Generation in Minimal Implicational Logic
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.008openalex-snapshot
Resource operators for λ-calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.032openalex-snapshot
Pattern matching as cut elimination
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00174-2openalex-snapshot
A typed context calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00138-8openalex-snapshot
Permutability of proofs in intuitionistic sequent calculi
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00143-1openalex-snapshot
Termination of permutative conversions in intuitionistic Gentzen calculi
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00244-8openalex-snapshot
Representing scope in intuitionistic deductions
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00178-4openalex-snapshot
On the intuitionistic force of classical search
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01182-5openalex-snapshot
Sequent Calculi for the Normal Terms of the λΠ- and λΠ∑-Calculi
inferred← citeshttps://doi.org/10.1017/s0956796898002986openalex-snapshot
Functional runtime systems within the lambda-sigma calculus
inferred← citeshttps://doi.org/10.1017/s0956796899003524openalex-snapshot
Lambda terms for natural deduction, sequent calculus and cut elimination
inferred← citeshttps://doi.org/10.1017/s0960129500003273openalex-snapshot
Cut rules and explicit substitutions
inferred← citeshttps://doi.org/10.1017/s0960129517000111openalex-snapshot
A resource aware semantics for a focused intuitionistic calculus
inferred← citeshttps://doi.org/10.1017/s0960129526100462openalex-snapshot
Gentzen–Mints–Zucker duality
inferred← citeshttps://doi.org/10.1023/a:1005016206457openalex-snapshot
Linear Lambda-Terms and Natural Deduction
inferred← citeshttps://doi.org/10.1023/a:1005099619660openalex-snapshot
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1023/a:1026413320413openalex-snapshot
Marginalia on Sequent Calculi
inferred← citeshttps://doi.org/10.1093/jigpal/jzx018openalex-snapshot
Non-idempotent intersection types for the Lambda-Calculus
inferred← citeshttps://doi.org/10.1093/logcom/exm037openalex-snapshot
Call-by-Value -calculus and LJQ
inferred← citeshttps://doi.org/10.1109/lics.1996.561323openalex-snapshot
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
inferred← citeshttps://doi.org/10.1109/lics.2015.22openalex-snapshot
Polarised Intermediate Representation of Lambda Calculus with Sums
inferred← citeshttps://doi.org/10.1109/skg.2015.8openalex-snapshot
The Variant Gentzen System for the Propositional Logic
inferred← citeshttps://doi.org/10.1112/s1461157000000188openalex-snapshot
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
inferred← citeshttps://doi.org/10.1142/s0129054100000065openalex-snapshot
CONSTRUCTIVE CLASSICAL LOGIC AS CPS-CALCULUS
inferred← citeshttps://doi.org/10.1145/1328438.1328482openalex-snapshot
Focusing and higher-order abstract syntax
inferred← citeshttps://doi.org/10.1145/1516507.1516508openalex-snapshot
Sequent calculi and abstract machines
inferred← citeshttps://doi.org/10.1145/1755952.1755985openalex-snapshot
Safe compositional network sketches
inferred← citeshttps://doi.org/10.1145/1929954.1929959openalex-snapshot
A calculus of multiary sequent terms
inferred← citeshttps://doi.org/10.1145/2003476.2003501openalex-snapshot
Nested proof search as reduction in the Lambda-calculus
inferred← citeshttps://doi.org/10.1145/232627.232632openalex-snapshot
Functional back-ends within the lambda-sigma calculus
inferred← citeshttps://doi.org/10.1145/2429069.2429091openalex-snapshot
Universal properties of impure programming languages
inferred← citeshttps://doi.org/10.1145/2784731.2784757openalex-snapshot
Which simple types have a unique inhabitant?
inferred← citeshttps://doi.org/10.1145/2790449.2790528openalex-snapshot
Computation in focused intuitionistic logic
inferred← citeshttps://doi.org/10.1145/2933575.2933581openalex-snapshot
Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
inferred← citeshttps://doi.org/10.1145/2951913.2951931openalex-snapshot
Sequent calculus as a compiler intermediate language
inferred← citeshttps://doi.org/10.1145/3022670.2951931openalex-snapshot
Sequent calculus as a compiler intermediate language
inferred← citeshttps://doi.org/10.1145/3131851.3131867openalex-snapshot
Characterization of strong normalizability for a sequent lambda calculus with co-control
inferred← citeshttps://doi.org/10.1145/3331453.3360959openalex-snapshot
Characterizing Strongly Normalizing λGtz-terms via Non-Idempotent Intersection Types
inferred← citeshttps://doi.org/10.1145/3498669openalex-snapshot
A fine-grained computational interpretation of Girard’s intuitionistic proof-nets
inferred← citeshttps://doi.org/10.1145/3776715openalex-snapshot
Classical Notions of Computation and the Hasegawa-Thielecke Theorem
inferred← citeshttps://doi.org/10.1145/944705.944723openalex-snapshot
Call-by-value is dual to call-by-name
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:1)2009openalex-snapshot
A Theory of Explicit Substitutions with Safe and Full Composition
inferred← citeshttps://doi.org/10.2168/lmcs-7(1:6)2011openalex-snapshot
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
inferred← citeshttps://doi.org/10.2298/pim0796085gopenalex-snapshot
Intersection types for λGtz-calculus
inferred← citeshttps://doi.org/10.3233/fi-2012-772openalex-snapshot
Characterising Strongly Normalising Intuitionistic Terms
inferred← citeshttps://doi.org/10.3233/fi-2015-1253openalex-snapshot
A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic
inferred← citeshttps://doi.org/10.4204/eptcs.126.3openalex-snapshot
A Coinductive Approach to Proof Search
inferred← citeshttps://doi.org/10.4204/eptcs.185.7openalex-snapshot
Sequent Calculus and Equational Programming
inferred← citeshttps://doi.org/10.46298/entics.10507openalex-snapshot
Data Layout from a Type-Theoretic Perspective
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:4)2024openalex-snapshot
A Strong Bisimulation for a Classical Term Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3455openalex-snapshot
Resource control and strong normalisation
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2283openalex-snapshot
A journey through resource control lambda calculi and explicit substitution using intersection types (an account)
inferred← citeshttps://doi.org/10.48550/arxiv.1910.01775openalex-snapshot
Formula Transformers and Combinatorial Test Generators for Propositional Intuitionistic Theorem Provers
inferred← citeshttps://doi.org/10.5282/edoc.9761openalex-snapshot
Decidability for Non-Standard Conversions in Typed Lambda-Calculi
inferred← citeshttps://doi.org/10.5287/ora-7rn6qorrjopenalex-snapshot
Meaning and duality: from categorical logic to quantum physics
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/5870openalex-snapshot
Certificates for Incremental Type Checking
inferred← citeshttps://doi.org/10.70675/3c7efdf6z206cz4554z9fcbz4239a3c4953eopenalex-snapshot
Developing proof theory for proof exchange
inferred← citeshttps://doi.org/10.70675/c7bca972zc1d0z48ccz9c93z4dbb1e82b169openalex-snapshot
Proof theory, syntactic representations, logic, and sharing
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.