On the public citation graph

Proving termination of normalization functions for conditional expressions

https://doi.org/10.1007/bf00246023
0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10009-1_14openalex-snapshot
An experiment with "Edinburgh LCF"
inferredcites →https://doi.org/10.1007/3-540-13346-1_10openalex-snapshot
Deriving structural induction in LCF
inferredcites →https://doi.org/10.1007/978-94-009-7019-9_8openalex-snapshot
Deductive Synthesis of the Unification Algorithm
inferredcites →https://doi.org/10.1007/bf02136027openalex-snapshot
Propositions and specifications of programs in Martin-Löf's type theory
inferredcites →https://doi.org/10.1016/0020-0190(79)90063-2openalex-snapshot
A mechanical proof of the termination of Takeuchi's function
inferredcites →https://doi.org/10.1016/0167-6423(85)90009-7openalex-snapshot
Verifying the unification algorithm in LCF
inferredcites →https://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferredcites →https://doi.org/10.1093/comjnl/28.5.474openalex-snapshot
Lessons learned from LCF: A Survey of Natural Deduction Proofs
inferredcites →https://doi.org/10.1145/800055.802035openalex-snapshot
A proposal for 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/10930755_17openalex-snapshot
Inductive Invariants for Nested Recursion
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_3openalex-snapshot
General Recursion in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_10openalex-snapshot
Nested General Recursion and Partiality in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_7openalex-snapshot
Type-Theoretic Functional Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_54openalex-snapshot
System Description: RDL Rewrite and Decision Procedure Laboratory
inferred← citeshttps://doi.org/10.1007/3-540-60343-3_33openalex-snapshot
Automated termination proofs with measure functions
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_3openalex-snapshot
Rewrite and Decision Procedure Laboratory: Combining Rewriting, Satisfiability Checking, and Lemma Speculation
inferred← citeshttps://doi.org/10.1007/bf01245632openalex-snapshot
Normalising the associative law: An experiment with Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1007/bfb0055132openalex-snapshot
Classical propositional decidability via Nuprl proof extraction
inferred← citeshttps://doi.org/10.1007/bfb0105417openalex-snapshot
Function definition in higher-order logic
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90063-9openalex-snapshot
On proving the termination of algorithms by machine
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90058-lopenalex-snapshot
Comparing integrated and external logics of functional programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00145-4openalex-snapshot
Representing inductively defined sets by wellorderings in Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80007-6openalex-snapshot
Synthesis of ML programs in the system Coq
inferred← citeshttps://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferred← citeshttps://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferred← citeshttps://doi.org/10.1017/s0960129505004822openalex-snapshot
Modelling general recursion in type theory
inferred← citeshttps://doi.org/10.1023/a:1005797629953openalex-snapshot
Termination of Nested and Mutually Recursive Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9301102openalex-snapshot
Constructing Recursion Operators in Intuitionistic Type Theory
inferred← citeshttps://doi.org/10.6083/k643b156mopenalex-snapshot
Proving program termination in higher order logic
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.