A Model of PCF in Guarded Type Theory

Marco Paviotti, Rasmus Ejlers Møgelberg, Lars Birkedal

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review


Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for constructing logics for reasoning about programming languages with advanced features, as well as for constructing and reasoning about elements of coinductive types. In this paper we investigate how type theory with guarded recursion can be used as a metalanguage for denotational semantics useful both for constructing models and for proving properties of these. We do this by constructing a fairly intensional model of PCF and proving it computationally adequate. The model construction is related to Escardo's metric model for PCF, but here everything is carried out entirely in type theory with guarded recursion, including the formulation of the operational semantics, the model construction and the proof of adequacy.
Original languageEnglish
JournalElectronic Notes in Theoretical Computer Science
Pages (from-to)333-349
Publication statusPublished - 2015


Dive into the research topics of 'A Model of PCF in Guarded Type Theory'. Together they form a unique fingerprint.

Cite this