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.
Original language | English |
---|---|
Title of host publication | 7th Workshop on Fixed Points in Computer Science : FICS 2010 |
Editors | Luigi Santocanale |
Number of pages | 7 |
Publication date | 2010 |
Pages | 19-25 |
Publication status | Published - 2010 |
Event | 7th Workshop on Fixed Points in Computer Science - Brno, Czech Republic Duration: 21 Aug 2010 → 22 Aug 2010 Conference number: 7 |
Conference
Conference | 7th Workshop on Fixed Points in Computer Science |
---|---|
Number | 7 |
Country/Territory | Czech Republic |
City | Brno |
Period | 21/08/2010 → 22/08/2010 |