J. Zucker:   Publications

  1. J.V. Tucker and J.I. Zucker (2015): Generalizing computability theory to abstract algebras, in "Turing's Revolution. The Impact of his Ideas about Computability", ed. G. Sommaruga and T. Strahm (Birkhauser/Springer Basel), 127-160. [preprint.pdf]
  2. Ming Quan Fu and Jeffery Zucker (2015): Models of Computation for Partial Functions on the Reals, Journal of Logical and Algebraic Methods in Programming, 84, 218-237. [preprint.pdf, article.pdf]
  3. Bo Xie, Ming Quan Fu and Jeffery Zucker (2015): Characterizations of Semicomputable Sets of Real Numbers, Journal of Logical and Algebraic Methods in Programming, 84, 124-154. [preprint.pdf, article.pdf]
  4. J.V. Tucker and J.I. Zucker (2014): Computability of operators on continuous and discrete time streams. Computability, 3, 9-44. [preprint.pdf, PDF]
  5. Marc Bender and Jeffery Zucker (2013): Assignment calculus: A pure imperative language. Symposium on Logical Foundations of Computer Science, San Diego, Jan. 2013, ed. S. Artemov and A. Nerode. Lecture Notes in Computer Science 7734, Springer-Verlag. [preprint.pdf]
  6. Nick D. James and Jeffery Zucker (2012): A class of contracting stream operators. The Computer Journal, 56, 15-33. Abstract, Reprint.
  7. J.V. Tucker and J.I. Zucker (2011): Continuity of operators on continuous and discrete time streams>. Theoretical Computer Science, 412, 3378-3403. [preprint.pdf, PDF via ScienceDirect]
  8. B.C. Thompson, J.V. Tucker and J.I. Zucker (2009): Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. Applied Mathematics and Computation (Special Issue on Physics and Computation, ed. C. Calude and J.F. Costa), 215, 1386-1403. [preprint.pdf, PDF via ScienceDirect]
  9. T. Strahm and J.I. Zucker (2008): Primitive recursive selection functions for existential assertions over abstract algebras. Journal of Logic and Algebraic Programming (Special Issue on Logic and Information: From Logic to Constructive Reasoning, ed. V. Brattka, G. Jaeger and H.P. Kuenzi), 76, 175-197. [preprint.pdf, PDF via ScienceDirect]
  10. J.V. Tucker and J.I. Zucker (2007): Computability of analog networks. Theoretical Computer Science, 371, 115-146. [abstract, preprint.pdf, PDF via ScienceDirect]
  11. W. Jiang, Y. Wang and J.I. Zucker (2007): Universality and Semicomputability for Nondeterministic Programming Languages over Abstract Algebras. Journal of Logic and Algebraic Programming, 71, 44-78. (Based on Wei Jiang's and Yuan Wang's MSc Theses, 2002 and 2001.) [preprint.pdf, PDF via ScienceDirect]
  12. J.V. Tucker and J.I. Zucker (2006): Abstract versus concrete computability: The case of countable algebras. Logic Colloquium '03, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Helsinki, August 2003, ed. V. Stoltenberg-Hansen and J. Väänänen. Lecture Notes in Logic 24, Association for Symbolic Logic and A.K. Peters, 377-408. [abstract, preprint.pdf]
  13. J.V. Tucker and J.I. Zucker (2005): A Network Model of Analogue Computation over Metric Algebras. New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, June 2005: Proceedings, ed. S.B. Cooper, B. Löwe, and L. Torenvliet. Lecture Notes in Computer Science 3526, Springer-Verlag, 515-529. [abstract, preprint.pdf, PDF via SpringerLink]
  14. J. Xu and J.I. Zucker (2005): First and second order recursion on abstract data types. Fundamenta Informaticae, 67, 377-419. (Based on Jian Xu's MSc Thesis, completed August 2003.) [abstract, preprint.pdf, PDF via IOS Press (Search with terms "fundamenta xu zucker")]
  15. J.V. Tucker and J.I. Zucker (2005): Computable total functions, algebraic specifications and dynamical systems. Journal of Logical and Algebraic Programming, 62, 71-108. [abstract, preprint.pdf, PDF via ScienceDirect]
  16. J.V. Tucker and J.I. Zucker (2004): Abstract versus Concrete Computation on Metric Partial Algebras. ACM Transactions on Computational Logic 5, 611-668. [abstract, preprint.pdf, PDF via ACM Portal,appendix.pdf]
  17. J.V. Tucker and J.I. Zucker (2002): Abstract computability and algebraic specification, ACM Transactions on Computational Logic, 3, 279-333. [abstract, preprint.pdf, PDF via ACM Portal]
  18. J.V. Tucker and J.I. Zucker (2002): Infinite initial algebra specifications for stream algebras, in Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, ed. W. Sieg, R. Sommer and C. Talcott, Lecture Notes in Logic, vol. 15, 234--256. (Association for Symbolic Logic). [abstract, text.ps.gz]
  19. J.V. Tucker and J.I. Zucker (2000): Computable functions and semicomputable sets on many-sorted algebras, in Handbook of Logic in Computer Science, Vol. 5, ed. S. Abramsky, D.M. Gabbay and T.S.E. Maibaum (Oxford University Press), 317-523. [abstract, PDF]
  20. J.V. Tucker and J.I. Zucker (1999): Computation by `While' programs on topological partial algebras, Theoretical Computer Science 219, 379-420. [abstract, PDF via ScienceDirect]
  21. R. Janicki, D.L. Parnas, J. Zucker (1997): Tabular representations in relational documents, in Relational Methods in Computer Science, ed. C. Brink, W. Kahl and G. Schmidt (Springer-Verlag), 184-196. [abstract, text.ps.gz]
  22. J.I. Zucker (1996): Transformations of normal and inverted function tables, Formal Aspects of Computing 8, 679-705. [abstract, text.ps.gz]
  23. H. Shen, J.I. Zucker, D.L. Parnas (1996): Table transformation tools: Why and how, in COMPASS '96: Proceedings of the Eleventh Annual Conference on Computer Assurance, Gaithersburg, Maryland, USA, June 1996 (IEEE and National Institute of Standards and Technology), 3-11. [abstract, text.ps.gz]
  24. J.V. Tucker and J.I. Zucker (1994): Computable functions on stream algebras, in
    NATO Advanced Study Institute, International Summer School on Proof and Computation, Marktoberdorf, Germany, 1993, ed. H. Schwichtenberg (Springer-Verlag), 341-382. [abstract, text.ps.gz]
  25. L. Pretorius and J.I. Zucker (1993): Introduction to computability theory, South African Computer Journal, 9, April 1993, 3-30. [abstract, text.ps.gz]
  26. P. Wegner and J.I. Zucker (1993): Article on Programming language semantics, in Encyclopedia of Computer Science and Engineering, 3rd edition, ed. A. Ralston and E.D. Reilly (Van Nostrand Reinhold), 1115-1118.
  27. J.I. Zucker (1993): Propositional temporal logics and their use in model checking, in Functional Programming, Concurrency, Simulation and Automated Reasoning, ed. P.E. Lauer, Lecture Notes in Computer Science 693 (Springer-Verlag), 108-116. [abstract, text.ps.gz]
  28. J.I. Zucker (1993): The propositional mu-calculus and its use in model checking, in Functional Programming, Concurrency, Simulation and Automated Reasoning, ed. P.E. Lauer, Lecture Notes in Computer Science 693 (Springer-Verlag), 117-128. [abstract, text.ps.gz]
  29. J.I. Zucker and J.J.M.M. Rutten (1992): A semantic approach to fairness, Fundamenta Informaticae 16, 1-38.
  30. J.V. Tucker and J.I. Zucker (1992): Deterministic and nondeterministic computation, and Horn programs, on abstract data types, Journal of Logic Programming 13, 23-55.
  31. J.V. Tucker and J.I. Zucker (1992): Theory of computation over stream algebras, and its applications, in Mathematical Foundations of Computer Science, 17th International Symposium, Prague, August 1992, ed. I.M. Havel and V. Koubek, Lecture Notes in Computer Science 629, (Springer-Verlag), 62-80. [Revised and expanded as 4.]
  32. J.V. Tucker and J.I. Zucker (1992): Examples of semicomputable sets of real and complex numbers, in Constructivity in Computer Science -- Proceedings of a Summer Symposium, San Antonio, Texas, June 1991, ed. J.P. Myers, Jr. and M.J. O'Donnell, Jr., Lecture Notes in Computer Science 613, (Springer-Verlag), 179-198. [abstract]
  33. J.V. Tucker and J.I. Zucker (1991): Projections of semicomputable relations on abstract data types, International Journal of Foundations of Computer Science, 2, 267-296. [abstract, text.ps.gz]
  34. H.K. Hung and J.I. Zucker (1991): Semantics of pointers, referencing and dereferencing with intensional logic, in Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991, 127-136. [abstract, text.pdf]
  35. J.I. Zucker and H.K. Hung (1991): Program semantics, intensional logic and compositionality, in Proceedings of the First Montreal Workshop on Programming Language Theory, April 1991, ed. M. Okada and P.J. Scott (Centre for Pattern Recognition and Machine Intelligence), 93-103. [abstract, text.ps.gz]
  36. J.V. Tucker, S.S. Wainer and J.I. Zucker (1990): Provably computable functions on abstract data types, in Proceedings of the 17th International Colloquium on Automata, Logic and Programming, Warwick, England, July 1990, ed. M.S. Paterson, Lecture Notes in Computer Science 443 (Springer-Verlag), 660-673. [Revised and expanded as 5.]
  37. J.V. Tucker and J.I. Zucker (1990): Toward a general theory of computation and specification over abstract data types, in Advances in Computing and Information -- ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 1990, Proceedings, ed. S.G. Akl, F. Fiala and W.W. Koczkodaj, Lecture Notes in Computer Science 468 (Springer-Verlag), 745-760. [text.ps]
  38. J.V. Tucker and J.I. Zucker (1989): Horn programs and semicomputable relations on abstract structures, in Proceedings of the 16th International Colloquium on Automata, Logic and Programming, Stresa, Italy, July 1989, ed. G. Ausiello et al, Lecture Notes in Computer Science 372 (Springer-Verlag), 745-760. [Revised and expanded as 11.]
  39. J.V. Tucker and J.I. Zucker (1988): Program Correctness over Abstract Data Types, with Error-State Semantics (North-Holland).
  40. J.W. de Bakker, J.-J. Ch. Meyer, E.R. Olderog and J.I. Zucker (1988): Transition systems, metric spaces, and ready sets in the semantics of uniform concurrency, Journal of Computer and System Sciences, 54, 158-224.
  41. J.W. de Bakker, J.N. Kok, J.J. Ch. Meyer, E.R. Olderog and J.I. Zucker (1985): Contrasting themes in the semantics of imperative concurrency, in Current Trends in Concurrency (Overviews and Tutorials): Proceedings of the ESPRIT/LPC Advanced School in Concurrency, Noordwijkerhout, The Netherlands, June 1985, ed. J.W. de Bakker et al., Lecture Notes in Computer Science 224 (Springer-Verlag), 51-121.
  42. J.W. de Bakker, J.-J. Ch. Meyer and J.I. Zucker (1983): On infinite computations in denotational semantics, Theoretical Computer Science, 26, 53-82.
  43. J.W. de Bakker and J.I. Zucker (1983): Compactness in semantics for merge and fair merge, in Logics of Programs: Workshop, Carnegie-Mellon University, Pittsburgh, PA, June 1983, ed. E. Clarke and D. Kozen, Lecture Notes in Computer Science 164 (Springer-Verlag), 18-33.
  44. J.W. de Bakker and J.I. Zucker (1983): Processes and a fair semantics for the ADA rendez-vous, in Automata, languages and Programming: Proceedings of the 10th International Colloquium on Logic, Automata and Programming, Barcelona, Spain, July 1983, ed. J. Diaz, Lecture Notes in Computer Science 154 (Springer-Verlag), 52-66.
  45. J.W. de Bakker and J.I. Zucker (1982): Processes and the denotational semantics of concurrency, Information and Control, 54, 70-120. Reprinted, with errata, in Studies in Concurrency Semantics: Selected Papers of the Amsterdam Concurrency Group, ed. J.W. de Bakker and J.J.M.M. Rutten (World Scientific Publ. Co., 1992), 28-80.
  46. J.W. de Bakker and J.I. Zucker (1982): Denotational semantics of concurrency, Proceedings of the 14th ACM Symposium on the Theory of Computing, San Francisco, May 1982, 153-158.
  47. J.I. Zucker (1980): Expressibility of pre- and post-conditions. Appendix in Mathematical Theory of Program Correctness by J.W. de Bakker (Prentice-Hall, 1980), 444-465.
  48. J.I. Zucker and R.S. Tragesser (1978): The adequacy problem for inferential logic, Journal of Philosophical Logic, 7, 501-516.
  49. J.I. Zucker (1978): The adequacy problem for classical logic, Journal of Philosophical Logic, 7, 517-535.
  50. J.I. Zucker (1977): Formalization of classical mathematics in AUTOMATH, Clermont-Ferrand, France, July 1975, Colloques Internationaux du Centre National de la Recherche Scientifique, No. 249 (Centre National de la Recherche Scientifique, Paris). Reprinted in Selected Papers in Automath, ed. R.P. Nederpelt and H. Geuvers (North-Holland, 1994), 127-139.
  51. J.I. Zucker (1974): The correspondence between cut-elimination and normalization. Part I. Intuitionistic predicate logic, Annals of Mathematical Logic, 7, 1-112.
  52. J.I. Zucker (1974): The correspondence between cut-elimination and normalization. Part II. Heyting's arithmetic, Annals of Mathematical Logic, 7, 113-155.
  53. J.I. Zucker (1973): Iterated inductive definitions, trees and ordinals. Chapter 6 of Mathematical Investigation of Intuitionistic Arithmetic and Analysis, ed. A.S. Troelstra, Lecture Notes in Mathematics, 344 (Springer-verlag). Second corrected edition (Institute for Logic, Language and Computation, University of Amsterdam, 1993), 392-453.



Last revised March 11, 2015. (Please inform me of any bad links)
zucker@mcmaster.ca