5 results
On characterizations of the basic feasible functionals, Part I
-
- Journal:
- Journal of Functional Programming / Volume 11 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 26 March 2001, pp. 117-153
-
- Article
-
- You have access
- Export citation
A Note on Negative Tagging for Least Fixed-Point Formulae
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 33 / Issue 4-5 / July 1999
- Published online by Cambridge University Press:
- 15 August 2002, pp. 383-392
- Print publication:
- July 1999
-
- Article
- Export citation
CALL FOR PAPERS Journal of Functional Programming Special Issue on Functional Programming and Computational Complexity
-
- Journal:
- Journal of Functional Programming / Volume 7 / Issue 3 / May 1997
- Published online by Cambridge University Press:
- 01 May 1997, pp. 355-356
-
- Article
-
- You have access
- Export citation
Mike Townsend. Complexity for type-2 relations. Notre Dame journal of formal logic, vol. 31 (1990), pp. 241–262.
-
- Journal:
- The Journal of Symbolic Logic / Volume 58 / Issue 1 / March 1993
- Published online by Cambridge University Press:
- 12 March 2014, p. 360
- Print publication:
- March 1993
-
- Article
- Export citation
Modal sequents and definability
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 3 / September 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 756-762
- Print publication:
- September 1987
-
- Article
- Export citation