Game semantics approach to higher-order complexity

Férée, Hugo (2017) Game semantics approach to higher-order complexity. Journal of Computer and System Sciences, 87 . pp. 1-15. ISSN 0022-0000. (doi:10.1016/j.jcss.2017.02.003) (KAR id:64630)

PDF Pre-print Language: English
Download this file (PDF/481kB)	Preview
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://dx.doi.org/10.1016/j.jcss.2017.02.003

Abstract

Game semantics was initially defined and used to characterize pcf functionals. We use this approach to propose a definition of complexity for such higher-order functions, as well as a class of polynomial time computable higher-order functions.

Item Type:	Article
DOI/Identification number:	10.1016/j.jcss.2017.02.003
Uncontrolled keywords:	Higher-order Complexity Game semantics bff pcf
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 9 Formal systems, logics
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Hugo Feree
Date Deposited:	22 Nov 2017 16:24 UTC
Last Modified:	05 Nov 2024 11:01 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/64630 (The current URI for this page, for reference purposes)

University of Kent Author Information

Férée, Hugo.

Creator's ORCID:
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.