Abstract
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.
Originalsprog | Engelsk |
---|---|
Titel | 7th Workshop on Fixed Points in Computer Science : FICS 2010 |
Redaktører | Luigi Santocanale |
Antal sider | 7 |
Publikationsdato | 2010 |
Sider | 19-25 |
Status | Udgivet - 2010 |
Begivenhed | 7th Workshop on Fixed Points in Computer Science - Brno, Tjekkiet Varighed: 21 aug. 2010 → 22 aug. 2010 Konferencens nummer: 7 |
Konference
Konference | 7th Workshop on Fixed Points in Computer Science |
---|---|
Nummer | 7 |
Land/Område | Tjekkiet |
By | Brno |
Periode | 21/08/2010 → 22/08/2010 |
Citationsformater
Birkedal, L., Schwinghammer, J., & Støvring, K. (2010). A metric model of lambda calculus with guarded recursion. I L. Santocanale (red.), 7th Workshop on Fixed Points in Computer Science: FICS 2010 (s. 19-25) https://hal.archives-ouvertes.fr/hal-00512377