On the public citation graph
Strict functionals for termination proofs
0 signed · 46 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-58233-9_14openalex-snapshot
Termination proofs for higher-order rewrite systems
inferredcites →https://doi.org/10.1007/bfb0037114openalex-snapshot
Orthogonal higher-order rewrite systems are confluent
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7019-9openalex-snapshot
Constructivism in Mathematics - An Introduction
inferredcites →https://doi.org/10.2307/2274839openalex-snapshot
Jean-Yves Girard. Proof theory and logical complexity. Volume I. Studies in proof theory, no. 1. Bibliopolis, Naples 1987, also distributed by Humanities Press, Atlantic Highlands, N.J., 503 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2750openalex-snapshot
Perpetual Reductions inλ-Calculus
inferred← citeshttps://doi.org/10.1007/10721975_4openalex-snapshot
Termination and Confluence of Higher-Order Rewrite Systems
inferred← citeshttps://doi.org/10.1007/11494645_4openalex-snapshot
Continuous Semantics for Strong Normalization
inferred← citeshttps://doi.org/10.1007/11805618_29openalex-snapshot
Higher-Order Orderings for Normal Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_37openalex-snapshot
A Monotonic Higher-Order Semantic Path Ordering
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_32openalex-snapshot
Termination and Reduction Checking for Higher-Order Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_44openalex-snapshot
Mode and termination checking for higher-order logic programs
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_22openalex-snapshot
The variable containment problem
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_27openalex-snapshot
Two different strong normalization proofs?
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_46openalex-snapshot
A recursive path ordering for higher-order terms in η-long β-normal form
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_48openalex-snapshot
Weak and strong beta normalisations in typed λ-calculi
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_54openalex-snapshot
Upper bounds for standardizations and an application
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_1openalex-snapshot
The Computability Path Ordering: The End of a Quest
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_2openalex-snapshot
Proof Theory at Work: Program Development in the Minlog System
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_11openalex-snapshot
From Higher Order Terms To Circuits
inferred← citeshttps://doi.org/10.1007/bfb0029968openalex-snapshot
Simulation as a correct transformation of rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0055142openalex-snapshot
An LPO-based termination ordering for higher-order terms without λ-abstraction
inferred← citeshttps://doi.org/10.1007/s001530050075openalex-snapshot
A proof of strongly uniform termination for Gödel's $T$ by methods from local predicativity
inferred← citeshttps://doi.org/10.1007/s10817-005-6534-3openalex-snapshot
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
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/s0049-237x(06)80004-2openalex-snapshot
Simply typed λ-calculus
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80005-4openalex-snapshot
The Curry-Howard isomorphism
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00372-8openalex-snapshot
On the longest perpetual reductions in orthogonal expression reduction systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferred← citeshttps://doi.org/10.1017/s0956796802004641openalex-snapshot
Termination of rewriting in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1017/s0960129506005457openalex-snapshot
Continuous semantics for strong normalisation
inferred← citeshttps://doi.org/10.1023/a:1020831825964openalex-snapshot
Tarski's Fixed-Point Theorem And Lambda Calculi With Monotone Inductive Types
inferred← citeshttps://doi.org/10.1023/a:1026459821186openalex-snapshot
Monotone Majorizable Functionals
inferred← citeshttps://doi.org/10.1109/lics.1995.523266openalex-snapshot
New notions of reduction and non-semantic proofs of strong β-normalization in typed λ-calculi
inferred← citeshttps://doi.org/10.1109/lics.1999.782635openalex-snapshot
The higher-order recursive path ordering
inferred← citeshttps://doi.org/10.1145/1206035.1206037openalex-snapshot
Polymorphic higher-order recursive path orderings
inferred← citeshttps://doi.org/10.1184/r1/6480182openalex-snapshot
Upper bounds for standardisations and an application
inferred← citeshttps://doi.org/10.1184/r1/6610310openalex-snapshot
Termination and Reduction Checking in the Logical Framework
inferred← citeshttps://doi.org/10.2168/lmcs-1(2:3)2005openalex-snapshot
Strong normalisation for applied lambda calculi
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:10)2012openalex-snapshot
Dynamic Dependency Pairs for Algebraic Functional Systems
inferred← citeshttps://doi.org/10.2307/2586765openalex-snapshot
Upper bounds for standardizations and an application
inferred← citeshttps://doi.org/10.70675/1aceeb9azede6z4f94z9967z189737f4f5a5openalex-snapshot
Size-based termination : semantics and generalizations
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.