J. V. Tucker

Kenneth Johnson, John V. Tucker: The data type of spatial objects. Formal Asp. Comput. 25(2): 189-218 (2013)

Edwin J. Beggs, José Félix Costa, John V. Tucker: The impact of models of a physical oracle on computational power. Mathematical Structures in Computer Science 22(5): 853-879 (2012)

Kenneth Johnson, John V. Tucker: Algebraic Specifications of Computing as a Service with Applications to Cost Analysis. UCC 2012: 143-150

Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker: Stability of representations of effective partial algebras. Math. Log. Q. 57(2): 217-231 (2011)

John V. Tucker, Jeffery I. Zucker: Continuity of operators on continuous and discrete time streams. Theor. Comput. Sci. 412(28): 3378-3403 (2011)

Edwin J. Beggs, José Félix Costa, John V. Tucker: Limits to measurement in experiments governed by algorithms. Mathematical Structures in Computer Science 20(6): 1019-1050 (2010)

Edwin J. Beggs, J. V. Tucker: Computations via Newtonian and relativistic kinematic systems. Applied Mathematics and Computation 215(4): 1311-1322 (2009)

B. C. Thompson, J. V. Tucker, Jeffery I. Zucker: Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. Applied Mathematics and Computation 215(4): 1386-1403 (2009)

Edwin J. Beggs, José Félix Costa, John V. Tucker: Physical Experiments as Oracles. Bulletin of the EATCS 97: 137-151 (2009)

Jan A. Bergstra, Yoram Hirshfeld, J. V. Tucker: Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009)

Edwin J. Beggs, José Félix Costa, John V. Tucker: Limits to measurement in experiments governed by algorithms. CoRR abs/0911.3836 (2009)

Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker: Stability for Effective Algebras. Electr. Notes Theor. Comput. Sci. 221: 3-15 (2008)

Jan A. Bergstra, John V. Tucker: Division Safe Calculation in Totalised Fields. Theory Comput. Syst. 43(3-4): 410-424 (2008)

Edwin J. Beggs, J. V. Tucker: Programming Experimental Procedures for Newtonian Kinematic Machines. CiE 2008: 52-66

Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker: Oracles and Advice as Measurements. UC 2008: 33-50

Jan A. Bergstra, J. V. Tucker: The rational numbers as an abstract data type. J. ACM 54(2) (2007)

Edwin J. Beggs, John V. Tucker: Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theor. Comput. Sci. 371(1-2): 4-19 (2007)

John V. Tucker, Jeffery I. Zucker: Computability of analog networks. Theor. Comput. Sci. 371(1-2): 115-146 (2007)

Edwin J. Beggs, J. V. Tucker: Embedding infinitely parallel computation in Newtonian kinematics. Applied Mathematics and Computation 178(1): 25-43 (2006)

Jan A. Bergstra, John V. Tucker: Elementary Algebraic Specifications of the Rational Complex Numbers. Essays Dedicated to Joseph A. Goguen 2006: 459-475

Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker (Eds.): Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Lecture Notes in Computer Science 3988, Springer 2006, isbn 3-540-35466-2

J. V. Tucker, Jeffery I. Zucker: Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. J. Log. Algebr. Program. 62(1): 71-108 (2005)

J. V. Tucker, Jeffery I. Zucker: A Network Model of Analogue Computation over Metric Algebras. CiE 2005: 515-529

J. V. Tucker, Jeffery I. Zucker: Abstract versus concrete computation on metric partial algebras. ACM Trans. Comput. Log. 5(4): 611-668 (2004)

Viggo Stoltenberg-Hansen, J. V. Tucker: Computable and continuous partial homomorphisms on metric partial algebras. Bulletin of Symbolic Logic 9(3): 299-334 (2003)

Min Chen, John V. Tucker, Richard H. Clayton, Arun V. Holden: Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology. I. J. Bifurcation and Chaos 13(12): 3591-3604 (2003)

D. Ll. L. Rees, Karen Stephenson, J. V. Tucker: The algebraic structure of interfaces. Sci. Comput. Program. 49(1-3): 47-88 (2003)

Min Chen, Richard H. Clayton, Arun V. Holden, J. V. Tucker: Visualising Cardiac Anatomy Using Constructive Volume Geometry. FIMH 2003: 30-38

Jens Blanck, Viggo Stoltenberg-Hansen, J. V. Tucker: Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theor. Comput. Sci. 284(2): 207-240 (2002)

J. V. Tucker, Jeffery I. Zucker: Abstract computability and algebraic specification. ACM Trans. Comput. Log. 3(2): 279-333 (2002)

J. V. Tucker, Jeffery I. Zucker: Abstract versus Concrete Computation on Metric Partial Algebras. CoRR cs.LO/0108007 (2001)

J. V. Tucker, Jeffery I. Zucker: Abstract Computability, Algebraic Specification and Initiality. CoRR cs.LO/0109001 (2001)

Min Chen, J. V. Tucker: Constructive Volume Geometry. Comput. Graph. Forum 19(4): 281-293 (2000)

Viggo Stoltenberg-Hansen, J. V. Tucker: Concrete Models of Computation for Topological Algebras. Theor. Comput. Sci. 219(1-2): 347-378 (1999)

J. V. Tucker, Jeffery I. Zucker: Computation by `While' Programs on Topological Partial Algebras. Theor. Comput. Sci. 219(1-2): 379-420 (1999)

Jens Blanck, Viggo Stoltenberg-Hansen, J. V. Tucker: Streams, Stream Transformers and Domain Representations. Prospects for Hardware Foundations 1998: 27-68

M. J. Poole, Arun V. Holden, J. V. Tucker: Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms. Prospects for Hardware Foundations 1998: 184-235

Bernhard Möller, J. V. Tucker (Eds.): Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA - New Hardware Design Methods, Survey Chapters. Lecture Notes in Computer Science 1546, Springer 1998, isbn 3-540-65461-5

Neal A. Harman, J. V. Tucker: Algebraic Models of Microprocessors: Architecture and Organisation. Acta Inf. 33(5): 421-456 (1996)

Jan A. Bergstra, J. V. Tucker: A Data Type Variety of Stack Algebras. Ann. Pure Appl. Logic 73(1): 11-36 (1995)

Jan A. Bergstra, J. V. Tucker: Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. J. ACM 42(6): 1194-1230 (1995)

Neal A. Harman, J. V. Tucker: Algebraic Models and the Correctness of Microprocessors. CHARME 1993: 92-108

J. V. Tucker, Jeffery I. Zucker: Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types. J. Log. Program. 13(1): 23-55 (1992)

J. V. Tucker, Jeffery I. Zucker: Theory of Computation over Stream Algebras, and its Applications. MFCS 1992: 62-80

Viggo Stoltenberg-Hansen, J. V. Tucker: Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms. REX Workshop 1992: 531-562

J. V. Tucker, Jeffery I. Zucker: Projections of Semicomputable Relations on Abstract Data Tzpes. Int. J. Found. Comput. Sci. 2(3): 267-296 (1991)

Viggo Stoltenberg-Hansen, J. V. Tucker: Algebraic and Fixed Point Equations over Inverse Limits of Algebras. Theor. Comput. Sci. 87(1): 1-24 (1991)

J. V. Tucker, Jeffery I. Zucker: Examples of Semicomputable Sets of Real and Complex Numbers. Constructivity in Computer Science 1991: 179-198

J. V. Tucker, S. S. Wainer, Jeffery I. Zucker: Provable Computable Functions on Abstract Data Types. ICALP 1990: 660-673

J. V. Tucker, Jeffery I. Zucker: Toward a General Theory of Computation and Specification over Abstract Data Types. ICCI 1990: 129-133

A. R. Martin, J. V. Tucker: The concurrent assignment representation of synchronous systems. Parallel Computing 9(2): 227-256 (1989)

J. V. Tucker, Jeffery I. Zucker: Horn Programs and Semicomputable Relations on Abstract Structures. ICALP 1989: 745-760

Viggo Stoltenberg-Hansen, J. V. Tucker: Complete Local Rings as Domains. J. Symb. Log. 53(2): 603-624 (1988)

Karl Meinke, J. V. Tucker: The Scope and Limits of Synchronous Concurrent Computation. Concurrency 1988: 163-180

Jan A. Bergstra, J. V. Tucker: Algebraic Specifications of Computable and Semicomputable Data Types. Theor. Comput. Sci. 50: 137-181 (1987)

A. R. Martin, J. V. Tucker: The Concurrent Assignment Representation of Synchronous Systems. PARLE (2) 1987: 369-386

Jan A. Bergstra, J. V. Tucker: Top-Down Design and the Algebra of Communicating Processes. Sci. Comput. Program. 5(2): 171-199 (1985)

Jan A. Bergstra, J. V. Tucker: The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Inf. 21: 293-320 (1984)

Jan A. Bergstra, J. V. Tucker: Hoare's Logic for Programming Languages with two Data Types. Theor. Comput. Sci. 28: 215-221 (1984)

Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95

Jan A. Bergstra, J. V. Tucker: Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. SIAM J. Comput. 12(2): 366-387 (1983)

Jan A. Bergstra, J. V. Tucker: Hoare's Logic and Peano's Arithmetic. Theor. Comput. Sci. 22: 265-284 (1983)

Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Algebraic Tools for System Construction. Logic of Programs 1983: 34-44

Peter R. J. Asveld, J. V. Tucker: Complexity Theory and the Operational Structure of Algebraic Programming Systems. Acta Inf. 17: 451-476 (1982)

Jan A. Bergstra, J. V. Tucker: The Completeness of the Algebraic Specification Methods for Computable Data Types. Information and Control 54(3): 186-200 (1982)

Jan A. Bergstra, J. V. Tucker: Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982)

Jan A. Bergstra, J. V. Tucker: Expressiveness and the Completeness of Hoare's Logic. J. Comput. Syst. Sci. 25(3): 267-284 (1982)

Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker: Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982)

Jan A. Bergstra, J. V. Tucker: Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. Theor. Comput. Sci. 17: 303-315 (1982)

Jan A. Bergstra, J. V. Tucker: Algebraically Specified Programming Systems and Hoare's Logic. ICALP 1981: 348-362

Jan A. Bergstra, J. V. Tucker: The Refinement of Specifications and the Stabiliy of Hoare's Logic. Logic of Programs 1981: 24-36

Jan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing: On the Power of Algebraic Specifications. MFCS 1981: 193-204

J. V. Tucker: Computability and the Algebra of Fields: Some Affine Constructions. J. Symb. Log. 45(1): 103-120 (1980)

Jan A. Bergstra, J. V. Tucker: A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. ICALP 1980: 76-90