Aarhus University Seal / Aarhus Universitets segl

A model of PCF in guarded type theory

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference 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
Number of pages17
Publication statusPublished - 2015
EventConference on the Mathematical Foundations of Programming Semantics - Nijmegen, Netherlands
Duration: 22 Jun 201525 Jun 2015
Conference number: 31


ConferenceConference on the Mathematical Foundations of Programming Semantics

Bibliographical note

Electronic Notes in Theoretical Computer Science

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 98165638