Bar recursion is not computable via iteration-Reference-Cited by-同舟云学术

Bar recursion is not computable via iteration

Published:2019-06-17 Issue:2 Volume:8 Page:119-153
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Longley John¹

Affiliation:

1. School of Informatics, University of Edinburgh, 10 Crichton Street, Edinburgh, EH8 9AB, United Kingdom. ; jrl@staffmail.ed.ac.uk

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference21 articles.

1. Full abstraction for PCF;Abramsky;Information and Computation,2000

2. U. Berger, Minimization vs. recursion on the partial continuous functionals, in: In the Scope of Logic, Methodology and Philosophy of Science, Cracow, August 1999, P. Gärdenfors, J. Woleński and K. Kijania-Placek, eds, Kluwer, Dordrecht, 2002, pp. 57–64.

3. Strongly majorizable functionals of finite type: A model for bar recursion containing discontinuous functionals;Bezem;Journal of Symbolic Logic,1985

4. M.H. Escardó and P. Oliva, Computing Nash equilibria of unbounded games, in: Proceedings of the Turing Centenary Conference, EPiC Series, Vol. 10, Manchester, 2012, pp. 53–65.

5. Bar recursion and products of selection functions;Escardó;Journal of Symbolic Logic,2015

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotic speedup via effect handlers;Journal of Functional Programming;2024

2. Effects for efficiency: asymptotic speedup with first-class control;Proceedings of the ACM on Programming Languages;2020-08-02