Paper Info
Title
A Model of PCF in Guarded Type Theory
Abstract
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.
Year
DOI
Venue
2015
10.1016/j.entcs.2015.12.020
Electronic Notes in Theoretical Computer Science
Keywords
Field
DocType
Denotational semantics,guarded recursion,type theory,PCF,synthetic domain theory
Predicate transformer semantics,Discrete mathematics,Operational semantics,Computer science,Denotational semantics,Type theory,Coinduction,Mutual recursion,Metalanguage,Recursion
Journal
Volume
Issue
ISSN
319
C
1571-0661
Citations 
PageRank 
References 
3
0.40
12
Authors
3
Name
Order
Citations
PageRank
Marco Paviotti160.79
Rasmus Ejlers Møgelberg220416.63
Lars Birkedal3148196.84