Game semantics approach to higher-order complexity
From MaRDI portal
Publication:2396718
DOI10.1016/J.JCSS.2017.02.003zbMATH Open1370.68106OpenAlexW2588348326MaRDI QIDQ2396718FDOQ2396718
Authors: Hugo Férée 
Publication date: 24 May 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/64630/1/JCSS2017.pdf
Recommendations
- scientific article; zbMATH DE number 1342245
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras
- Game semantics for call-by-value polymorphism
- Games for complexity of second-order call-by-name programs
Applications of game theory (91A80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- Derivational complexity is an invariant cost model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analytical properties of resource-bounded real functionals
- Functional interpretations of feasibly constructive arithmetic
- Title not available (Why is that?)
- Polynomial and abstract subrecursive classes
- On characterizations of the basic feasible functionals. I
- A new Characterization of Type-2 Feasibility
- Freshness and Name-Restriction in Sets of Traces with Names
- Complexity theory for operators in analysis
- Title not available (Why is that?)
- Resource-bounded continuity and sequentiality for type-two functionals
- On the query complexity of real functionals
- Game semantics in the nominal model
- Adventures in time and space
Cited In (8)
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- A game-semantic model of computation
- On higher-order reachability games vs may reachability
- A Game Semantics of Idealized CSP
- Quantitative continuity and Computable Analysis in Coq
- Finite high-order games and an inductive approach towards Gowers's dichotomy
- Game Semantics in String Diagrams
- Games for complexity of second-order call-by-name programs
This page was built for publication: Game semantics approach to higher-order complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396718)
