ACM Transactions on Computational Logic (TOCL)

Accepted Papers, 2003

• The Marriage of Effects and Monads, P. Wadler and P. Thiemann
• Deciding the Confluence of Ordered Term Rewrite Systems, H. Comon, P. Narendran, R. Nieuwenhuis and M. Rusinowitch
• Resource-distribution via Boolean constraints, James Harland and David Pym
• Fixed-parameter complexity of semantics for logic programs, Z. Lonc and M. Truszczynski
• A Complete Characterization of Complete Intersection Type Theory, M. Dezani-Ciancaglini, F. Honsell and F. Alessi

• Computational Properties of Metaquerying Problems, F. Angiulli, R. Ben-Eliyahu-Zohary, G. Ianni and L. Palopoli
• Simulation-based minimization, Doron Bustan and Orna Grumberg
• On Proving Left Termination of Constraint Logic Programs, Fred Mesnard and Salvatore Ruggieri
• Logics of Metric Spaces, Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank Wolter and Michael Zakharyaschev

Editorial, Erich Grädel, Joseph Y. Halpern, Radha Jaghadeesan and Adolfo Piperno

Regular Papers

• An n! Lower Bound On Formula Size, Micah Adler and Neil Immerman
• Typechecking XML Views of Relational Databases, N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu
• Substructural Logic and Partial Correctness, Dexter Kozen and Jerzy Tiuryn
• Topological incompleteness and order incompleteness of the lambda calculus , Antonino Salibra
• Eliminating definitions and Skolem functions in first-order logic, Jeremy Avigad

• A Dynamic Approach to Characterizing Termination of General Logic Programs, Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan, Samuel S. P. Shen and Qiang Yang
• Variable Independence for First-Order Definable Constraints, Leonid Libkin
• Model Checking Stochastic Automata, Jeremy Bryans, Howard Bowman and John Derrick
• Higher-Order Pattern Complement and the Strict Lambda-Calculus, A. Momigliano and F. Pfenning
• Interaction between Path and Type Constraints, Peter Buneman, Wenfei Fan and Scott Weinstein
• Abstract State Machines Capture Parallel Algorithms, A. Blass and Y. Gurevich