%0 Journal Article %1 simpson2004computational %A Simpson, Alex %D 2004 %J Annals of Pure and Applied Logic %K algebraic_compactness domain_theory fpc mathematics set_theory %N 1 %P 207-275 %R https://doi.org/10.1016/j.apal.2003.12.005 %T Computational adequacy for recursive types in models of intuitionistic set theory. %U https://www.sciencedirect.com/science/article/pii/S0168007204000624 %V 130 %X This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown that the existence of solutions to recursive domain equations depends upon the strength of the set theory. We observe that the internal set theory of an elementary topos is not strong enough to guarantee their existence. In contrast, as our first main result, we establish that solutions to recursive domain equations do exist when the category of sets is a model of full intuitionistic Zermelo–Fraenkel set theory. We then apply this result to obtain a denotational interpretation of FPC, a recursively typed lambda-calculus with call-by-value operational semantics. By exploiting the intuitionistic logic of the ambient model of intuitionistic set theory, we analyse the relationship between operational and denotational semantics. We first prove an “internal” computational adequacy theorem: the model always believes that the operational and denotational notions of termination agree. This allows us to identify, as our second main result, a necessary and sufficient condition for genuine “external” computational adequacy to hold, i.e. for the operational and denotational notions of termination to coincide in the real world. The condition is formulated as a simple property of the internal logic, related to the logical notion of 1-consistency. We provide useful sufficient conditions for establishing that the logical property holds in practice. Finally, we outline how the methods of the paper may be applied to concrete models of FPC. In doing so, we obtain computational adequacy results for an extensive range of realizability and domain-theoretic models.

@article{simpson2004computational, abstract = {This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown that the existence of solutions to recursive domain equations depends upon the strength of the set theory. We observe that the internal set theory of an elementary topos is not strong enough to guarantee their existence. In contrast, as our first main result, we establish that solutions to recursive domain equations do exist when the category of sets is a model of full intuitionistic Zermelo–Fraenkel set theory. We then apply this result to obtain a denotational interpretation of FPC, a recursively typed lambda-calculus with call-by-value operational semantics. By exploiting the intuitionistic logic of the ambient model of intuitionistic set theory, we analyse the relationship between operational and denotational semantics. We first prove an “internal” computational adequacy theorem: the model always believes that the operational and denotational notions of termination agree. This allows us to identify, as our second main result, a necessary and sufficient condition for genuine “external” computational adequacy to hold, i.e. for the operational and denotational notions of termination to coincide in the real world. The condition is formulated as a simple property of the internal logic, related to the logical notion of 1-consistency. We provide useful sufficient conditions for establishing that the logical property holds in practice. Finally, we outline how the methods of the paper may be applied to concrete models of FPC. In doing so, we obtain computational adequacy results for an extensive range of realizability and domain-theoretic models.}, added-at = {2023-09-02T11:07:16.000+0200}, author = {Simpson, Alex}, biburl = {https://www.bibsonomy.org/bibtex/2a3355d597fcaf1e058655f0115d8e0c5/tabularii}, doi = {https://doi.org/10.1016/j.apal.2003.12.005}, interhash = {e55c4474c867f3e7222a3ed8de8eae6d}, intrahash = {a3355d597fcaf1e058655f0115d8e0c5}, issn = {0168-0072}, journal = {Annals of Pure and Applied Logic}, keywords = {algebraic_compactness domain_theory fpc mathematics set_theory}, note = {Papers presented at the 2002 IEEE Symposium on Logic in Computer Science (LICS)}, number = 1, pages = {207-275}, timestamp = {2023-09-02T11:07:16.000+0200}, title = {Computational adequacy for recursive types in models of intuitionistic set theory.}, url = {https://www.sciencedirect.com/science/article/pii/S0168007204000624}, volume = 130, year = 2004 }