Arnold Beckmann. Proofs, Programs and Abstract Complexity. In Jacques Duparc, Thomas A. Henzinger, editors, Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. Volume 4646 of Lecture Notes in Computer Science, pages 4-5, Springer, 2007. [doi]
@inproceedings{Beckmann07,
title = {Proofs, Programs and Abstract Complexity},
author = {Arnold Beckmann},
year = {2007},
doi = {10.1007/978-3-540-74915-8_3},
url = {http://dx.doi.org/10.1007/978-3-540-74915-8_3},
researchr = {https://researchr.org/publication/Beckmann07},
cites = {0},
citedby = {0},
pages = {4-5},
booktitle = {Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings},
editor = {Jacques Duparc and Thomas A. Henzinger},
volume = {4646},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74914-1},
}