Skip to main content
Kent Academic Repository

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)


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: 04 Mar 2024 19:08 UTC
Resource URI: (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):

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