Publications

Export 13 results:
Filters: Author is Reinhard Kahle  [Clear All Filters]
2001
T. Studer, Constructive foundations for Featherweight Java, in Proceedings of the International Seminar on Proof Theory in Computer Science, 2001, vol. 2183, p. 202{–}238.
R. Kahle and T. Studer, Formalizing non-termination of recursive programs, Journal of Logic and Algebraic Programming, vol. 49, p. 1{–}14, 2001.
G. Jäger, R. Kahle, and T. Studer, Universes in explicit mathematics, Annals of Pure and Applied Logic, vol. 109, p. 141{–}162, 2001.
2000
R. Kahle, N-strictness in applicative theories, Archive for Mathematical Logic, vol. 39, p. 125{–}144, 2000.
R. Kahle and T. Studer, A theory of explicit mathematics equivalent to ${ \mathsf{ID} }_1$, in Proceedings of Computer Science Logic, 2000, vol. 1862, p. 356{–}370.
1999
G. Jäger, R. Kahle, and T. Strahm, On applicative theories, in Logic and Foundations of Mathematics, 1999, p. 83{–}92.
G. Jäger, R. Kahle, A. Setzer, and T. Strahm, The proof-theoretic analysis of transfinitely iterated fixed point theories, The Journal of Symbolic Logic, vol. 64, p. 53{–}67, 1999.
1998
R. Kahle, Frege structures for partial applicative theories, Journal of Logic and Computation, vol. 8, p. 683{–}700, 1998.