Page 183 - Textos de Matemática Vol. 40

Bibliography 171
[St¨a95] [St¨a97]
[St¨a98]
[St¨a05] [Ste01]
[Str92] [Str96a]
[Str96b] [Str97] [Str99]
[Str00a]
[Str00b]
[Str01]
Robert St¨ark. Applicative theories with explicit substitutions and call-by-value evaluation, draft notes, January 23, 1995.
Robert St¨ark. Call-by-value, call-by-name and the logic of values. In D. van Dalen and M. Bezem, editors, Computer Science Logic CSL ’96, volume 1258 of Lecture Notes in Computer Science, pages 431–445. Springer, 1997.
Robert St¨ark. Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages. Journal of Functional Programming, 8(2):97–129, 1998.
Robert St¨ark. Axioms for strict and lazy functional programs. Annals of Pure and Applied Logic, 133(1–3):293–318, 2005.
David Steiner. Proof-theoretic strength of PRON with various exten- sions. Diplomarbeit, Universit¨at Bern, Institut fu¨r Informatik und angewandte Mathematik, 2001.
Thomas Strahm. Theories with Self-Application of Strength PRA. Lizentiatsarbeit, Universit¨at Bern, Juni 1992.
Thomas Strahm. On the proof theory of applicative theories. PhD thesis, Institut fu¨r Informatik und angewandte Mathematik, Univer- sit¨at Bern, 1996.
Thomas Strahm. Partial applicative theories and explicit substitu- tions. Journal of Logic and Computation, 6(1):55–77, 1996.
Thomas Strahm. Polynomial time operations in explicit mathemat- ics. Journal of Symbolic Logic, 62(2):575–594, 1997.
Thomas Strahm. First steps into metapredicativity in explicit math- ematics. In S. Cooper and J. Truss, editors, Sets and Proofs, volume 258 of London Mathematical Society Lecture Note Series, pages 383– 402. Cambridge University Press, 1999.
Thomas Strahm. Autonomous fixed point progressions and fixed point transfinite recursion. In S. Buss, P. H´ajek, and P. Pudl´ak, editors, Logic Colloquium ’98, volume 13 of Lecture Notes in Logic, pages 449–464. ASL and AK Peters, 2000.
Thomas Strahm. The non-constructive μ-operator, fixed point the- ories with ordinals, and the bar rule. Annals of Pure and Applied Logic, 104(1–3):305–324, July 2000.
Thomas Strahm. Proof-theoretic contributions to explicit mathemat- ics. Habilitationsschrift, Institut fu¨r Informatik und angewandte Ma- thematik, Universit¨at Bern, 2001.