Initial Algebra Semantics and Continuous Algebras

Cited in

(only showing first 100 items - show all)

A Mezei-Wright theorem for categorical algebras
An extension to trees of the Sardinas and Patterson algorithm
A view of computability on term algebras
An algebraic approach to the syntax and semantics of languages with subscripted variables
Algebraic domain equations
Fundamental properties of infinite trees
Axiomatising finite delay operators
Algebraic relations and presentations
Order completion monads
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
Macro tree transducers
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
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
Full abstraction and limiting completeness in equational languages
Unification theory
Algebraic translations, correctness and algebraic compiler construction
Polymorphic syntax definition
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
More on advice on structuring compilers and proving them correct
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
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
Conditional rewriting logic as a unified model of concurrency
Tree transducers with external functions
IO and OI. I
IO and OI. II
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
Three efficient algorithms for counting problems
Term-rewriting systems with rule priorities
Group axioms for iteration
A general theory of action languages
Attributed tree grammars
On a generalized product for domains
Constructing specification morphisms
Synthesized and inherited functions. A new computational model for syntax-directed semantics
Testing equivalences for processes
Attribute and unification grammar: A review and analysis of formalisms
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
The equational logic of fixed points
A semantic theory for value-passing processes based on the late approach
Infinite trees and completely iterative theories: A coalgebraic view
A hidden agenda
Detecting equivalence of modular specifications with categorical diagrams
A unified language processing methodology
A coinductive completeness proof for the equivalence of recursive types
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
A unifying theorem for algebraic semantics and dynamic logics
Equational logic of circular data type specification
On equational theories, unification, and (un)decidability

This page was built for publication: Initial Algebra Semantics and Continuous Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131619)