scientific article
From MaRDI portal
Publication:3945564
zbMath0485.68020MaRDI QIDQ3945564
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Complete lattices, completions (06B23) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations ⋮ Algebraic solutions to recursion schemes ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ A Fully Abstract Semantics for Constructor Systems ⋮ A fully abstract semantics for concurrent constraint programming
This page was built for publication: