On the public citation graph
λμ-Calculus: An algorithmic interpretation of classical natural deduction
0 signed · 481 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-55460-2_27openalex-snapshot
Free deduction: An analysis of “Computations” in classical logic
inferredcites →https://doi.org/10.1007/bf01792986openalex-snapshot
Opérateurs de mise en mémoire et traduction de Gödel
inferredcites →https://doi.org/10.1007/bfb0021084openalex-snapshot
Classical proofs as programs: How, what and why
inferredcites →https://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse434openalex-snapshot
Automated Theorem Proving
inferred← citeshttps://doi.org/10.1002/malq.200710046openalex-snapshot
Classical truth in higher types
inferred← citeshttps://doi.org/10.1006/inco.1996.0025openalex-snapshot
A Symmetric Lambda Calculus for Classical Program Extraction
inferred← citeshttps://doi.org/10.1006/inco.2001.2947openalex-snapshot
Completeness of Continuation Models for λμ-Calculus
inferred← citeshttps://doi.org/10.1007/11417170_13openalex-snapshot
Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ-Calculus
inferred← citeshttps://doi.org/10.1007/11417170_15openalex-snapshot
Galois Embedding from Polymorphic Types into Existential Types
inferred← citeshttps://doi.org/10.1007/11417170_16openalex-snapshot
On the Degeneracy of Σ-Types in Presence of Computational Classical Logic
inferred← citeshttps://doi.org/10.1007/11417170_19openalex-snapshot
Naming Proofs in Classical Propositional Logic
inferred← citeshttps://doi.org/10.1007/11538363_6openalex-snapshot
Distributed Control Flow with Classical Modal Logic
inferred← citeshttps://doi.org/10.1007/11560586_8openalex-snapshot
The Language χ: Circuits, Computations and Classical Logic
inferred← citeshttps://doi.org/10.1007/11591191_13openalex-snapshot
Strong Normalization of the Dual Classical Sequent Calculus
inferred← citeshttps://doi.org/10.1007/11618027_16openalex-snapshot
Explanation in Natural Language of λμμ-Terms
inferred← citeshttps://doi.org/10.1007/11693024_7openalex-snapshot
Approaches to Polymorphism in Classical Sequent Calculus
inferred← citeshttps://doi.org/10.1007/11964681_4openalex-snapshot
A Rational Deconstruction of Landin’s J Operator
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_17openalex-snapshot
Monad Translating Inductive and Coinductive Types
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_36openalex-snapshot
Strong Normalization of Second Order Symmetric λ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_32openalex-snapshot
On the Computational Interpretation of Negation
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_28openalex-snapshot
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_13openalex-snapshot
Parameterizations and Fixed-Point Operators on Control Categories
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_18openalex-snapshot
Polarized Proof Nets with Cycles and Fixpoints Semantics
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_9openalex-snapshot
A Sound and Complete CPS-Translation for λμ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_34openalex-snapshot
A Type-Theoretic Study on Partial Continuations
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_35openalex-snapshot
Partially Typed Terms between Church-Style and Curry-Style
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-45315-6_16openalex-snapshot
Axioms for Recursion in Call-by-Value
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_17openalex-snapshot
Strong Normalization of Classical Natural Deduction with Disjunction
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_22openalex-snapshot
A Deconstruction of Non-deterministic Classical Cut Elimination
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_26openalex-snapshot
Parigot’s Second Order λμ-Calculus and Inductive Types
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_4openalex-snapshot
Categorical Semantics of Control
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_23openalex-snapshot
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_3openalex-snapshot
Abstract Machines, Control, and Sequents
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_31openalex-snapshot
Classical Linear Logic of Implications
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_33openalex-snapshot
A Proof Theoretical Account of Continuation Passing Style
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_34openalex-snapshot
Duality between Call-by-Name Recursion and Call-by-Value Iteration
inferred← citeshttps://doi.org/10.1007/3-540-45927-8_10openalex-snapshot
Exceptions, Continuations and Macro-expressiveness
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_16openalex-snapshot
Sharing Continuations: Proofnets for Languages with Explicit Control
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_13openalex-snapshot
Explicitly Typed λμ-Calculus for Polymorphism and Call-by-Value
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/3-540-57887-0_112openalex-snapshot
A symmetric lambda calculus for “classical” program extraction
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_15openalex-snapshot
Strong normalization in a non-deterministic typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_27openalex-snapshot
On the relation between the λμ-calculus and the syntactic theory of sequential control
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_19openalex-snapshot
On the intuitionistic force of classical search (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_66openalex-snapshot
Proof-terms for classical and intuitionistic resolution
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_38openalex-snapshot
Games and weak-head reduction for classical PCF
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_43openalex-snapshot
Classical Brouwer-Heyting-Kolmogorov interpretation
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_62openalex-snapshot
Calculus of classical proofs I
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_1openalex-snapshot
Theoretical Computer Science: Computability, Decidability and Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_22openalex-snapshot
A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy $$\lambda \mu $$-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_2openalex-snapshot
Deciding contextual equivalence of ν-calculus with effectful contexts (full version)
inferred← citeshttps://doi.org/10.1007/978-3-031-51406-7_1openalex-snapshot
Deduction at the Crossroads
inferred← citeshttps://doi.org/10.1007/978-3-031-51406-7_6openalex-snapshot
From Proof-Objects to Grounds
inferred← citeshttps://doi.org/10.1007/978-3-031-51406-7_7openalex-snapshot
On an Ecumenical Natural Deduction with Stoup. Part I: The Propositional Case
inferred← citeshttps://doi.org/10.1007/978-3-031-69940-5_14openalex-snapshot
Proofs with Star and Perp
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_2openalex-snapshot
Free Monads, Intrinsic Scoping, and Higher-Order Preunification
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-03542-0_25openalex-snapshot
On Bar Recursion and Choice in a Classical Setting
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_1openalex-snapshot
Process Types as a Descriptive Tool for Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_24openalex-snapshot
Reduction System for Extensional Lambda-mu Calculus
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-18362-6_5openalex-snapshot
Conjunctive, Disjunctive, Negative Objects and Generalized Quantification
inferred← citeshttps://doi.org/10.1007/978-3-319-20762-9_9openalex-snapshot
Verificationism and Classical Realizability
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_15openalex-snapshot
Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less)
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_11openalex-snapshot
Programming and Proving with Classical Types
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_30openalex-snapshot
Strong Normalization of $\overline{\lambda}\mu\widetilde{\mu}$ -Calculus with Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_17openalex-snapshot
Semantics of Linear Continuation-Passing in Call-by-Name
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_15openalex-snapshot
Classical Proofs, Typed Processes, and Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_19openalex-snapshot
αProlog: A Logic Programming Language with Names, Binding and α-Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_15openalex-snapshot
Call-by-Value Is Dual to Call-by-Name – Reloaded
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_16openalex-snapshot
λμ-Calculus and Duality: Call-by-Name and Call-by-Value
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-45220-1_9openalex-snapshot
Atomic Cut Elimination for Classical Logic
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_27openalex-snapshot
Convolution $\bar\lambda\mu$ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_8openalex-snapshot
An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_27openalex-snapshot
Call-by-Name and Call-by-Value in Normal Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_28openalex-snapshot
Call-by-Value Is Dual to Call-by-Name, Extended
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_13openalex-snapshot
On the Relations between the Syntactic Theories of λμ-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_17openalex-snapshot
A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_34openalex-snapshot
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_34openalex-snapshot
An Algorithmic Interpretation of a Deep Inference System
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_27openalex-snapshot
Towards Ludics Programming: Interactive Proof Search
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-02273-9_12openalex-snapshot
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
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.1007/978-3-642-04164-8_17openalex-snapshot
A Complete, Co-inductive Syntactic Theory of Sequential Control and State
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_18openalex-snapshot
Classical Natural Deduction for S4 Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_11openalex-snapshot
Program Logics for Sequential Higher-Order Control
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_7openalex-snapshot
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_26openalex-snapshot
A Hierarchy for Delimited Continuations in Call-by-Name
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_3openalex-snapshot
Linearly-Used Continuations in the Enriched Effect Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-12251-4_11openalex-snapshot
Standardization and Böhm Trees for Λμ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_45openalex-snapshot
What Is the Problem with Proof Nets for Classical Logic?
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_24openalex-snapshot
Towards a Canonical Classical Natural Deduction System
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_28openalex-snapshot
A Sequent Calculus with Implicit Term Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_13openalex-snapshot
The Duality of Computation under Focus
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-19211-1_11openalex-snapshot
The Calculus of Responsibility and Commitment
inferred← citeshttps://doi.org/10.1007/978-3-642-19211-1_12openalex-snapshot
Negative Translations and Duality: Toward a Unified Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-21490-5_2openalex-snapshot
Covert Movement in Logical Grammar
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_18openalex-snapshot
A Filter Model for the λμ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_19openalex-snapshot
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_6openalex-snapshot
Classical Call-by-Need and Duality
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-642-28729-9_8openalex-snapshot
Applicative Bisimulations for Delimited-Control Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_12openalex-snapshot
A Systematic Approach to Delimited Control with Multiple Prompts
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_6openalex-snapshot
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts
inferred← citeshttps://doi.org/10.1007/978-3-642-31262-5_7openalex-snapshot
Importing Montagovian Dynamics into Minimalism
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_26openalex-snapshot
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_27openalex-snapshot
Contextual Natural Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-40355-2_4openalex-snapshot
Functional Type Assignment for Featherweight Java
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_19openalex-snapshot
Complexity Analysis in Presence of Control Operators and Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_21openalex-snapshot
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_19openalex-snapshot
A Classical Realizability Model for a Semantical Value Restriction
inferred← citeshttps://doi.org/10.1007/978-3-662-54069-5_10openalex-snapshot
Deriving Natural Deduction Rules from Truth Tables
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_9openalex-snapshot
Linearity, Control Effects, and Behavioral Types
inferred← citeshttps://doi.org/10.1007/978-3-662-55665-8_38openalex-snapshot
A Reconstruction of Ex Falso Quodlibet via Quasi-Multiple-Conclusion Natural Deduction
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_10openalex-snapshot
Assertions, Hypotheses, Conjectures, Expectations: Rough-Sets Semantics and Proof Theory
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_3openalex-snapshot
Proofs, Reasoning and the Metamorphosis of Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_1openalex-snapshot
Labelled Proof Systems for Intuitionistic Provability
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_5openalex-snapshot
Tableaux for Intuitionistic Logics
inferred← citeshttps://doi.org/10.1007/bf02127805openalex-snapshot
About classical logic and imperative programming
inferred← citeshttps://doi.org/10.1007/bfb0014054openalex-snapshot
A simple calculus of exception handling
inferred← citeshttps://doi.org/10.1007/bfb0014559openalex-snapshot
“Classical” programming-with-proofs in λSymPA: An analysis of non-confluence
inferred← citeshttps://doi.org/10.1007/bfb0014560openalex-snapshot
Environments, continuation semantics and indexed categories
inferred← citeshttps://doi.org/10.1007/bfb0017475openalex-snapshot
A CPS-translation of the λμ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0022564openalex-snapshot
The structure of exponentials: Uncovering the dynamics of linear logic proofs
inferred← citeshttps://doi.org/10.1007/bfb0027012openalex-snapshot
Explicit substitutions for the λΔ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0028011openalex-snapshot
A formulation of linear logic based on dependency-relations
inferred← citeshttps://doi.org/10.1007/bfb0037097openalex-snapshot
Extracting constructive content from classical logic via control-like reductions
inferred← citeshttps://doi.org/10.1007/bfb0055783openalex-snapshot
A computational interpretation of the λΜ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0055911openalex-snapshot
Polymorphic call-by-value calculus based on classical proofs
inferred← citeshttps://doi.org/10.1007/s00153-005-0314-yopenalex-snapshot
A semantical proof of the strong normalization theorem for full propositional classical natural deduction
inferred← citeshttps://doi.org/10.1007/s00153-009-0119-5openalex-snapshot
Counting proofs in propositional logic
inferred← citeshttps://doi.org/10.1007/s001530000057openalex-snapshot
Typed lambda-calculus in classical Zermelo-Frænkel set theory
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/s00354-010-0099-3openalex-snapshot
Classical Natural Deduction for S4 Modal Logic
inferred← citeshttps://doi.org/10.1007/s10988-005-6580-7openalex-snapshot
Explaining Crossover and Superiority as Left-to-right Evaluation
inferred← citeshttps://doi.org/10.1007/s10990-007-9006-0openalex-snapshot
A type-theoretic foundation of delimited continuations
inferred← citeshttps://doi.org/10.1007/s10990-007-9007-zopenalex-snapshot
A proof-theoretic foundation of abortive continuations
inferred← citeshttps://doi.org/10.1007/s10990-007-9016-yopenalex-snapshot
The next 700 Krivine machines
inferred← citeshttps://doi.org/10.1007/s10992-015-9370-xopenalex-snapshot
Natural Deduction for the Sheffer Stroke and Peirce’s Arrow (and any Other Truth-Functional Connective)
inferred← citeshttps://doi.org/10.1007/s11225-014-9570-3openalex-snapshot
Strong Reduction of Combinatory Calculus with Streams
inferred← citeshttps://doi.org/10.1007/s11225-015-9616-1openalex-snapshot
Reduction Rules for Intuitionistic $${{\lambda}{\rho}}$$ λ ρ -calculus
inferred← citeshttps://doi.org/10.1007/s11225-016-9673-0openalex-snapshot
Compositional Z: Confluence Proofs for Permutative Conversion
inferred← citeshttps://doi.org/10.1007/s11225-020-09931-0openalex-snapshot
Confluence Proofs of Lambda-Mu-Calculi by Z Theorem
inferred← citeshttps://doi.org/10.1007/s11225-024-10163-9openalex-snapshot
From Proof-Theoretic Validity to Base-Extension Semantics for Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.1007/s11787-014-0098-0openalex-snapshot
Hypothetical Logic of Proofs
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90146-5openalex-snapshot
Full intuitionistic linear logic (extended abstract)11Presented at the 9th International Congress of Logic, Methodology and Philosophy of Science held in Uppsala, Sweden, August 7-14, 1991.
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90047-7openalex-snapshot
Classical logic, storage operators and second-order lambda-calculus
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00004-zopenalex-snapshot
A strong normalization result for classical logic
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90081-7openalex-snapshot
A general storage theorem for integers in call-by-name λ-calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.006openalex-snapshot
Uniform Heyting arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.009openalex-snapshot
Non-strictly positive fixed points for classical natural deduction
inferred← citeshttps://doi.org/10.1016/j.apal.2004.11.002openalex-snapshot
Polarized and focalized linear and classical proofs
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.008openalex-snapshot
Second-order type isomorphisms through game semantics
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.2008.01.003openalex-snapshot
Strong normalization of classical natural deduction with disjunctions
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.005openalex-snapshot
Classical Fω , orthogonality and symmetric candidates
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.2005.01.034openalex-snapshot
A Rewriting Calculus for Cyclic Higher-order Term Graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.010openalex-snapshot
Intersection and Union Types in the λ¯μμ˜ -calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.020openalex-snapshot
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.026openalex-snapshot
A Semantics of Realisability for the Classical Propositional Natural Deduction
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.055openalex-snapshot
A Concurrent Model for Linear Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.071openalex-snapshot
Practical Program Extraction from Classical Proofs
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.2008.12.072openalex-snapshot
Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.031openalex-snapshot
Intuitionistic Letcc via Labelled Deduction
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.088openalex-snapshot
Game Semantics for Access Control
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.001openalex-snapshot
Continuation Models for the Lambda Calculus With Constructors
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.004openalex-snapshot
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus
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.2018.03.015openalex-snapshot
Proving Soundness of Extensional Normal-Form Bisimilarities
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.004openalex-snapshot
Strong normalisation in the π-calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.002openalex-snapshot
Strong normalization of the second-order symmetric λμ-calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.008openalex-snapshot
Resource operators for λ-calculus
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.03.009openalex-snapshot
Strong normalization proofs by CPS-translations
inferred← citeshttps://doi.org/10.1016/j.jpaa.2005.03.016openalex-snapshot
Order-enriched categorical models of the classical sequent calculus
inferred← citeshttps://doi.org/10.1016/j.jpaa.2012.03.020openalex-snapshot
Simple free star-autonomous categories and full coherence
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.006openalex-snapshot
Getting results from programs extracted from classical proofs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.04.009openalex-snapshot
Investigations on the Dual Calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.002openalex-snapshot
Categorical proof theory of classical propositional calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.026openalex-snapshot
Combining algebraic effects with continuations
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.028openalex-snapshot
A syntactic correspondence between context-sensitive calculi and abstract machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.028openalex-snapshot
The differential λμ -calculus
showing the first 200 of 477 · page through all 477
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.