On the adequacy of finite equational methods for data type specification. - Jan A. Bergstra; John V. Tucker (ACM SIGPLAN Notices, 1979)

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. - Jan A. Bergstra; John V. Tucker (ICALP, 1980)

Computability and the Algebra of Fields: Some Affine Constructions. - John V. Tucker (J. Symb. Log., 1980)

Algebraically Specified Programming Systems and Hoare's Logic. - Jan A. Bergstra; John V. Tucker (ICALP, 1981)

The Refinement of Specifications and the Stabiliy of Hoare's Logic. - Jan A. Bergstra; John V. Tucker (Logic of Programs, 1981)

On the Power of Algebraic Specifications. - Jan A. Bergstra; Manfred Broy; John V. Tucker; Martin Wirsing (MFCS, 1981)

Complexity Theory and the Operational Structure of Algebraic Programming Systems. - Peter R. J. Asveld; John V. Tucker (Acta Informatica, 1982)

Two Theorems About the Completeness of Hoare's Logic. - Jan A. Bergstra; John V. Tucker (Inf. Process. Lett., 1982)

Expressiveness and the Completeness of Hoare's Logic. - Jan A. Bergstra; John V. Tucker (J. Comput. Syst. Sci., 1982)

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

Floyds Principle, Correctness Theories and Program Equivalence. - Jan A. Bergstra; Jerzy Tiuryn; John V. Tucker (Theor. Comput. Sci., 1982)

The Completeness of the Algebraic Specification Methods for Computable Data Types - Jan A. Bergstra; John V. Tucker (Inf. Control., 1982)

Algebraic Tools for System Construction. - Jan A. Bergstra; Jan Willem Klop; John V. Tucker (Logic of Programs, 1983)

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

Hoare's Logic and Peano's Arithmetic. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1983)

Process Algebra with Asynchronous Communication Mechanisms. - Jan A. Bergstra; Jan Willem Klop; John V. Tucker (Seminar on Concurrency, 1984)

The Axiomatic Semantics of Programs Based on Hoare's Logic. - Jan A. Bergstra; John V. Tucker (Acta Informatica, 1984)

Hoare's Logic for Programming Languages with two Data Types. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1984)

Top-Down Design and the Algebra of Communicating Processes. - Jan A. Bergstra; John V. Tucker (Sci. Comput. Program., 1985)

Algebraic Specifications of Computable and Semicomputable Data Types. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1987)

Program correctness over abstract data types, with error-state semantics. - John V. Tucker; Jeffery I. Zucker (North-Holland, 1988)

The Scope and Limits of Synchronous Concurrent Computation. - Karl Meinke; John V. Tucker (Concurrency, 1988)

Complete Local Rings as Domains. - Viggo Stoltenberg-Hansen; John V. Tucker (J. Symb. Log., 1988)

Horn Programs and Semicomputable Relations on Abstract Structures. - John V. Tucker; Jeffery I. Zucker (ICALP, 1989)

The concurrent assignment representation of synchronous systems. - Andrew Richard Martin; John V. Tucker (Parallel Comput., 1989)

Provable Computable Functions on Abstract Data Types. - John V. Tucker; Stanley S. Wainer; Jeffery I. Zucker (ICALP, 1990)

Toward a General Theory of Computation and Specification over Abstract Data Types. - John V. Tucker; Jeffery I. Zucker (ICCI, 1990)

Examples of Semicomputable Sets of Real and Complex Numbers. - John V. Tucker; Jeffery I. Zucker (Constructivity in Computer Science, 1991)

Projections of Semicomputable Relations on Abstract Data Tzpes. - John V. Tucker; Jeffery I. Zucker (Int. J. Found. Comput. Sci., 1991)

Algebraic and Fixed Point Equations over Inverse Limits of Algebras. - Viggo Stoltenberg-Hansen; John V. Tucker (Theor. Comput. Sci., 1991)

Theory of Computation over Stream Algebras, and its Applications. - John V. Tucker; Jeffery I. Zucker (MFCS, 1992)

Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms. - Viggo Stoltenberg-Hansen; John V. Tucker (REX Workshop, 1992)

Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types. - John V. Tucker; Jeffery I. Zucker (J. Log. Program., 1992)

Algebraic Models and the Correctness of Microprocessors. - Neal A. Harman; John V. Tucker (CHARME, 1993)

A Data Type Variety of Stack Algebras. - Jan A. Bergstra; John V. Tucker (Ann. Pure Appl. Log., 1995)

Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. - Jan A. Bergstra; John V. Tucker (J. ACM, 1995)

Algebraic Models of Microprocessors: Architecture and Organisation. - Neal A. Harman; John V. Tucker (Acta Informatica, 1996)

Streams, Stream Transformers and Domain Representations. - Jens Blanck; Viggo Stoltenberg-Hansen; John V. Tucker (Prospects for Hardware Foundations, 1998)

Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms. - M. J. Poole; Arun V. Holden; John V. Tucker (Prospects for Hardware Foundations, 1998)

Computable Rings and Fields. - Viggo Stoltenberg-Hansen; John V. Tucker (Handbook of Computability Theory, 1999)

Concrete Models of Computation for Topological Algebras. - Viggo Stoltenberg-Hansen; John V. Tucker (Theor. Comput. Sci., 1999)

Computation by 'While' Programs on Topological Partial Algebras. - John V. Tucker; Jeffery I. Zucker (Theor. Comput. Sci., 1999)

Constructive Representations of Volumetric Environments. - Min Chen 001; John V. Tucker; Adrian Leu (Volume Graphics (Graphics), 2000)

Constructive Volume Geometry. - Min Chen 001; John V. Tucker (Comput. Graph. Forum, 2000)

Abstract Computability, Algebraic Specification and Initiality - John V. Tucker; Jeffery I. Zucker (CoRR, 2001)

Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. - Jens Blanck; Viggo Stoltenberg-Hansen; John V. Tucker (Theor. Comput. Sci., 2002)

Abstract computability and algebraic specification. - John V. Tucker; Jeffery I. Zucker (ACM Trans. Comput. Log., 2002)

Visualising Cardiac Anatomy Using Constructive Volume Geometry. - Min Chen 001; Richard H. Clayton; Arun V. Holden; John V. Tucker (FIMH, 2003)

Computable and continuous partial homomorphisms on metric partial algebras. - Viggo Stoltenberg-Hansen; John V. Tucker (Bull. Symb. Log., 2003)

Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology. - Min Chen 001; John V. Tucker; Richard H. Clayton; Arun V. Holden (Int. J. Bifurc. Chaos, 2003)

The algebraic structure of interfaces. - D. Ll. L. Rees; Karen Stephenson; John V. Tucker (Sci. Comput. Program., 2003)

Automatic program translation - a third way. - David P. Clark; Min Chen 001; John V. Tucker (ISMSE, 2004)

Abstract versus concrete computation on metric partial algebras. - John V. Tucker; Jeffery I. Zucker (ACM Trans. Comput. Log., 2004)

A Network Model of Analogue Computation over Metric Algebras. - John V. Tucker; Jeffery I. Zucker (CiE, 2005)

Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. - John V. Tucker; Jeffery I. Zucker (J. Log. Algebraic Methods Program., 2005)

Elementary Algebraic Specifications of the Rational Complex Numbers. - Jan A. Bergstra; John V. Tucker (Essays Dedicated to Joseph A. Goguen, 2006)

Embedding infinitely parallel computation in Newtonian kinematics. - Edwin J. Beggs; John V. Tucker (Appl. Math. Comput., 2006)

The rational numbers as an abstract data type. - Jan A. Bergstra; John V. Tucker (J. ACM, 2007)

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

Computability of analog networks. - John V. Tucker; Jeffery I. Zucker (Theor. Comput. Sci., 2007)

Fields, Meadows and Abstract Data Types. - Jan A. Bergstra; Yoram Hirshfeld; John V. Tucker (Pillars of Computer Science, 2008)

Programming Experimental Procedures for Newtonian Kinematic Machines. - Edwin J. Beggs; John V. Tucker (CiE, 2008)

On the Complexity of Measurement in Classical Physics. - Edwin J. Beggs; José Félix Costa; Bruno Loff; John V. Tucker (TAMC, 2008)

Oracles and Advice as Measurements. - Edwin J. Beggs; José Félix Costa; Bruno Loff; John V. Tucker (UC, 2008)

Stability for Effective Algebras. - Jens Blanck; Viggo Stoltenberg-Hansen; John V. Tucker (CCA, 2008)

Division Safe Calculation in Totalised Fields. - Jan A. Bergstra; John V. Tucker (Theory Comput. Syst., 2008)

Computations via Newtonian and relativistic kinematic systems. - Edwin J. Beggs; John V. Tucker (Appl. Math. Comput., 2009)

Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. - B. C. Thompson; John V. Tucker; Jeffery I. Zucker (Appl. Math. Comput., 2009)

Physical Experiments as Oracles. - Edwin J. Beggs; José Félix Costa; John V. Tucker (Bull. EATCS, 2009)

Meadows and the equational specification of division. - Jan A. Bergstra; Yoram Hirshfeld; John V. Tucker (Theor. Comput. Sci., 2009)

Limits to measurement in experiments governed by algorithms. - Edwin J. Beggs; José Félix Costa; John V. Tucker (Math. Struct. Comput. Sci., 2010)

Physical Oracles: The Turing Machine and the Wheatstone Bridge. - Edwin J. Beggs; José Félix Costa; John V. Tucker (Stud Logica, 2010)

Stability of representations of effective partial algebras. - Jens Blanck; Viggo Stoltenberg-Hansen; John V. Tucker (Math. Log. Q., 2011)

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

Algebraic Specifications of Computing as a Service with Applications to Cost Analysis. - Kenneth Johnson; John V. Tucker (UCC, 2012)

The impact of models of a physical oracle on computational power. - Edwin J. Beggs; José Félix Costa; John V. Tucker (Math. Struct. Comput. Sci., 2012)

Services2Cloud: A Framework for Revenue Analysis of Software-as-a-Service Provisioning. - Kenneth Johnson; Yuanzhi Wang; Radu Calinescu; Ian Sommerville; Gordon D. Baxter; John V. Tucker (CloudCom (2), 2013)

On the Power of Threshold Measurements as Oracles. - Edwin J. Beggs; José Félix Costa; Diogo Poças; John V. Tucker (UCNC, 2013)

The data type of spatial objects. - Kenneth Johnson; John V. Tucker (Formal Aspects Comput., 2013)

Viewing Cybercommunities through the Lens of Modernity: The Case of Second Life. - Victoria Wang; John V. Tucker; Kevin Haines (Int. J. Virtual Communities Soc. Netw., 2013)

Oracles that measure thresholds: the Turing machine and the broken balance. - Edwin J. Beggs; José Félix Costa; Diogo Poças; John V. Tucker (J. Log. Comput., 2013)

Computability of Operators on Continuous and Discrete Time Streams. - John V. Tucker; Jeffery I. Zucker (Comput., 2014)

Analogue-digital systems with modes of operation. - Edwin J. Beggs; John V. Tucker (CoRR, 2014)

On the Role of Identity in Surveillance. - Victoria Wang; John V. Tucker (CoRR, 2014)

Formalising Surveillance and Identity. - Victoria Wang; John V. Tucker (CoRR, 2014)

An analogue-Digital Church-Turing Thesis. - Edwin J. Beggs; José Félix Costa; Diogo Poças; John V. Tucker (Int. J. Found. Comput. Sci., 2014)

A Natural Computation Model of Positive Relativisation. - Edwin J. Beggs; José Félix Costa; John V. Tucker (Int. J. Unconv. Comput., 2014)

Editor's Note. - Jan A. Bergstra; John V. Tucker (J. Log. Algebraic Methods Program., 2014)

Three Forms of Physical Measurement and their Computability. - Edwin J. Beggs; José Félix Costa; John V. Tucker (Rev. Symb. Log., 2014)

Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations. - Kenneth Johnson; John V. Tucker; Victoria Wang (WADT, 2016)

Monitoring and Intervention: Concepts and Formal Models. - Kenneth Johnson; John V. Tucker; Victoria Wang (CoRR, 2017)

Surveillance and identity: conceptual framework and formal models. - Victoria Wang; John V. Tucker (J. Cybersecur., 2017)

Computations with oracles that measure vanishing quantities. - Edwin J. Beggs; José Félix Costa; Diogo Poças; John V. Tucker (Math. Struct. Comput. Sci., 2017)

An Algebraic Theory for Data Linkage. - Liang-Ting Chen 001; Markus Roggenbach; John V. Tucker (WADT, 2018)

Analogue-digital systems and the modular decomposition of physical behaviour. - Edwin J. Beggs; John V. Tucker (CoRR, 2018)

Classifying the Computational Power of Stochastic Physical Oracles. - Edwin J. Beggs; Pedro Cortez; José Félix Costa; John V. Tucker (Int. J. Unconv. Comput., 2018)

The Wheel of Rational Numbers as an Abstract Data Type. - Jan A. Bergstra; John V. Tucker (WADT, 2020)

Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory. - Jan A. Bergstra; John V. Tucker (A Journey from Process Algebra via Timed Automata to Model Learning, 2022)

The dynamics of belief: continuously monitoring and visualising complex systems. - Edwin J. Beggs; John V. Tucker (CoRR, 2022)

Which Arithmetical Data Types Admit Fracterm Flattening? - Jan A. Bergstra; John V. Tucker (Sci. Ann. Comput. Sci., 2022)

A model of systems with modes and mode transitions. - Edwin J. Beggs; John V. Tucker (J. Log. Algebraic Methods Program., 2022)

Partial arithmetical data types of rational numbers and their equational specification. - Jan A. Bergstra; John V. Tucker (J. Log. Algebraic Methods Program., 2022)

Teaching History of Computing. - John Vivian Tucker (UKICER, 2023)

Local Histories of Computing. - John Vivian Tucker (UKICER, 2023)

A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows. - Jan A. Bergstra; John V. Tucker (CoRR, 2023)

Eager Equality for Rational Number Arithmetic. - Jan A. Bergstra; John V. Tucker (ACM Trans. Comput. Log., 2023)

On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness. - Jan A. Bergstra; John V. Tucker (Comput. J., 2023)

Naive Fracterm Calculus. - Jan A. Bergstra; John V. Tucker (J. Univers. Comput. Sci., 2023)

Finite Approximations of the Common Meadow of Rational Numbers. - Jan A. Bergstra; John V. Tucker (WADT, 2024)

Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. - Jan A. Bergstra; John V. Tucker (Comput. J., 2024)

Rings with common division, common meadows and their conditional equational theories. - Jan A. Bergstra; John V. Tucker (CoRR, 2024)

On human-centred security: A new systems model based on modes and mode transitions. - Edwin J. Beggs; John V. Tucker; Victoria Wang (CoRR, 2024)

Synthetic Fracterm Calculus. - Jan A. Bergstra; John V. Tucker (J. Univers. Comput. Sci., 2024)

Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero. - Jan A. Bergstra; John V. Tucker (J. Log. Lang. Inf., 2024)

For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 2025)

A Complete Finite Axiomatisation of the Equational Theory of Common Meadows. - Jan A. Bergstra; John V. Tucker (ACM Trans. Comput. Log., 2025)

Expressing entropy and cross-entropy in expansions of common meadows. - Jan A. Bergstra; John V. Tucker (CoRR, 2025)