Initial Algebra Semantics and Continuous Algebras

Cited in

(only showing first 100 items - show all)

An algebraically specified language for data directed design
Categorical rewriting of term-like structures
Equational properties of fixed point operations in Cartesian categories: an overview
Final algebra semantics and data type extensions
Solving polynomial fixed point equations
A connection between concurrency and language theory
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
On the correspondence between two classes of reduction systems
On equational theories, unification, and (un)decidability
Contributions to the semantics of logic perpetual processes
On flowchart theories. I. The deterministic case
An order-algebraic definition of knuthian semantics
Crypt-equivalent algebraic specifications
Rewriting with a nondeterministic choice operator
Algebraic solutions to recursion schemes
On flowchart theories. II: The nondeterministic case
scientific article; zbMATH DE number 3607504 (Why is no real title available?)
A unified language processing methodology
A coinductive completeness proof for the equivalence of recursive types
Semantics of non-terminating rewrite systems using minimal coverings
RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
A semantic theory for value-passing processes based on the late approach
On the semantics of parsing actions
Rewriting on cyclic structures: Equivalence between the operational and the categorical description
Macro tree transducers
The rewriting logic semantics project
Composition and evaluation of attribute coupled grammars
Pumping lemmas for term languages
Unique fixed points vs. least fixed points
scientific article; zbMATH DE number 3772918 (Why is no real title available?)
Formalization of universal algebra in Agda
Partially additive categories and flow-diagram semantics
Equational specification of partial higher-order algebras
On the semantic equivalence of language syntax formalisms
Graph grammars and operational semantics
Modal logic and algebraic specifications
Detecting equivalence of modular specifications with categorical diagrams
A categorical manifesto
Final coalgebras in accessible categories
A Probabilistic Applied Pi–Calculus
Extensions of iterative congruences of free iterative algebras
Axiomatizing the equational theory of regular tree languages
Infinitary combinatory reduction systems
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
Crisp-determinization of weighted tree automata over strong bimonoids
Synthesized and inherited functions. A new computational model for syntax-directed semantics
A guided tour of the mathematics of MetaSoft '88
Basic notions of universal algebra for language theory and graph grammars
Some quasi-varieties of iteration theories
Generic recursive lens combinators and their calculation laws
On multi-language abstraction. Towards a static analysis of multi-language programs
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
Proofs by induction in equational theories with constructors
A uniform approach to inductive posets and inductive closure
Petri nets, event structures and domains. I
On the existence of free models in abstract algebraic institutions
A continuous semantics for unbounded nondeterminism
The initial meadows
IO and OI. II
Full abstraction and limiting completeness in equational languages
Group axioms for iteration
Attribute grammars as recursion schemes over cyclic representations of zippers
Algebraic linear orderings
Non-well-founded sets modeled as ideal fixed points
Algebra of constructions II: an algebraic approach to Martin-Löf type theory and the calculus of constructions
The equational logic of fixed points
Infinite trees and completely iterative theories: A coalgebraic view
On observational equivalence and algebraic specification
Consistency of formalized specifications in multilevel programming
Structured algebraic specifications: A kernel language
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
A partial evaluator for the untyped lambda-calculus
Feferman on computability
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Polymorphic syntax definition
Higher order data types
On iteratable endofunctors
Determinization of weighted finite automata over strong bimonoids
Coalgebraic representations of distributive lattices with operators
Varieties of chain-complete algebras
A constructive method for abstract algebraic software specification
Equational properties of fixed-point operations in Cartesian categories: an overview
Meeting of the Association for Symbolic Logic Florence, Italy 1982
Equational logic of circular data type specification
On the algebraic structure of rooted trees
On quasi-varieties of multiple valued logic models
Axiomatising finite delay operators
Testing equivalences for processes
Fundamental properties of infinite trees
An algebraic semantics approach to the effective resolution of type equations
Foundations of system theory: The Hankel matrix
Una teoria algebrica per i guarded commands di Dijkstra
Unification theory
A representation of trees by languages. II
Tree constructions of free continuous algebras
Stone duality for relations
Attribute grammars and recursive program schemes. I. II
Three efficient algorithms for counting problems
Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
Attributed tree grammars

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)