On the public citation graph

Formal computations of non deterministic recursive program schemes

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.

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-07162-8_694openalex-snapshot

Proving programs by sets of computations

inferredcites →https://doi.org/10.1007/3-540-08342-1_32openalex-snapshot

On backtracking and greatest fixpoints

inferredcites →https://doi.org/10.1007/3-540-08442-8_65openalex-snapshot

Non deterministic recursive program schemes

inferredcites →https://doi.org/10.1007/3-540-08860-1_19openalex-snapshot

Semantics and correctness of nondeterministic flowchart programs with recursive procedures

inferredcites →https://doi.org/10.1007/978-3-662-43948-7openalex-snapshot

Automata, Languages, and Programming

inferredcites →https://doi.org/10.1016/0004-3702(70)90002-0openalex-snapshot

The correctness of nondeterministic programs

inferredcites →https://doi.org/10.1016/0022-0000(78)90048-xopenalex-snapshot

Power domains

inferredcites →https://doi.org/10.1016/0022-0000(78)90051-xopenalex-snapshot

IO and OI. II

inferredcites →https://doi.org/10.1016/s0022-0000(77)80034-2openalex-snapshot

IO and OI. I

inferredcites →https://doi.org/10.1051/ita/1977110403111openalex-snapshot

Mots infinis engendrés par une grammaire algébrique

inferredcites →https://doi.org/10.1109/sfcs.1976.3openalex-snapshot

Algebraic families of interpretations

inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot

Grammars with macro-like productions

inferredcites →https://doi.org/10.1137/0205035openalex-snapshot

A Powerdomain Construction

inferredcites →https://doi.org/10.1145/321420.321422openalex-snapshot

Nondeterministic Algorithms

inferredcites →https://doi.org/10.1145/512760.512782openalex-snapshot

Nondeterminism in logics of programs

inferredcites →https://doi.org/10.3233/fi-1980-3405openalex-snapshot

The metric space of infinite trees. Algebraic and topological properties

inferredcites →https://doi.org/10.7146/dpb.v4i47.6466openalex-snapshot

IO and OI

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.2001.2890openalex-snapshot

Context-Free Series on Trees

inferred← citeshttps://doi.org/10.1007/3-540-10699-5_118openalex-snapshot

Using least fixed points to characterize formal computations of non-deterministic equations

inferred← citeshttps://doi.org/10.1007/3-540-10828-9_60openalex-snapshot

Une semantique pour les arbres non deterministes

inferred← citeshttps://doi.org/10.1007/3-540-10828-9_74openalex-snapshot

Differents types de derivations infinies dans les grammaires algebriques d'arbres

inferred← citeshttps://doi.org/10.1007/3-540-10854-8_33openalex-snapshot

Context-free languages of infinite words as least fixpoints

inferred← citeshttps://doi.org/10.1007/3-540-11494-7_21openalex-snapshot

On effective computations of non-deterministic schemes

inferred← citeshttps://doi.org/10.1007/3-540-51486-4_91openalex-snapshot

Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets

inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot

The expressive power of indeterminate primitives in asynchronous computation

inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_14openalex-snapshot

An Order Semantics for Non-Deterministic Recursive Program Schemes

inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot

Semantics of algorithmic languages

inferred← citeshttps://doi.org/10.1007/bf01744582openalex-snapshot

Pushdown tree automata

inferred← citeshttps://doi.org/10.1007/bfb0036489openalex-snapshot

On algebras of computation sequences and proofs of equivalence of operational and denotational semantics

inferred← citeshttps://doi.org/10.1007/bfb0052372openalex-snapshot

Co-definite set constraints

inferred← citeshttps://doi.org/10.1016/0020-0190(84)90068-1openalex-snapshot

Infinitary tree languages recognized by ω-automata

inferred← citeshttps://doi.org/10.1016/0021-8693(84)90035-8openalex-snapshot

Iterative and recursive matrix theories

inferred← citeshttps://doi.org/10.1016/0304-3975(80)90045-6openalex-snapshot

Metric interpretations of infinite trees and semantics of non deterministic recursive programs

inferred← citeshttps://doi.org/10.1016/0304-3975(84)90027-6openalex-snapshot

Distributive semantics for nondeterministic typed λ-calculi

inferred← citeshttps://doi.org/10.1016/0304-3975(86)90183-0openalex-snapshot

Variétés d'automates descendants d'arbres infinis

inferred← citeshttps://doi.org/10.1016/0304-3975(91)90023-uopenalex-snapshot

The complexity of computing the number of strings of given length in context-free languages

inferred← citeshttps://doi.org/10.1016/0743-1066(87)90013-6openalex-snapshot

A program transformation from equational programs into logic programs

inferred← citeshttps://doi.org/10.1016/0890-5401(89)90046-1openalex-snapshot

Automata on infinite objects and their applications to logic and programming

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot

Automata on Infinite Objects

inferred← citeshttps://doi.org/10.1016/j.ic.2019.104454openalex-snapshot

Linear context-free tree languages and inverse homomorphisms

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot

Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00004-xopenalex-snapshot

Une brève biographie scientifique de Maurice Nivat

inferred← citeshttps://doi.org/10.1016/s0304-3975(06)80002-2openalex-snapshot

Algebraic and fixed point equations over inverse limits of algebras

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80168-9openalex-snapshot

Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)

inferred← citeshttps://doi.org/10.1051/ita/1987210100591openalex-snapshot

Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes

inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.496openalex-snapshot

A Category Theoretic View of Nondeterministic Recursive Program Schemes

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.