Initial Algebra Semantics and Continuous Algebras

Cited In (only showing first 100 items - show all)

Solving polynomial fixed point equations
On equational theories, unification, and (un)decidability
On flowchart theories. I. The deterministic case
Crypt-equivalent algebraic specifications
Rewriting with a nondeterministic choice operator
Algebraic solutions to recursion schemes
On flowchart theories. II: The nondeterministic case
Pumping lemmas for term languages
On the semantic equivalence of language syntax formalisms
Detecting equivalence of modular specifications with categorical diagrams
On iteratable endofunctors
Coalgebraic representations of distributive lattices with operators
Varieties of chain-complete algebras
A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
Metric interpretations of infinite trees and semantics of non deterministic recursive programs
Expressive power of typed and type-free programming languages
Rule formats for nominal process calculi
A general theory of action languages
Quasivarieties and varieties of ordered algebras: regularity and exactness
Title not available (Why is that?)
Parametrization for order-sorted algebraic specification
Algebraic semantics and complexity of term rewriting systems
Code selection by inversion of order-sorted derivors
Algebraic specification of concurrent systems
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
A Mezei-Wright theorem for categorical algebras
An extension to trees of the Sardinas and Patterson algorithm
Data types, abstract data types and their specification problem
Semantics of order-sorted specifications
Algebras of iteration theories
Algebraic characterization of reducible flowcharts
Grammatical unification
Fixed-point constructions in order-enriched categories
An algebraic approach to the syntax and semantics of languages with subscripted variables
Algebraic domain equations
Algebraic relations and presentations
Order completion monads
On the algebra of order
Recursion and iteration in continuous theories: the M-construction
Iterative factor algebras and induced metrics
Extended linear macro grammars, iteration grammars, and register programs
Completeness of category-based equational deduction
Implementation of data types by algebraic methods
The insensitivity theorem for nonreducing reflexive types
Towards a programming language based on the notion of two-level grammar
Recursion-closed algebraic theories
An effectively given initial semigroup
On rational definitions in complete algebras without rank
Complexity of algebraic implementations for abstract data types
On some classes of interpretations
A view of computability on term algebras
Continuation semantics for flowgraph equations
Abstract data types and algebraic semantics of programming languages
On context-free trees
Algebraic translations, correctness and algebraic compiler construction
Categorical rewriting of term-like structures
Equational properties of fixed point operations in Cartesian categories: an overview
Final algebra semantics and data type extensions
A connection between concurrency and language theory
An order-algebraic definition of knuthian semantics
On the correspondence between two classes of reduction systems
RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
Title not available (Why is that?)
Contributions to the semantics of logic perpetual processes
Macro tree transducers
Composition and evaluation of attribute coupled grammars
Title not available (Why is that?)
The rewriting logic semantics project
Unique fixed points vs. least fixed points
Partially additive categories and flow-diagram semantics
Graph grammars and operational semantics
Modal logic and algebraic specifications
Final coalgebras in accessible categories
A Probabilistic Applied Pi–Calculus
A categorical manifesto
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
Extensions of iterative congruences of free iterative algebras
Axiomatizing the equational theory of regular tree languages
Infinitary combinatory reduction systems
Basic notions of universal algebra for language theory and graph grammars
The initial meadows
Proofs by induction in equational theories with constructors
Petri nets, event structures and domains. I
On the existence of free models in abstract algebraic institutions
A uniform approach to inductive posets and inductive closure
A continuous semantics for unbounded nondeterminism
Attribute grammars as recursion schemes over cyclic representations of zippers
IO and OI. II
Group axioms for iteration
A partial evaluator for the untyped lambda-calculus
Non-well-founded sets modeled as ideal fixed points
The equational logic of fixed points
Infinite trees and completely iterative theories: A coalgebraic view
On observational equivalence and algebraic specification
Structured algebraic specifications: A kernel language
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Determinization of weighted finite automata over strong bimonoids
A constructive method for abstract algebraic software specification
Equational logic of circular data type specification

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)