scientific article; zbMATH DE number 3362972
From MaRDI portal
Publication:5636307
zbMath0228.68016MaRDI QIDQ5636307
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
Infinite-word languages and continuous mappings ⋮ Categorical semantics for programming languages ⋮ A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence ⋮ Unnamed Item ⋮ A concrete realization of the Hoare powerdomain ⋮ Parallélisation sémantique ⋮ On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics ⋮ The equational logic of fixed points ⋮ L.P.L. A fuzzy programming language. I: Syntactic aspects ⋮ Metric interpretations of infinite trees and semantics of non deterministic recursive programs ⋮ Partially additive categories and flow-diagram semantics ⋮ L.P.L. - A fuzzy programming language. II: Semantic aspects ⋮ Unique fixed points vs. least fixed points ⋮ Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I ⋮ Varieties of chain-complete algebras ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ Petri nets, event structures and domains. I ⋮ Quasivarieties and varieties of ordered algebras: regularity and exactness ⋮ An algebraic definition for control structures ⋮ Recursive data structures ⋮ Recursion-closed algebraic theories ⋮ Tree constructions of free continuous algebras ⋮ The IO- and OI-hierarchies ⋮ Fixed point theorems and semantics: A folk tale ⋮ A survey of state vectors ⋮ Regular trees and the free iterative theory ⋮ On rational definitions in complete algebras without rank ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Programming Language for the Interval Geometric Machine ⋮ Varieties of ordered algebras ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Una classe di schemi ricorsivi non-deterministici paralleli ⋮ Program invariants as fixedpoints ⋮ Algebraic specification of data types: A synthetic approach ⋮ Translatability of schemas over restricted interpretations ⋮ On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs ⋮ Iterative factor algebras and induced metrics ⋮ Algebraic domain equations ⋮ P-varieties - a signature independent characterization of varieties of ordered algebras ⋮ Order completion monads ⋮ Positive varieties of tree languages ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
This page was built for publication:
