Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn. Linear Ramified Higher Type Recursion and Parallel Complexity. In Reinhard Kahle, Peter Schroeder-Heister, Robert F. Stärk, editors, Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings. Volume 2183 of Lecture Notes in Computer Science, pages 1-21, Springer, 2001. [doi]
@inproceedings{AehligJST01,
title = {Linear Ramified Higher Type Recursion and Parallel Complexity},
author = {Klaus Aehlig and Jan Johannsen and Helmut Schwichtenberg and Sebastiaan Terwijn},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2183/21830001.htm},
researchr = {https://researchr.org/publication/AehligJST01},
cites = {0},
citedby = {0},
pages = {1-21},
booktitle = {Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings},
editor = {Reinhard Kahle and Peter Schroeder-Heister and Robert F. Stärk},
volume = {2183},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42752-X},
}