Export 15 results:
Filters: Author is Reinhard Kahle  [Clear All Filters]
Studer, T.: Constructive foundations for Featherweight Java. In: Kahle, R., Schroeder-Heister, P., and Stärk, R.F. Proceedings of the International Seminar on Proof Theory in Computer Science. pp. 202-238. Springer (2001).
Kahle, R., Studer, T.: Formalizing non-termination of recursive programs. Journal of Logic and Algebraic Programming. 49, 1-14 (2001).
Jäger, G., Kahle, R., Studer, T.: Universes in explicit mathematics. Annals of Pure and Applied Logic. 109, 141-162 (2001).
Kahle, R., Studer, T.: A theory of explicit mathematics equivalent to ${ \mathsf{ID} }_1$. In: Clote, P. and Schwichtenberg, H. Proceedings of Computer Science Logic. pp. 356-370. Springer (2000).
Kahle, R.: N-strictness in applicative theories. Archive for Mathematical Logic. 39, 125-144 (2000).
Kahle, R.: Frege structures for partial applicative theories. Journal of Logic and Computation. 8, 683-700 (1998).