On the public citation graph
Expression Reduction Systems and Extensions: An Overview
0 signed · 93 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.1998.2750openalex-snapshot
Perpetual Reductions inλ-Calculus
inferredcites →https://doi.org/10.1006/inco.2000.2888openalex-snapshot
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
inferredcites →https://doi.org/10.1007/10721975_5openalex-snapshot
A de Bruijn Notation for Higher-Order Rewriting
inferredcites →https://doi.org/10.1007/3-540-08531-9openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1007/3-540-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-19242-5openalex-snapshot
Conditional Term Rewriting Systems
inferredcites →https://doi.org/10.1007/3-540-19242-5_17openalex-snapshot
Confluent term rewriting systems with membership conditions
inferredcites →https://doi.org/10.1007/3-540-36576-1_10openalex-snapshot
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions
inferredcites →https://doi.org/10.1007/3-540-44881-0_33openalex-snapshot
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication)
inferredcites →https://doi.org/10.1007/3-540-44881-0_9openalex-snapshot
Expression Reduction Systems with Patterns
inferredcites →https://doi.org/10.1007/3-540-45127-7_6openalex-snapshot
From Higher-Order to First-Order Rewriting
inferredcites →https://doi.org/10.1007/3-540-45610-4_13openalex-snapshot
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
inferredcites →https://doi.org/10.1007/3-540-50667-5openalex-snapshot
Algebraic and Logic Programming
inferredcites →https://doi.org/10.1007/3-540-52335-9_51openalex-snapshot
β-Reductions and β-developments of λ-terms with the least number of steps
inferredcites →https://doi.org/10.1007/3-540-52885-7_84openalex-snapshot
Extensions to the rippling-out tactic for guiding inductive proofs
inferredcites →https://doi.org/10.1007/3-540-56393-8_3openalex-snapshot
Explicit cyclic substitutions
inferredcites →https://doi.org/10.1007/3-540-56868-9_14openalex-snapshot
Confluence and superdevelopments
inferredcites →https://doi.org/10.1007/3-540-56868-9_19openalex-snapshot
Optimal normalization in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56868-9_30openalex-snapshot
Polynomial time termination and constraint satisfaction tests
inferredcites →https://doi.org/10.1007/3-540-57785-8_139openalex-snapshot
Perpetuality and strong normalization in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-58140-5_20openalex-snapshot
The longest perpetual reductions in Orthogonal Expression Reduction Systems
inferredcites →https://doi.org/10.1007/3-540-58140-5_35openalex-snapshot
Weak orthogonality implies confluence: The higher-order case
inferredcites →https://doi.org/10.1007/3-540-61464-8_48openalex-snapshot
Higher-order narrowing with definitional trees
inferredcites →https://doi.org/10.1007/3-540-61464-8_51openalex-snapshot
Combinatory reduction systems with explicit substitution that preserve strong normalisation
inferredcites →https://doi.org/10.1007/3-540-61464-8_52openalex-snapshot
Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-61756-6openalex-snapshot
Programming Languages: Implementations, Logics, and Programs
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-3-540-92687-0openalex-snapshot
Logical Foundations of Computer Science
inferredcites →https://doi.org/10.1007/978-3-642-59309-3openalex-snapshot
Elements of Mathematics: Theory of Sets
inferredcites →https://doi.org/10.1007/978-3-662-21551-7_14openalex-snapshot
Confluence and superdevelopments
inferredcites →https://doi.org/10.1007/bfb0012855openalex-snapshot
Canonical conditional rewrite systems
inferredcites →https://doi.org/10.1007/bfb0013834openalex-snapshot
Eta-conversion for the languages of explicit substitutions
inferredcites →https://doi.org/10.1007/bfb0017469openalex-snapshot
Trees in Algebra and Programming — CAAP'94
inferredcites →https://doi.org/10.1007/bfb0017481openalex-snapshot
On higher order recursive program schemes
inferredcites →https://doi.org/10.1007/bfb0026813openalex-snapshot
A λ-calculus à la de Bruijn with explicit substitutions
inferredcites →https://doi.org/10.1007/bfb0027014openalex-snapshot
Perpetuality and uniform normalization
inferredcites →https://doi.org/10.1007/bfb0037114openalex-snapshot
Orthogonal higher-order rewrite systems are confluent
inferredcites →https://doi.org/10.1016/0010-4485(78)90044-1openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1016/0022-0000(86)90033-4openalex-snapshot
Conditional rewrite rules: Confluence and termination
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/0890-5401(87)90001-0openalex-snapshot
Needed reduction and spine strategies for the lambda calculus
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
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
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.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1016/j.tcs.2004.03.032openalex-snapshot
Pattern matching as cut elimination
inferredcites →https://doi.org/10.1016/j.tcs.2004.07.037openalex-snapshot
The conflict-free Reduction Geometry
inferredcites →https://doi.org/10.1016/s0304-3975(00)00372-8openalex-snapshot
On the longest perpetual reductions in orthogonal expression reduction systems
inferredcites →https://doi.org/10.1016/s0304-3975(01)00235-3openalex-snapshot
Relating conflict-free stable transition and event models via redex families
inferredcites →https://doi.org/10.1016/s0304-3975(98)00166-2openalex-snapshot
Confluence of extensional and non-extensional λ-calculi with explicit substitutions
inferredcites →https://doi.org/10.1016/s1385-7258(76)80001-7openalex-snapshot
Representability In Lambda Algebras
inferredcites →https://doi.org/10.1016/s1571-0661(04)80603-0openalex-snapshot
An Abstract Böhm-normalization
inferredcites →https://doi.org/10.1016/s1571-0661(05)80193-8openalex-snapshot
Context-sensitive Conditional Expression Reduction Systems
inferredcites →https://doi.org/10.1016/s1571-0661(05)82618-0openalex-snapshot
An Abstract Concept of Optimal Implementation
inferredcites →https://doi.org/10.1017/s0956796800001945openalex-snapshot
λν, a calculus of explicit substitutions which preserves strong normalisation
inferredcites →https://doi.org/10.1093/logcom/10.3.323openalex-snapshot
Stable results and relative normalization
inferredcites →https://doi.org/10.1093/logcom/10.3.461openalex-snapshot
Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones
inferredcites →https://doi.org/10.1093/logcom/exi050openalex-snapshot
Relating Higher-order and First-order Rewriting
inferredcites →https://doi.org/10.1093/logcom/exi051openalex-snapshot
de Bruijn Indices for Metaterms
inferredcites →https://doi.org/10.1093/oso/9780198537359.001.0001openalex-snapshot
Handbook of Logic in Computer Science
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1991.151659openalex-snapshot
A computation model for executable higher-order algebraic specification languages
inferredcites →https://doi.org/10.1109/lics.1995.523271openalex-snapshot
Higher-order unification via explicit substitutions
inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot
Report on the programming language Haskell
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/226643.226675openalex-snapshot
Confluence properties of weak and strong calculi of explicit substitutions
inferredcites →https://doi.org/10.1145/232627.232632openalex-snapshot
Functional back-ends within the lambda-sigma calculus
inferredcites →https://doi.org/10.1145/263699.263711openalex-snapshot
Call by need computations to root-stable form
inferredcites →https://doi.org/10.1145/99583.99618openalex-snapshot
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1515/gmj.1999.179openalex-snapshot
A N. Bourbaki Type General Theory and the Properties of Contracting Symbols and Corresponding Contracted Forms
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_32openalex-snapshot
Infinitary Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_54openalex-snapshot
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_21openalex-snapshot
Relating Nominal and Higher-Order Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.08.006openalex-snapshot
Pure Pattern Calculus à la de Bruijn
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.007openalex-snapshot
Infinitary Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.058openalex-snapshot
On the confluence of lambda-calculus with conditional rewriting
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.045openalex-snapshot
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
inferred← citeshttps://doi.org/10.1145/2103621.2103713openalex-snapshot
A unified approach to fully lazy sharing
inferred← citeshttps://doi.org/10.2168/lmcs-11(4:9)2015openalex-snapshot
From nominal to higher-order rewriting and back again
inferred← citeshttps://doi.org/10.70675/528a189dz6263z4b1dz95bdz158fff7ad77eopenalex-snapshot
Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage
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.