On the public citation graph

An order-algebraic definition of knuthian semantics

0 signed · 83 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/bf01692511openalex-snapshot

Semantics of context-free languages

inferredcites →https://doi.org/10.1007/bf01702865openalex-snapshot

Semantics of context-free languages: Correction

inferredcites →https://doi.org/10.1007/bf02485815openalex-snapshot

Chain-complete posets and directed sets with applications

inferredcites →https://doi.org/10.1007/bfb0059699openalex-snapshot

Examples of formal semantics

inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot

Denotational semantics: The scott-strachey approach to programming language theory

inferredcites →https://doi.org/10.1016/s0019-9958(69)90312-xopenalex-snapshot

Property grammars and table machines

inferredcites →https://doi.org/10.1016/s0021-9800(70)80014-xopenalex-snapshot

Heterogeneous algebras

inferredcites →https://doi.org/10.1016/s0022-0000(74)80045-0openalex-snapshot

Attributed translations

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

An algebraic formulation of knuthian semantics

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

Initial algebra semantics

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

Mathematical concepts in programming language semantics

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

Initial Algebra Semantics and Continuous Algebras

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

Semantic evaluation from left to right

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

The intrinsically exponential complexity of the circularity problem for attribute grammars

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

Recursively defined data types

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

Correctness-preserving program transformations

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

On syntax-directed transduction and tree transducers

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

Automatic generation of efficient evaluators for attribute grammars

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

Semantic attributes and improvement of generated code

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.4690270904openalex-snapshot

On Generalization of Attribute Grammars

inferred← citeshttps://doi.org/10.1007/10704567_22openalex-snapshot

Declarative Program Transformation: A Deforestation Case-Study

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

Attribute grammars : Theory and applications

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

An algebraic definition of attributed transformations

inferred← citeshttps://doi.org/10.1007/3-540-18317-5_10openalex-snapshot

Attribute grammars as a functional programming paradigm

inferred← citeshttps://doi.org/10.1007/3-540-18625-5_65openalex-snapshot

Program development using lambda abstraction

inferred← citeshttps://doi.org/10.1007/3-540-46002-0_11openalex-snapshot

A Functional Semantics of Attribute Grammars

inferred← citeshttps://doi.org/10.1007/3-540-50820-1_51openalex-snapshot

Compiling typol with attribute grammars

inferred← citeshttps://doi.org/10.1007/3-540-53101-7_11openalex-snapshot

Abstract interpretation using attribute grammars

inferred← citeshttps://doi.org/10.1007/3-540-55844-6_133openalex-snapshot

Strictness analysis for attribute grammars

inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_23openalex-snapshot

Attribute Grammars and Categorical Semantics

inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_11openalex-snapshot

Formalising and Verifying Reference Attribute Grammars in Coq

inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_23openalex-snapshot

Monadic Datalog Tree Transducers

inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_16openalex-snapshot

Categorical Descriptional Composition

inferred← citeshttps://doi.org/10.1007/978-3-642-51709-9_5openalex-snapshot

Anhang

inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_4openalex-snapshot

Aspects of Classical Language Theory

inferred← citeshttps://doi.org/10.1007/978-3-7091-9437-9_14openalex-snapshot

Proving the Correctness of Formal User Interface Specifications

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

Iteration of transformation passes over attributed program trees

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

Semantics of algorithmic languages

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

Context-free hypergraph grammars have the same term-generating power as attribute grammars

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

Attribute and unification grammar: A review and analysis of formalisms

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

High level tree transducers and iterated pushdown tree transducers

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

Characterization of high level tree transducers

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

A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers

inferred← citeshttps://doi.org/10.1016/0022-0000(85)90066-2openalex-snapshot

Macro tree transducers

inferred← citeshttps://doi.org/10.1016/0167-6423(85)90005-xopenalex-snapshot

A general incremental evaluator for attrbiute grammars

inferred← citeshttps://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot

Attribute grammars and recursive program schemes I

inferred← citeshttps://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot

Attribute grammars and recursive program schemes II

inferred← citeshttps://doi.org/10.1016/0304-3975(86)90006-xopenalex-snapshot

Two-level semantics and code generation

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

Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars

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

Pushdown machines for the macro tree transducer

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

Tree transducers with external functions

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90337-sopenalex-snapshot

Attributed tree grammars

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

Operational and denotational semantics of prolog

inferred← citeshttps://doi.org/10.1016/0890-5401(88)90002-8openalex-snapshot

Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming

inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.015openalex-snapshot

Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.007openalex-snapshot

Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90786-0openalex-snapshot

On the equivalence problem for attribute systems

inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80021-7openalex-snapshot

Tree automata and attribute grammars

inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80043-2openalex-snapshot

Machines for attribute grammars

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00079-3openalex-snapshot

Systematic debugging method for attribute grammar description

inferred← citeshttps://doi.org/10.1017/s0960129508007184openalex-snapshot

On traced monoidal closed categories

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

Can we transform logic programs into attribute grammars ?

inferred← citeshttps://doi.org/10.1109/cmpsac.1988.17176openalex-snapshot

Finding program slices for recursive procedures

inferred← citeshttps://doi.org/10.1109/hicss.1989.47158openalex-snapshot

A dedicated data flow architecture for hardware compilation

inferred← citeshttps://doi.org/10.1109/sfcs.1980.31openalex-snapshot

On the expressive power of attribute grammars

inferred← citeshttps://doi.org/10.1109/sfcs.1985.23openalex-snapshot

Equivalences and transformations of recursive definitions

inferred← citeshttps://doi.org/10.1137/0210037openalex-snapshot

Attribute Grammars and Mathematical Semantics

inferred← citeshttps://doi.org/10.1145/12276.13320openalex-snapshot

Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars

inferred← citeshttps://doi.org/10.1145/13310.13320openalex-snapshot

Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars

inferred← citeshttps://doi.org/10.1145/210376.197409openalex-snapshot

Attribute grammar paradigms—a high-level methodology in language implementation

inferred← citeshttps://doi.org/10.1145/2543728.2543745openalex-snapshot

Generating attribute grammar-based bidirectional transformations from rewrite rules

inferred← citeshttps://doi.org/10.1145/2660193.2660237openalex-snapshot

From object algebras to attribute grammars

inferred← citeshttps://doi.org/10.1145/2714064.2660237openalex-snapshot

From object algebras to attribute grammars

inferred← citeshttps://doi.org/10.1145/2835260.2835261openalex-snapshot

Active workspaces

inferred← citeshttps://doi.org/10.1145/349214.349219openalex-snapshot

Generation of LR parsers by partial evaluation

inferred← citeshttps://doi.org/10.1145/502874.502882openalex-snapshot

Strongly non-circular attribute grammars and their recursive evaluation

inferred← citeshttps://doi.org/10.1145/502949.502882openalex-snapshot

Strongly non-circular attribute grammars and their recursive evaluation

inferred← citeshttps://doi.org/10.1145/5397.30847openalex-snapshot

Toward compiler implementation correctness proofs

inferred← citeshttps://doi.org/10.1145/567532.567552openalex-snapshot

Verification of attribute grammar

inferred← citeshttps://doi.org/10.1145/75277.75281openalex-snapshot

Resolving circularity in attribute grammars with applications to data flow analysis (preliminary version)

inferred← citeshttps://doi.org/10.1147/rd.303.0294openalex-snapshot

Compiling circular attribute grammars into Prolog

inferred← citeshttps://doi.org/10.3233/fi-1994-2042openalex-snapshot

TOP-DOWN PARSING WITH SIMULTANEOUS EVALUATION OF NONCIRCULAR ATTRIBUTE GRAMMARS

inferred← citeshttps://doi.org/10.48550/arxiv.1405.3223openalex-snapshot

A Grammatical Approach to Data-centric Case Management in a Distributed Collaborative Environment

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.