Pages that link to "Item:Q4131619"

The following pages link to Initial Algebra Semantics and Continuous Algebras (Q4131619):

Displaying 50 items.

• A connection between concurrency and language theory (Q265802) (← links)
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
• Infinitary combinatory reduction systems (Q550248) (← links)
• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• Modal logic and algebraic specifications (Q685423) (← links)
• An algebraically specified language for data directed design (Q751297) (← links)
• List-arithmetic distributive categories: Locoi (Q752170) (← links)
• Non-well-founded sets modeled as ideal fixed points (Q757360) (← links)
• Expressive power of typed and type-free programming languages (Q761790) (← links)
• Algebras of iteration theories (Q789159) (← links)
• Algebraic characterization of reducible flowcharts (Q789162) (← links)
• Proofs by induction in equational theories with constructors (Q789177) (← links)
• Grammatical unification (Q789185) (← links)
• Recursion and iteration in continuous theories: the ''M-construction'' (Q790235) (← links)
• Iterative factor algebras and induced metrics (Q790606) (← links)
• Extensions of iterative congruences of free iterative algebras (Q792751) (← links)
• Implementation of data types by algebraic methods (Q792753) (← links)
• The insensitivity theorem for nonreducing reflexive types (Q792755) (← links)
• Towards a programming language based on the notion of two-level grammar (Q795514) (← links)
• A constructive method for abstract algebraic software specification (Q796979) (← links)
• A uniform approach to inductive posets and inductive closure (Q809105) (← links)
• Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
• Coalgebraic representations of distributive lattices with operators (Q869666) (← links)
• The rewriting logic semantics project (Q877024) (← links)
• Parametrization for order-sorted algebraic specification (Q909448) (← links)
• Combining data type and recursive process specifications using projection algebras (Q910188) (← links)
• Code selection by inversion of order-sorted derivors (Q914361) (← links)
• Algebraic specification of concurrent systems (Q914405) (← links)
• Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
• A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
• An extension to trees of the Sardinas and Patterson algorithm (Q1050318) (← links)
• A view of computability on term algebras (Q1051428) (← links)
• An algebraic approach to the syntax and semantics of languages with subscripted variables (Q1053444) (← links)
• Algebraic domain equations (Q1054464) (← links)
• Fundamental properties of infinite trees (Q1055184) (← links)
• Axiomatising finite delay operators (Q1055190) (← links)
• Algebraic relations and presentations (Q1055794) (← links)
• Order completion monads (Q1055871) (← links)
• On the correspondence between two classes of reduction systems (Q1059392) (← links)
• Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories (Q1059404) (← links)
• Specification-oriented semantics for communicating processes (Q1060838) (← links)
• An effectively given initial semigroup (Q1061863) (← links)
• Macro tree transducers (Q1073576) (← links)
• Continuation semantics for flowgraph equations (Q1080651) (← links)
• Structured algebraic specifications: A kernel language (Q1080652) (← links)
• On context-free trees (Q1082826) (← links)
• On the existence of free models in abstract algebraic institutions (Q1085969) (← links)
• On the implementation of abstract data types by programming language constructs (Q1089793) (← links)
• On observational equivalence and algebraic specification (Q1089796) (← links)
• Toward formal development of programs from algebraic specifications: Implementations revisited (Q1090100) (← links)