Algorithms with polynomial interpretation termination proof.
- Published in:
- Journal of Functional Programming, 2001, v. 11, n. 1, p. 33, doi. 10.1017/s0956796800003877
- By:
- Publication type:
- Article
Works matching IS 09567968 AND DT 2001 AND VI 11 AND IP 1
Results: 4
1
2
Editorial.
- Published in:
- Journal of Functional Programming, 2001, v. 11, n. 1, p. 1, doi. 10.1017/s0956796801009030
- By:
- Publication type:
- Article
3
Automated complexity analysis of Nuprl extracted programs.
- Published in:
- Journal of Functional Programming, 2001, v. 11, n. 1, p. 3, doi. 10.1017/s0956796800003865
- By:
- Publication type:
- Article
4
On characterizations of the basic feasible functionals, Part I.
- Published in:
- Journal of Functional Programming, 2001, v. 11, n. 1, p. 117, doi. 10.1017/s0956796800003841
- By:
- Publication type:
- Article