On the public citation graph

Proving termination of GHC programs

https://doi.org/10.1007/bf03037949
0 signed · 37 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-16479-0_17openalex-snapshot
Guarded horn clauses
inferredcites →https://doi.org/10.1007/3-540-51081-8_103openalex-snapshot
Simulation of Turing machines by a left-linear rewrite rule
inferredcites →https://doi.org/10.1007/3-540-51081-8_138openalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferredcites →https://doi.org/10.1007/3-540-52837-7openalex-snapshot
Termination Proofs for Logic Programs
inferredcites →https://doi.org/10.1007/3-540-56944-8_54openalex-snapshot
Sequentialization of parallel logic programs with mode analysis
inferredcites →https://doi.org/10.1007/978-1-4471-3421-3_1openalex-snapshot
Rewriting Concepts in the Study of Termination of Logic Programs
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_17openalex-snapshot
On the Development of Reactive Systems
inferredcites →https://doi.org/10.1007/bf03037135openalex-snapshot
Unfolding rules for GHC programs
inferredcites →https://doi.org/10.1007/bf03038307openalex-snapshot
Moded flat GHC and its message-oriented implementation technique
inferredcites →https://doi.org/10.1007/bfb0013817openalex-snapshot
Termination of rewrite systems by elementary interpretations
inferredcites →https://doi.org/10.1007/bfb0023769openalex-snapshot
A transformational methodology for proving termination of logic programs
inferredcites →https://doi.org/10.1007/bfb0024661openalex-snapshot
Verification tools in the development of provably correct compilers
inferredcites →https://doi.org/10.1007/bfb0026579openalex-snapshot
I/O mode analysis in concurrent logic programming
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1145/567067.567078openalex-snapshot
Computer experiments with the REVE term rewriting system generator
inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferredcites →https://doi.org/10.1145/99583.99615openalex-snapshot
Communication with directed logic variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.0.co;2-xopenalex-snapshot
Declarative solutions to partitioned-grid problems
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.3.co;2-oopenalex-snapshot
Declarative solutions to partitioned‐grid problems
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_15openalex-snapshot
Proving Termination of Constraint Solver Programs
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_31openalex-snapshot
Incremental learning of logic programs
inferred← citeshttps://doi.org/10.1007/978-3-031-23495-8_7openalex-snapshot
A Framework of Runtime Monitoring for Correct Execution of Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_12openalex-snapshot
Characterisations of Termination in Logic Programming
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90004-3openalex-snapshot
A methodology for proving termination of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00021-2openalex-snapshot
A framework for incremental learning of logic programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00155-3openalex-snapshot
∃-Universal termination of logic programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00115-xopenalex-snapshot
On logic programs that do not fail
inferred← citeshttps://doi.org/10.1017/s1471068402001400openalex-snapshot
Classes of terminating logic programs
inferred← citeshttps://doi.org/10.1093/logcom/exp029openalex-snapshot
Property-based Slicing for Agent Verification
inferred← citeshttps://doi.org/10.1109/aamas.2004.252openalex-snapshot
State-Space Reduction Techniques in Agent Verification
inferred← citeshttps://doi.org/10.1109/cmpsac.2001.960664openalex-snapshot
CLPKIDS: a program analysis system for concurrent logic programs
inferred← citeshttps://doi.org/10.1109/csmr.1998.665796openalex-snapshot
A metrics suite for concurrent logic programs
inferred← citeshttps://doi.org/10.1109/icsm.2001.972786openalex-snapshot
A program dependence model for concurrent logic programs and its applications
inferred← citeshttps://doi.org/10.5281/zenodo.26321openalex-snapshot
Ergebnisse Der Von Franz Werner Und Otto V. Wettstein Auf Den Ägäischen Inseln Unternommenen Sammelreisen. Ameisen.
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.