On the public citation graph
Terminating general recursion
0 signed · 61 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-12689-9_125openalex-snapshot
The identification of propositions and types in Martin-Löf's type theory: A programming example
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/s0049-237x(08)71120-0openalex-snapshot
An Introduction to Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferredcites →https://doi.org/10.48456/tr-82openalex-snapshot
Natural deduction proof as higher-order resolution
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.1994.1034openalex-snapshot
An Analysis of Ramsey′s Theorem
inferred← citeshttps://doi.org/10.1007/11556985_12openalex-snapshot
On Recursive Functions and Well–Founded Relations in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/11737414_9openalex-snapshot
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
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-39185-1_9openalex-snapshot
A Unifying Approach to Recursive and Co-recursive Definitions
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_1openalex-snapshot
Fix-Point Equations for Well-Founded Recursion in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_31openalex-snapshot
Another Look at Nested Recursion
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-45699-6_1openalex-snapshot
An Introduction to Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-60156-2_5openalex-snapshot
Planning a proof of the intermediate value theorem
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_18openalex-snapshot
Constructing and Refining Modules in a Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_8openalex-snapshot
Some Remarks About Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-29473-5_8openalex-snapshot
A Mechanized Textbook Proof of a Type Unification Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_11openalex-snapshot
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_26openalex-snapshot
On the Representation of Imperative Programs in a Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_14openalex-snapshot
Using Structural Recursion for Corecursion
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_15openalex-snapshot
The Optimal Fixed Point Combinator
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_11openalex-snapshot
A Decision Procedure for Regular Expression Equivalence in Type Theory
inferred← citeshttps://doi.org/10.1007/bf00881916openalex-snapshot
Set theory for verification. II: Induction and recursion
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/bf01887204openalex-snapshot
Program development in the constructive set theory TK
inferred← citeshttps://doi.org/10.1007/bfb0105417openalex-snapshot
Function definition in higher-order logic
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/0304-3975(92)90037-gopenalex-snapshot
Program development in constructive type theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.018openalex-snapshot
Inductive and Coinductive Components of Corecursive Functions in Coq
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.09.002openalex-snapshot
Certified CYK parsing of context-free languages
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.12.003openalex-snapshot
Formal derivation of Greedy algorithms from relational specifications: A tutorial
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.1017/s0956796809007345openalex-snapshot
Algebra of programming in Agda: Dependent types for relational program derivation
inferred← citeshttps://doi.org/10.1017/s0960129505004822openalex-snapshot
Modelling general recursion in type theory
inferred← citeshttps://doi.org/10.1017/s0960129506005809openalex-snapshot
Affine functions and series with co-inductive real numbers
inferred← citeshttps://doi.org/10.1017/s0960129514000115openalex-snapshot
Partiality and recursion in interactive theorem provers – an overview
inferred← citeshttps://doi.org/10.1023/a:1008763422061openalex-snapshot
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm
inferred← citeshttps://doi.org/10.1109/kbse.1995.490133openalex-snapshot
Towards high-level deductive program synthesis based on type theory
inferred← citeshttps://doi.org/10.1142/9781848164581_0005openalex-snapshot
Curry–Howard Correspondence
inferred← citeshttps://doi.org/10.1145/1292597.1292601openalex-snapshot
A coinductive monad for prop-bounded recursion
inferred← citeshttps://doi.org/10.1145/1389449.1389461openalex-snapshot
Fixed point semantics and partial recursion in Coq
inferred← citeshttps://doi.org/10.1145/3110277openalex-snapshot
Normalization by evaluation for sized dependent types
inferred← citeshttps://doi.org/10.1145/3497775.3503671openalex-snapshot
On homotopy of walks and spherical maps in homotopy type theory
inferred← citeshttps://doi.org/10.1145/3652561.3652563openalex-snapshot
What's in a Bag?: An “Application Proving Interface” for Finite Bags and its Implementation
inferred← citeshttps://doi.org/10.1145/3696443.3708923openalex-snapshot
Honey Potion: An eBPF Backend for Elixir
inferred← citeshttps://doi.org/10.1145/3779031.3779091openalex-snapshot
A Rose Tree Is Blooming (Proof Pearl)
inferred← citeshttps://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferred← citeshttps://doi.org/10.2168/lmcs-12(2:7)2016openalex-snapshot
Formalized linear algebra over Elementary Divisor Rings in Coq
inferred← citeshttps://doi.org/10.22456/2175-2745.100968openalex-snapshot
A Mechanized Proof of a Textbook Type Unification Algorithm
inferred← citeshttps://doi.org/10.4204/eptcs.43.5openalex-snapshot
General Recursion and Formal Topology
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.56openalex-snapshot
A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610055openalex-snapshot
Extending the Calculus of Constructions with Tarski's fix-point theorem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9511102openalex-snapshot
Set Theory for Verification: II. Induction and Recursion
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.