Bruce Kapron -- Publications

For more recent publications, see my DBLP page. If you have trouble obtaining a paper listed there, please e-mail to request a copy.

Papers are organized according to publication year of most complete version.

2003

• The logic of the countable random frame, V. Goranko and B.M. Kapron, Archive for Mathematical Logic, 42(3), 2003, pp. 221-243. (PostScript)

• Logics for reasoning about cryptographic constructions, R. Impagliazzo and B.M. Kapron, Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 372-383. (Full version -- PostScript)

• On characterizations of the basic feasible functionals Part II, R. Irwin, B.M. Kapron, J. Royer, submitted. (PostScript)

2002

• Resource bounded continuity and sequentiality for type-two functionals, S.R. Buss and B.M. Kapron, ACM Transactions on Computational Logic, 3, 2002, pp.402-417. (PostScript)

  Extended abstract (PostScript) appeared in LICS 2000, pp. 77-83

2001

• On characterizations of the basic feasible functionals Part I, R. Irwin, B.M. Kapron, J. Royer. Journal of Functional Programming, 11, 2001, pp. 117-153. (PostScript)

1999

• Feasibly continuous type-two functionals, B.M.Kapron. computational complexity, 8, 1999, pp. 188-201. (PostScript)

• A note on negative tagging for least fixed-point formulae, D. Gurov, B.M.Kapron. Theoretical Informatics and Applications, 33, 1999, pp. 383-392. (PostScript)

1996

• A new characterization of type-2 feasibility, B.M. Kapron, S.A. Cook, SIAM J. on Computing, 25(1), pp.117-132, 1996. (PostScript)

  Extended abstract (PostScript) appeared as A new characterization of Mehlhorn's polynomial time functionals, B.M. Kapron, S.A. Cook, Proc. 32th IEEE Symposium on Foundations of Computer Science (FOCS), 1991, pp.342-347.

• A modal mu-calculus and a proof system for value passing processes, S. Berezin, D. Gurov, B.M. Kapron. Electronic Notes in Theoretical Computer Science, 6, 1996, (PostScript).

• Limits on the power of parallel random access machines with weak forms of write conflict resolution, F.E. Fich, R. Impagliazzo, B.M. Kapron, V. King, W. Kutylowski, Journal of Computer and System Sciences, 53(1), 1996, pp. 104-111.

  Extended abstract (PostScript) appeared in Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science (STACS), 1993, pp. 386-397.

1994

• The parameterized complexity of some problems in logic and linguistics, R. Downey, M. Fellows, M. Hallet, B.M. Kapron and T. Wareham, Proceedings of the 3rd International Symposium on Logical Foundations of Computer Science (LFCS), 1994, pp. 89-100. (PostScript)

• Zero-one laws for modal logic, J.Y. Halpern, B.M. Kapron, Annals of Pure and Applied Logic, 69(2-3), pp.157-195, 1994. (PostScript)

  Extended abstract (PostScript) appeared in Proc. 7th IEEE Symposium on Logic in Computer Science (LICS), 1992, pp.369-380.

1993

• Parallel computable higher type functionals, P. Clote, A. Ignatovic, B.M. Kapron, Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS), 1993, pp. 72-81. (PostScript)

1990

• Characterizations of the basic feasible functionals of finite type, S.A. Cook, B.M. Kapron, Feasible Mathematics: A Mathematical Sciences Institute Workshop, Birkhauser, 1990, Eds. S. Buss, P. Scott, pp.71-96. (PostScript)

  Extended abstract (PostScript) appeared in Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), 1989, pp.154-159.

1987

• Modal sequents and definability, B.M. Kapron, Journal of Symbolic Logic, 52, pp.756-762, 1987.

  You may view this article at JSTOR.