A characterization of Plotkin's order in powerdomains, and some of its properties

DOI10.1016/0304-3975(84)90127-0zbMath0584.68070OpenAlexW2104475322MaRDI QIDQ1069707

D. Frutos Escrig

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90127-0

zbMATH Keywords

treeenumerationdomainEgli-Milner's order

Mathematics Subject Classification ID

Partial orders, general (06A06) Theory of computing (68Q99)

Cites Work

• Data Types as Lattices
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of Plotkin's order in powerdomains, and some of its properties