On the public citation graph
Typed λ-calculi with explicit substitutions may not terminate
0 signed · 118 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-55808-x_19openalex-snapshot
Strong normalization of substitutions
inferredcites →https://doi.org/10.1007/3-540-56393-8_12openalex-snapshot
Termination of term rewriting by interpretation
inferredcites →https://doi.org/10.1016/0304-3975(86)90035-6openalex-snapshot
Proof of termination of the rewriting system subst on CCL
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11601548_23openalex-snapshot
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem
inferred← citeshttps://doi.org/10.1007/11874683_1openalex-snapshot
Functorial Boxes in String Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_10openalex-snapshot
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_2openalex-snapshot
Programming and Computing in HOL
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_23openalex-snapshot
A simply typed context calculus with first-class environments
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_13openalex-snapshot
Reductions, intersection types, and explicit substitutions
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-45995-2_33openalex-snapshot
Characterising Strong Normalisation for Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_5openalex-snapshot
Proof Nets and Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_14openalex-snapshot
Explicit Substitutions and Programming Languages
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_15openalex-snapshot
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_16openalex-snapshot
Closed Reductions in the λ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_23openalex-snapshot
Characterising Explicit Substitutions which Preserve Termination
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_65openalex-snapshot
Explicit substitutions with de bruijn's levels
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_52openalex-snapshot
Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_37openalex-snapshot
The lambda calculus as an abstract data type
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_19openalex-snapshot
λ-calculi with explicit substitutions and composition which preserve β-strong normalization
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_98openalex-snapshot
Generalized β-reduction and explicit substitutions
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_182openalex-snapshot
On explicit substitutions and names (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_42openalex-snapshot
An Improved System of Intersection Types for Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_3openalex-snapshot
Proof Nets and the Linear Substitution Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_7openalex-snapshot
Semantics and Syntax, Between Computer Science and Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_11openalex-snapshot
Unification for $$\lambda $$ -calculi Without Propagation Rules
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_18openalex-snapshot
A Direct Proof of Strong Normalization for an Extended Herbelin’s 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-45220-1_15openalex-snapshot
Strong Normalization of the Typed λ ws -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_60openalex-snapshot
Principal Typings for Explicit Substitutions Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_26openalex-snapshot
Perpetuality for Full and Safe Composition (in a Constructive Setting)
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_27openalex-snapshot
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
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-74915-8_20openalex-snapshot
The Theory of Calculi with Explicit Substitutions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_40openalex-snapshot
The Prismoid of Resources
inferred← citeshttps://doi.org/10.1007/978-3-642-13824-9_19openalex-snapshot
Intersection Type Systems and Explicit Substitutions Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_1openalex-snapshot
Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-44471-9_15openalex-snapshot
Towards a Substrate Framework of Computation
inferred← citeshttps://doi.org/10.1007/978-94-007-6600-6_2openalex-snapshot
Nominal Terms and Nominal Logics: From Foundations to Meta-mathematics
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_3openalex-snapshot
Interactive and Automated Proof Construction in Type Theory
inferred← citeshttps://doi.org/10.1007/bf02946499openalex-snapshot
Explicit substitutions: A short survey
inferred← citeshttps://doi.org/10.1007/bfb0014545openalex-snapshot
Strong normalisation in higher-order action calculi
inferred← citeshttps://doi.org/10.1007/bfb0026813openalex-snapshot
A λ-calculus à la de Bruijn with explicit substitutions
inferred← citeshttps://doi.org/10.1007/bfb0054249openalex-snapshot
X.R.S: Explicit reduction systems — A first-order calculus for higher-order calculi
inferred← citeshttps://doi.org/10.1007/bfb0055098openalex-snapshot
Explicit substitutitions for constructive necessity
inferred← citeshttps://doi.org/10.1007/bfb0056615openalex-snapshot
Explicit substitutions for objects and functions
inferred← citeshttps://doi.org/10.1007/bfb0097790openalex-snapshot
A proof of weak termination of typed λσ-calculi
inferred← citeshttps://doi.org/10.1007/bfb0097798openalex-snapshot
Dependent types with explicit substitutions: A meta-theoretical development
inferred← citeshttps://doi.org/10.1007/s00200-005-0169-9openalex-snapshot
Lambda-Calculus with Director Strings
inferred← citeshttps://doi.org/10.1007/s10817-011-9222-5openalex-snapshot
On Explicit Substitution with Names
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103768openalex-snapshot
Mind the gap: A conciliating short proof of strong normalization for minimal propositional logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.03.004openalex-snapshot
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
inferred← citeshttps://doi.org/10.1016/j.ic.2003.09.004openalex-snapshot
Intersection types for explicit substitutions
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/j.tcs.2004.10.019openalex-snapshot
Normalisation for higher-order calculi with explicit substitutions
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.026openalex-snapshot
A prismoid framework for languages with resources
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00183-7openalex-snapshot
Explicit substitution on the edge of strong normalization
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/s1571-0661(04)80539-5openalex-snapshot
The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations
inferred← citeshttps://doi.org/10.1017/s0956796800001945openalex-snapshot
λν, a calculus of explicit substitutions which preserves strong normalisation
inferred← citeshttps://doi.org/10.1017/s0956796800003695openalex-snapshot
The λ s e -calculus does not preserve strong normalisation
inferred← citeshttps://doi.org/10.1017/s0956796819000017openalex-snapshot
The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus
inferred← citeshttps://doi.org/10.1017/s0956796897002785openalex-snapshot
Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms
inferred← citeshttps://doi.org/10.1017/s0960129500003224openalex-snapshot
A λ-calculus with explicit weakening and explicit substitution
inferred← citeshttps://doi.org/10.1017/s0960129500003236openalex-snapshot
HOL-λσ: an intentional first-order expression of higher-order logic
inferred← citeshttps://doi.org/10.1017/s0960129500003248openalex-snapshot
Perpetuality in a named lambda calculus with explicit substitutions
inferred← citeshttps://doi.org/10.1017/s0960129500003261openalex-snapshot
Dependent types and explicit substitutions: a meta-theoretical development
inferred← citeshttps://doi.org/10.1017/s0960129502003791openalex-snapshot
Proof nets and explicit substitutions
inferred← citeshttps://doi.org/10.1017/s0960129502003821openalex-snapshot
Reductions, intersection types, and explicit substitutions
inferred← citeshttps://doi.org/10.1017/s0960129504004633openalex-snapshot
Closed reduction: explicit substitutions without $\alpha$-conversion
inferred← citeshttps://doi.org/10.1017/s0960129598002667openalex-snapshot
An environment machine for the λμ-calculus
inferred← citeshttps://doi.org/10.1017/s0960129599002911openalex-snapshot
Sequent combinators: a Hilbert system for the lambda calculus
inferred← citeshttps://doi.org/10.1051/ita/2012028openalex-snapshot
Strong functors and interleaving fixpoints in game semantics
inferred← citeshttps://doi.org/10.1093/jigpal/6.6.843openalex-snapshot
Bridging de Bruijn indices and variable names in explicit substitutions calculi
inferred← citeshttps://doi.org/10.1093/jigpal/jzp027openalex-snapshot
Explicit substitutions calculi with one step Eta-reduction decided explicitly
inferred← citeshttps://doi.org/10.1093/jigpal/jzu044openalex-snapshot
Explicit substitution calculi with de Bruijn indices and intersection type systems
inferred← citeshttps://doi.org/10.1109/lics.1996.561460openalex-snapshot
Confluence and preservation of strong normalisation in an explicit substitutions calculus
inferred← citeshttps://doi.org/10.1109/lics.1997.614927openalex-snapshot
Strong normalization of explicit substitutions via cut elimination in proof nets
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/3622758openalex-snapshot
Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
inferred← citeshttps://doi.org/10.1145/3622758.3622884openalex-snapshot
Sharing a Perspective on the 𝜆-Calculus
inferred← citeshttps://doi.org/10.17863/cam.55080openalex-snapshot
Cartesian closed bicategories: type theory and coherence
inferred← citeshttps://doi.org/10.18725/oparu-3openalex-snapshot
Construction and deduction in type theories
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-8(1:28)2012openalex-snapshot
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
inferred← citeshttps://doi.org/10.3166/jancl.16.119-150openalex-snapshot
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★
inferred← citeshttps://doi.org/10.4204/eptcs.389.7openalex-snapshot
A Formalized Extension of the Substitution Lemma in Coq
inferred← citeshttps://doi.org/10.4204/eptcs.49.1openalex-snapshot
Swapping: a natural bridge between named and indexed explicit substitution calculi
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2020.28openalex-snapshot
Strongly Normalizing Higher-Order Relational Queries
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.391openalex-snapshot
Metaconfluence of Calculi with Explicit Substitutions at a Distance
inferred← citeshttps://doi.org/10.4230/lipics.rta.2012.22openalex-snapshot
On the Invariance of the Unitary Cost Model for Head Reduction
inferred← citeshttps://doi.org/10.4230/lipics.rta.2012.6openalex-snapshot
An Abstract Factorization Theorem for Explicit Substitutions
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:23)2023openalex-snapshot
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3668openalex-snapshot
Linear lambda Calculus with Explicit Substitutions as Proof-Search in Deep Inference
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1641openalex-snapshot
On the Invariance of the Unitary Cost Model for Head Reduction (Long Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03395openalex-snapshot
Proof Nets and the Linear Substitution Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05161openalex-snapshot
An Interactive Proof of Termination for a Concurrent $λ$-calculus with References and Explicit Substitutions
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702027openalex-snapshot
The Suspension Calculus and its Relationship to Other Explicit Treatments of Substitution in Lambda Calculi
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702152openalex-snapshot
A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi
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.