Initial Algebra Semantics and Continuous Algebras
From MaRDI portal
Publication:4131619
DOI10.1145/321992.321997zbMath0359.68018OpenAlexW2061786858MaRDI QIDQ4131619
Joseph A. Goguen, James W. Thatcher, Jesse B. Wright, Eric G. Wagner
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321992.321997
Related Items
A connection between concurrency and language theory, Continuation semantics for flowgraph equations, Structured algebraic specifications: A kernel language, On context-free trees, On the existence of free models in abstract algebraic institutions, On the implementation of abstract data types by programming language constructs, On observational equivalence and algebraic specification, Toward formal development of programs from algebraic specifications: Implementations revisited, An algebraic semantics approach to the effective resolution of type equations, On flowchart theories. I. The deterministic case, Crypt-equivalent algebraic specifications, Axiomatizing the equational theory of regular tree languages, Rewriting with a nondeterministic choice operator, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Algebraic solutions to recursion schemes, Composition and evaluation of attribute coupled grammars, On flowchart theories. II: The nondeterministic case, Equational specification of partial higher-order algebras, A guided tour of the mathematics of MetaSoft '88, Conditional rewrite rules: Confluence and termination, Contributions to the semantics of logic perpetual processes, Coalgebraic representations of distributive lattices with operators, Full abstraction and limiting completeness in equational languages, The rewriting logic semantics project, Unification theory, Algebraic translations, correctness and algebraic compiler construction, Polymorphic syntax definition, Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition, Final algebra semantics and data type extensions, The formal termination problem for programs with finite ALGOL 68-modes, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, A representation of trees by languages. II, Partially additive categories and flow-diagram semantics, Unique fixed points vs. least fixed points, Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I, On the algebra of order, Varieties of chain-complete algebras, Foundations of system theory: The Hankel matrix, Petri nets, event structures and domains. I, Una teoria algebrica per i guarded commands di Dijkstra, Parametrization for order-sorted algebraic specification, More on advice on structuring compilers and proving them correct, Combining data type and recursive process specifications using projection algebras, On correct refinement of programs, Recursion-closed algebraic theories, Complexity of algebraic implementations for abstract data types, DPDA's in 'Atomic normal form' and applications to equivalence problems, Tree constructions of free continuous algebras, Code selection by inversion of order-sorted derivors, Algebraic specification of concurrent systems, Hierarchical development of programming languages, The IO- and OI-hierarchies, Attribute grammars and recursive program schemes. I. II, Graph grammars and operational semantics, Regular trees and the free iterative theory, A continuous semantics for unbounded nondeterminism, On rational definitions in complete algebras without rank, Abstract data types and algebraic semantics of programming languages, The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, Semantics of order-sorted specifications, Domains for logic programming, Basic notions of universal algebra for language theory and graph grammars, Conditional rewriting logic as a unified model of concurrency, Modal logic and algebraic specifications, Tree transducers with external functions, Infinitary combinatory reduction systems, Determinization of weighted finite automata over strong bimonoids, IO and OI. I, IO and OI. II, An algebraically specified language for data directed design, List-arithmetic distributive categories: Locoi, Non-well-founded sets modeled as ideal fixed points, Expressive power of typed and type-free programming languages, A Mezei-Wright theorem for categorical algebras, An extension to trees of the Sardinas and Patterson algorithm, Algebras of iteration theories, Algebraic characterization of reducible flowcharts, Proofs by induction in equational theories with constructors, Grammatical unification, A view of computability on term algebras, Recursion and iteration in continuous theories: the M-construction, Iterative factor algebras and induced metrics, An algebraic approach to the syntax and semantics of languages with subscripted variables, Extensions of iterative congruences of free iterative algebras, Implementation of data types by algebraic methods, The insensitivity theorem for nonreducing reflexive types, Algebraic domain equations, Fundamental properties of infinite trees, Axiomatising finite delay operators, Algebraic relations and presentations, Order completion monads, Towards a programming language based on the notion of two-level grammar, A constructive method for abstract algebraic software specification, On the correspondence between two classes of reduction systems, Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories, Specification-oriented semantics for communicating processes, An effectively given initial semigroup, A uniform approach to inductive posets and inductive closure, Macro tree transducers, Termination, deadlock and divergence, Some quasi-varieties of iteration theories, Solving polynomial fixed point equations, A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices, Quasivarieties and varieties of ordered algebras: regularity and exactness, Equational properties of fixed-point operations in cartesian categories: An overview, Initial Algebras of Terms with Binding and Algebraic Structure, Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers, Towards Effects in Mathematical Operational Semantics, A declarative framework for object-oriented programming with genetic inheritance, RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA, Feferman on Computability, Coverability Synthesis in Parametric Petri Nets, Computing in unpredictable environments: Semantics, reduction strategies, and program transformations, Generic recursive lens combinators and their calculation laws, Crisp-determinization of weighted tree automata over strong bimonoids, Adding recursive constructs to bialgebraic semantics, My ADT Shrine, Term rewriting in CTΣ, Synthesized and inherited functions. A new computational model for syntax-directed semantics, Homomorphisms of heterogeneous algebras, Algebraic semantics and complexity of term rewriting systems, Relating two categorical models of term rewriting, Testing equivalences for processes, Consistency of formalized specifications in multilevel programming, Attribute and unification grammar: A review and analysis of formalisms, Kernel-LEAF: A logic plus functional language, Abstract language design, Algebra of constructions II: an algebraic approach to Martin-Löf type theory and the calculus of constructions, A domain equation for bisimulation, Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming, Specification and verification challenges for sequential object-oriented programs, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Unnamed Item, Unnamed Item, On the formalization of semantic conventions, A new approach to abstract data types, I Informal development, Unnamed Item, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, Convergence in infinitary term graph rewriting systems is simple, CPO models for infinite term rewriting, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Completeness of category-based equational deduction, The equational logic of fixed points, A Probabilistic Applied Pi–Calculus, Interpolation for predefined types, A semantic theory for value-passing processes based on the late approach, An Oxford survey of order sorted algebra, Infinite trees and completely iterative theories: A coalgebraic view, Decidable subcases of the equivalence problem for recursive program schemes, Unnamed Item, A generalization of the trie data structure, On the semantic equivalence of language syntax formalisms, Graph expressions and graph rewritings, On the semantics of parsing actions, Iteration Semirings, Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach, Closures in Binary Partial Algebras, Algebraic fusion of functions with an accumulating parameter and its improvement, On quasi-varieties of multiple valued logic models, A survey of strategies in rule-based program transformation systems, Unnamed Item, Unnamed Item, On multi-language abstraction. Towards a static analysis of multi-language programs, Unnamed Item, From Grammars and Automata to Algebras and Coalgebras, Unnamed Item, Unnamed Item, A Coalgebraic View of Infinite Trees and Iteration, Categorical rewriting of term-like structures, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, Infinite trees in normal form and recursive equations having a unique solution, The initial meadows, Higher order data types, A partial evaluator for the untyped lambda-calculus, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Algebraic correctness proofs for compiling recursive function definitions with strictness information, Linear context-free tree languages and inverse homomorphisms, A representation of trees by languages. I, Extended linear macro grammars, iteration grammars, and register programs, Pumping lemmas for term languages, On the algebraic structure of rooted trees, On some classes of interpretations, Data types, abstract data types and their specification problem, Fixed-point constructions in order-enriched categories, HOMOMORPHISMS IN THE THEORY OF MODELLING, Three efficient algorithms for counting problems, An order-algebraic definition of knuthian semantics, Term-rewriting systems with rule priorities, Weighted parsing for grammar-based language models over multioperator monoids, ALGEBRAIC LINEAR ORDERINGS, A categorical manifesto, Proving Infinitary Normalization, Final coalgebras in accessible categories, Algebraic specification of data types: A synthetic approach, A unifying theorem for algebraic semantics and dynamic logics, Equational logic of circular data type specification, On equational theories, unification, and (un)decidability, Group axioms for iteration, A general theory of action languages, A hidden agenda, On Iteratable Endofunctors, Approximation properties of abstract data types, Recursion induction principle revisited, Detecting equivalence of modular specifications with categorical diagrams, Formalization of universal algebra in Agda, A functorial semantics for multi-algebras and partial algebras, with applications to syntax., Attributed tree grammars, On a generalized product for domains, Meeting of the Association for Symbolic Logic Florence, Italy 1982, A unified language processing methodology, A coinductive completeness proof for the equivalence of recursive types, On the complexity of stream equality, Constructing specification morphisms
