Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)
On continuous completions
This paper is devoted to the study of various completions of posets which preserve the algebraic or ordering structure of the given poset.
KeywordsProgram Scheme Continuous Homomorphism Algebraic Semantic Completion Process Finite Approximation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- /1/.ADJ, A uniform approach to inductive posets and inductive closure, MFCS 77, Lect. Notes Comp. Sc. no 53, Springer-Verlag (1977), 192–212Google Scholar
- /2/.G. BIRKHOFF, Lattice theory, 3rd ed., New York (1967)Google Scholar
- /3/.S. BLOOM, Varieties of ordered algebras, JCSS 13 (1976), 200–212Google Scholar
- /4/.B. COURCELLE, J.C. RAOULT, Completions de magmas ordonnés, to appearGoogle Scholar
- /5/.I. GUESSARIAN, Semantic equivalence of program schemes and its syntactic characterization, Proc. 3rd ICALP, Edinburgh (1976), 189–200Google Scholar
- /6/.I. GUESSARIAN, Les tests et leur caractérisation syntaxique, RAIRO 11 (1977), 133–156Google Scholar
- /7/.K. INDERMARK, Schemes with recursion on higher types, MFCS 76, Lect. Notes Comp. Sc. no45, Springer-Verlag (1976), 352–358Google Scholar
- /8/.J. MESEGUER, Factorizations, completions and colimits for w-posets, extended abstract (1978), to appearGoogle Scholar
- /8b/.J. MESEGUER, Ideal monads and Z-posets, Not. Am. Math. Soc. 25 no6(1978), 579–580Google Scholar
- /9/.M. NIVAT, On the interpretation of recursive polyadic program schemes, Symposia Mathematica 15, Rome (1975), 256–281Google Scholar
- /10/.M. NIVAT, Interprétation universelle d'un schéma de programme récursif, Rivista di informatica 7 (1977), 9–16Google Scholar
© Springer-Verlag Berlin Heidelberg 1979