Pages that link to "Item:Q4131619"
From MaRDI portal
The following pages link to Initial Algebra Semantics and Continuous Algebras (Q4131619):
Displaying 50 items.
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- On flowchart theories. I. The deterministic case (Q1093364) (← links)
- Crypt-equivalent algebraic specifications (Q1095646) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Composition and evaluation of attribute coupled grammars (Q1099964) (← links)
- On flowchart theories. II: The nondeterministic case (Q1101203) (← links)
- Equational specification of partial higher-order algebras (Q1102736) (← links)
- A guided tour of the mathematics of MetaSoft '88 (Q1111360) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Unification theory (Q1124375) (← links)
- Algebraic translations, correctness and algebraic compiler construction (Q1129121) (← links)
- Polymorphic syntax definition (Q1129122) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- The formal termination problem for programs with finite ALGOL 68-modes (Q1133312) (← links)
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs (Q1136494) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Partially additive categories and flow-diagram semantics (Q1137858) (← links)
- Unique fixed points vs. least fixed points (Q1142573) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- On the algebra of order (Q1143782) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Foundations of system theory: The Hankel matrix (Q1146145) (← links)
- Petri nets, event structures and domains. I (Q1148680) (← links)
- Una teoria algebrica per i ''guarded commands'' di Dijkstra (Q1151022) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- On correct refinement of programs (Q1157144) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- Complexity of algebraic implementations for abstract data types (Q1158952) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- Tree constructions of free continuous algebras (Q1160149) (← links)
- Hierarchical development of programming languages (Q1161053) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Attribute grammars and recursive program schemes. I. II (Q1162363) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- Regular trees and the free iterative theory (Q1169813) (← links)
- A continuous semantics for unbounded nondeterminism (Q1171370) (← links)
- On rational definitions in complete algebras without rank (Q1171374) (← links)
- Abstract data types and algebraic semantics of programming languages (Q1171877) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Semantics of order-sorted specifications (Q1185014) (← links)
- Domains for logic programming (Q1185016) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
