Chain properties in Pomega

DOI10.1016/0304-3975(79)90023-9zbMath0471.68009OpenAlexW2049556363MaRDI QIDQ1157698

S. H. Smith

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90023-9

zbMATH Keywords

program verificationcontinuous latticessemantics of programming languagescpochain-complete subsetseffective setslattice embedding mapsuniversal domain for data types

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01) Lattices (06B99)

Related Items

Towards a descriptive set theory for domain-like structures ⋮ Borel ideals vs. Borel sets of countable relations and trees ⋮ A Wadge hierarchy for second countable spaces ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Wadge hardness in Scott spaces and its effectivization

Cites Work

• Data Types as Lattices
• Computability theory in admissible domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item