| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Oosten, J. van | |
| dc.contributor.author | Alkemade, T.P. | |
| dc.date.accessioned | 2015-09-24T17:00:38Z | |
| dc.date.available | 2015-09-24T17:00:38Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/26722 | |
| dc.description.abstract | The denotational semantics of a programming language gives a mathematical model of its types and terms. The Scott-domain model for the programming language PCF (Programming Computable Functions) uses Scott-domains with Scott-continuous functions (ordered pointwise). However, this model is not fully abstract: there are functions in the model that can not be represented in PCF. Hyland and Ong developed a model that is fully abstract by modeling types as dialogue games and terms as innocent strategies in those games. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 308770 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Full Abstraction for PCF | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | full abstraction, pcf, lambda calculus, scott-domain, dialogue games | |
| dc.subject.courseuu | Mathematical Sciences | |
