Skip to main content

A Model of PCF in Guarded Type Theory

Paviotti, Marco, Møgelberg, Rasmus, Birkedal, Lars (2015) A Model of PCF in Guarded Type Theory. Electronic Notes in Theoretical Computer Science, 319 . pp. 333-349. ISSN 1571-0661. (doi:10.1016/j.entcs.2015.12.020)

PDF - Publisher pdf
Restricted to Repository staff only

Creative Commons Licence
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Contact us about this Publication Download (291kB)
PDF - Author's Accepted Manuscript
Download (271kB) Preview
Official URL


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.

Item Type: Article
DOI/Identification number: 10.1016/j.entcs.2015.12.020
Uncontrolled keywords: Recursion, Denotational Semantics, Type Theory, Category Theory
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Marco Paviotti
Date Deposited: 05 Dec 2017 15:12 UTC
Last Modified: 29 May 2019 19:59 UTC
Resource URI: (The current URI for this page, for reference purposes)
Paviotti, Marco:
  • Depositors only (login required):


Downloads per month over past year