论文信息 - A Metric Model of Lambda Calculus with Guarded Recursion

A Metric Model of Lambda Calculus with Guarded Recursion

We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence.

[1] Andrew M. Pitts,et al. Relational Properties of Domains , 1996, Inf. Comput..

[2] Ralf Hinze. Functional pearl: streams and unique fixed points , 2008, ICFP.

[3] Noam Zeilberger,et al. The logical basis of evaluation order and pattern-matching , 2009 .

[4] Andrew W. Appel,et al. A very modal model of a modern, major, general type system , 2007, POPL '07.

[5] Lars Birkedal,et al. Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types , 2009, FoSSaCS.

[6] M. Escardó,et al. A metric model of PCF , 1998 .

[7] Stefan Friedrich,et al. Topology , 2019, Arch. Formal Proofs.

[8] François Pottier,et al. A typed store-passing translation for general references , 2011, POPL '11.

[9] Hiroshi Nakano,et al. A modality for recursion , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[10] Pierre America,et al. Solving Reflexive Domain Equations in a Category of Complete Metric Spaces , 1987, J. Comput. Syst. Sci..

[11] Lars Birkedal,et al. Verifying event-driven programs using ramified frame properties , 2010, TLDI '10.

[12] Andrew W. Appel,et al. An indexed model of recursive types for foundational proof-carrying code , 2001, TOPL.

[13] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .