Inductive Definition and Domain Theoretic Properties of Fully Abstract

DOI10.2168/LMCS-3(3:7)2007MaRDI QIDQ5426073zbMATH OpenFDO

Authors Vladimir Yu. Sazonov

Publication date 15 November 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-3(3:7)2007

zbMATH Keywords

computational strategiesfinite type hierarchyfull abstractionnon-dcposequential completeness

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Full abstraction for PCF
• Full abstraction and the Context Lemma (preliminary report)
• scientific article; zbMATH DE number 3976319
• On Natural Non-dcpo Domains
• On full abstraction for PCF: I, II and III

Cited in

(11)

• Natural non-dcpo domains and f-spaces
• From term models to domains
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Kripke logical relations and PCF
• scientific article; zbMATH DE number 512783 (Why is no real title available?)
• scientific article; zbMATH DE number 2061712 (Why is no real title available?)
• The recursion hierarchy for PCF is strict
• On naturally continuous non-dcpo domains
• On Natural Non-dcpo Domains
• The extensional ordering of the sequential functionals

This page was built for publication: Inductive Definition and Domain Theoretic Properties of Fully Abstract

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426073)