Author:
Summers Alexander J.,van Bakel Steffen
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Damas, L., Milner, R.: Principal type-schemes for functional programs. In: Proceedings 9th ACM Symposium on Principles of Programming Languages, pp. 207–212 (1982)
2. Gentzen, G.: Untersuchungen über das logische schließen. Mathematische Zeitschrift 39, 176–210, 405–431 (1935)
3. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1989)
4. Girard, J.-Y.: Une extension de l’interprétation de Gödel à l’analyse et son application à l’élimination des coupures dans l’analyse et la théorie des types. In: Proceedings of the Second Scandinavian Logic Symposium (Univ. Oslo, Oslo, 1970), vol. 63, pp. 63–92. North-Holland, Amsterdam (1971)
5. Lengrand, S.: Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. In: Gramlich, B., Lucas, S. (eds.) Electronic Notes in Theoretical Computer Science, vol. 86. Elsevier, Amsterdam (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computation with classical sequents;Mathematical Structures in Computer Science;2008-06
2. On the Computational Representation of Classical Logical Connectives;Electronic Notes in Theoretical Computer Science;2007-06