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 (only showing first 100 items - show all)
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
This page was built for publication: Initial Algebra Semantics and Continuous Algebras
