Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4951221 | Journal of Computer and System Sciences | 2017 | 15 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hugo Férée,