Functional interpretations of feasibly constructive arithmetic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Implicit Computational Complexity for Higher Type Functionals
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Introduction to clarithmetic I
Information and Computation
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Hi-index | 0.00 |