John V. Tucker

125 papers A* 4B 2C 7Misc 1Journal 86Unranked 21
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows.
ACM Trans. Comput. Log.
Jan A. Bergstra, John V. Tucker
2025 J jnl
Expressing entropy and cross-entropy in expansions of common meadows.
CoRR
Jan A. Bergstra, John V. Tucker
2025 J jnl
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2025 J jnl
Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts.
J. Log. Lang. Inf.
Jan A. Bergstra, John V. Tucker
2025 J jnl
On human-centred security: a new systems model based on modes and mode transitions.
J. Cybersecur.
Edwin J. Beggs, John V. Tucker, Victoria Wang
2024 J jnl
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows.
Comput. J.
Jan A. Bergstra, John V. Tucker
2024 — conf
Finite Approximations of the Common Meadow of Rational Numbers.
WADT
Jan A. Bergstra, John V. Tucker
2024 J jnl
Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero.
J. Log. Lang. Inf.
Jan A. Bergstra, John V. Tucker
2024 J jnl
On Defining Expressions for Entropy and Cross-Entropy: The Entropic Transreals and Their Fracterm Calculus.
Entropy
Jan A. Bergstra, John V. Tucker
2024 J jnl
On human-centred security: A new systems model based on modes and mode transitions.
CoRR
Edwin J. Beggs, John V. Tucker, Victoria Wang
2024 J jnl
Rings with common division, common meadows and their conditional equational theories.
CoRR
Jan A. Bergstra, John V. Tucker
2024 J jnl
Synthetic Fracterm Calculus.
J. Univers. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2023 J jnl
A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows.
CoRR
Jan A. Bergstra, John V. Tucker
2023 J jnl
Eager Equality for Rational Number Arithmetic.
ACM Trans. Comput. Log.
Jan A. Bergstra, John V. Tucker
2023 J jnl
Naive Fracterm Calculus.
J. Univers. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2023 J jnl
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness.
Comput. J.
Jan A. Bergstra, John V. Tucker
2022 J jnl
A model of systems with modes and mode transitions.
J. Log. Algebraic Methods Program.
Edwin J. Beggs, John V. Tucker
2022 J jnl
Partial arithmetical data types of rational numbers and their equational specification.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, John V. Tucker
2022 — conf
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory.
A Journey from Process Algebra via Timed Automata to Model Learning
Jan A. Bergstra, John V. Tucker
2022 J jnl
The dynamics of belief: continuously monitoring and visualising complex systems.
CoRR
Edwin J. Beggs, John V. Tucker
2022 J jnl
Which Arithmetical Data Types Admit Fracterm Flattening?
Sci. Ann. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2021 J jnl
A model of systems with modes and mode transitions.
CoRR
Edwin J. Beggs, John V. Tucker
2020 — conf
The Wheel of Rational Numbers as an Abstract Data Type.
WADT
Jan A. Bergstra, John V. Tucker
2018 — conf
An Algebraic Theory for Data Linkage.
WADT
Liang-Ting Chen, Markus Roggenbach, John V. Tucker
2018 J jnl
An algebraic theory for data linkage.
CoRR
Liang-Ting Chen, Markus Roggenbach, John V. Tucker
2018 J jnl
Analogue-digital systems and the modular decomposition of physical behaviour.
CoRR
Edwin J. Beggs, John V. Tucker
2018 J jnl
Classifying the Computational Power of Stochastic Physical Oracles.
Int. J. Unconv. Comput.
Edwin J. Beggs, Pedro Cortez, José Félix Costa, John V. Tucker
2017 J jnl
Computations with oracles that measure vanishing quantities.
Math. Struct. Comput. Sci.
Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker
2017 J jnl
Monitoring and Intervention: Concepts and Formal Models.
CoRR
Kenneth Johnson, John V. Tucker, Victoria Wang
2017 J jnl
Surveillance and identity: conceptual framework and formal models.
J. Cybersecur.
Victoria Wang, John V. Tucker
2016 — conf
Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations.
WADT
Kenneth Johnson, John V. Tucker, Victoria Wang
2014 J jnl
A Natural Computation Model of Positive Relativisation.
Int. J. Unconv. Comput.
Edwin J. Beggs, José Félix Costa, John V. Tucker
2014 J jnl
An analogue-Digital Church-Turing Thesis.
Int. J. Found. Comput. Sci.
Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker
2014 J jnl
Analogue-digital systems with modes of operation.
CoRR
Edwin J. Beggs, John V. Tucker
2014 J jnl
Computability of Operators on Continuous and Discrete Time Streams.
Comput.
John V. Tucker, Jeffery I. Zucker
2014 J jnl
Editor's Note.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, John V. Tucker
2014 J jnl
Formalising Surveillance and Identity.
CoRR
Victoria Wang, John V. Tucker
2014 J jnl
On the Role of Identity in Surveillance.
CoRR
Victoria Wang, John V. Tucker
2014 J jnl
Three Forms of Physical Measurement and their Computability.
Rev. Symb. Log.
Edwin J. Beggs, José Félix Costa, John V. Tucker
2013 — conf
On the Power of Threshold Measurements as Oracles.
UCNC
Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker
2013 J jnl
Oracles that measure thresholds: the Turing machine and the broken balance.
J. Log. Comput.
Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker
2013 — conf
Services2Cloud: A Framework for Revenue Analysis of Software-as-a-Service Provisioning.
CloudCom (2)
Kenneth Johnson, Yuanzhi Wang, Radu Calinescu, Ian Sommerville, Gordon D. Baxter, John V. Tucker
2013 J jnl
The data type of spatial objects.
Formal Aspects Comput.
Kenneth Johnson, John V. Tucker
2013 J jnl
Viewing Cybercommunities through the Lens of Modernity: The Case of Second Life.
Int. J. Virtual Communities Soc. Netw.
Victoria Wang, John V. Tucker, Kevin Haines
2012 Misc conf
Algebraic Specifications of Computing as a Service with Applications to Cost Analysis.
UCC
Kenneth Johnson, John V. Tucker
2012 J jnl
The impact of models of a physical oracle on computational power.
Math. Struct. Comput. Sci.
Edwin J. Beggs, José Félix Costa, John V. Tucker
2011 J jnl
Continuity of operators on continuous and discrete time streams.
Theor. Comput. Sci.
John V. Tucker, Jeffery I. Zucker
2011 J jnl
Stability of representations of effective partial algebras.
Math. Log. Q.
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker
2010 J jnl
Limits to measurement in experiments governed by algorithms.
Math. Struct. Comput. Sci.
Edwin J. Beggs, José Félix Costa, John V. Tucker
2010 J jnl
Physical Oracles: The Turing Machine and the Wheatstone Bridge.
Stud Logica
Edwin J. Beggs, José Félix Costa, John V. Tucker
2009 J jnl
Computations via Newtonian and relativistic kinematic systems.
Appl. Math. Comput.
Edwin J. Beggs, John V. Tucker
2009 J jnl
Limits to measurement in experiments governed by algorithms
CoRR
Edwin J. Beggs, José Félix Costa, John V. Tucker
2009 J jnl
Meadows and the equational specification of division.
Theor. Comput. Sci.
Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker
2009 J jnl
Physical Experiments as Oracles.
Bull. EATCS
Edwin J. Beggs, José Félix Costa, John V. Tucker
2009 J jnl
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms.
Appl. Math. Comput.
B. C. Thompson, John V. Tucker, Jeffery I. Zucker
2008 J jnl
Division Safe Calculation in Totalised Fields.
Theory Comput. Syst.
Jan A. Bergstra, John V. Tucker
2008 — conf
Fields, Meadows and Abstract Data Types.
Pillars of Computer Science
Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker
2008 C conf
On the Complexity of Measurement in Classical Physics.
TAMC
Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker
2008 C conf
Oracles and Advice as Measurements.
UC
Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker
2008 C conf
Programming Experimental Procedures for Newtonian Kinematic Machines.
CiE
Edwin J. Beggs, John V. Tucker
2008 C conf
Stability for Effective Algebras.
CCA
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker
2007 J jnl
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theor. Comput. Sci.
Edwin J. Beggs, John V. Tucker
2007 J jnl
Computability of analog networks.
Theor. Comput. Sci.
John V. Tucker, Jeffery I. Zucker
2007 J jnl
The rational numbers as an abstract data type.
J. ACM
Jan A. Bergstra, John V. Tucker
2006 — conf
Elementary Algebraic Specifications of the Rational Complex Numbers.
Essays Dedicated to Joseph A. Goguen
Jan A. Bergstra, John V. Tucker
2006 J jnl
Embedding infinitely parallel computation in Newtonian kinematics.
Appl. Math. Comput.
Edwin J. Beggs, John V. Tucker
2006 C ed.
Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings
CiE
Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker
2005 C conf
A Network Model of Analogue Computation over Metric Algebras.
CiE
John V. Tucker, Jeffery I. Zucker
2005 J jnl
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems.
J. Log. Algebraic Methods Program.
John V. Tucker, Jeffery I. Zucker
2004 J jnl
Abstract versus concrete computation on metric partial algebras.
ACM Trans. Comput. Log.
John V. Tucker, Jeffery I. Zucker
2004 — conf
Automatic program translation - a third way.
ISMSE
David P. Clark, Min Chen, John V. Tucker
2003 J jnl
Computable and continuous partial homomorphisms on metric partial algebras.
Bull. Symb. Log.
Viggo Stoltenberg-Hansen, John V. Tucker
2003 J jnl
Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology.
Int. J. Bifurc. Chaos
Min Chen, John V. Tucker, Richard H. Clayton, Arun V. Holden
2003 J jnl
The algebraic structure of interfaces.
Sci. Comput. Program.
D. Ll. L. Rees, Karen Stephenson, John V. Tucker
2003 — conf
Visualising Cardiac Anatomy Using Constructive Volume Geometry.
FIMH
Min Chen, Richard H. Clayton, Arun V. Holden, John V. Tucker
2002 J jnl
Abstract computability and algebraic specification.
ACM Trans. Comput. Log.
John V. Tucker, Jeffery I. Zucker
2002 J jnl
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
Theor. Comput. Sci.
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker
2001 J jnl
Abstract Computability, Algebraic Specification and Initiality
CoRR
John V. Tucker, Jeffery I. Zucker
2001 J jnl
Abstract versus Concrete Computation on Metric Partial Algebras
CoRR
John V. Tucker, Jeffery I. Zucker
2000 — ch.
Constructive Representations of Volumetric Environments.
Volume Graphics (Graphics)
Min Chen, John V. Tucker, Adrian Leu
2000 J jnl
Constructive Volume Geometry.
Comput. Graph. Forum
Min Chen, John V. Tucker
1999 — ch.
Computable Rings and Fields.
Handbook of Computability Theory
Viggo Stoltenberg-Hansen, John V. Tucker
1999 J jnl
Computation by 'While' Programs on Topological Partial Algebras.
Theor. Comput. Sci.
John V. Tucker, Jeffery I. Zucker
1999 J jnl
Concrete Models of Computation for Topological Algebras.
Theor. Comput. Sci.
Viggo Stoltenberg-Hansen, John V. Tucker
1998 — conf
Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms.
Prospects for Hardware Foundations
M. J. Poole, Arun V. Holden, John V. Tucker
1998 — ed.
Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA - New Hardware Design Methods, Survey Chapters
Prospects for Hardware Foundations
Bernhard Möller, John V. Tucker
1998 — conf
Streams, Stream Transformers and Domain Representations.
Prospects for Hardware Foundations
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker
1996 J jnl
Algebraic Models of Microprocessors: Architecture and Organisation.
Acta Informatica
Neal A. Harman, John V. Tucker
1995 J jnl
A Data Type Variety of Stack Algebras.
Ann. Pure Appl. Log.
Jan A. Bergstra, John V. Tucker
1995 J jnl
Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras.
J. ACM
Jan A. Bergstra, John V. Tucker
1993 — conf
Algebraic Models and the Correctness of Microprocessors.
CHARME
Neal A. Harman, John V. Tucker
1992 J jnl
Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types.
J. Log. Program.
John V. Tucker, Jeffery I. Zucker
1992 — conf
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms.
REX Workshop
Viggo Stoltenberg-Hansen, John V. Tucker
1992 B conf
Theory of Computation over Stream Algebras, and its Applications.
MFCS
John V. Tucker, Jeffery I. Zucker
1991 J jnl
Algebraic and Fixed Point Equations over Inverse Limits of Algebras.
Theor. Comput. Sci.
Viggo Stoltenberg-Hansen, John V. Tucker
1991 — conf
Examples of Semicomputable Sets of Real and Complex Numbers.
Constructivity in Computer Science
John V. Tucker, Jeffery I. Zucker
1991 J jnl
Projections of Semicomputable Relations on Abstract Data Tzpes.
Int. J. Found. Comput. Sci.
John V. Tucker, Jeffery I. Zucker
1990 A* conf
Provable Computable Functions on Abstract Data Types.
ICALP
John V. Tucker, Stanley S. Wainer, Jeffery I. Zucker
1990 C conf
Toward a General Theory of Computation and Specification over Abstract Data Types.
ICCI
John V. Tucker, Jeffery I. Zucker
1989 A* conf
Horn Programs and Semicomputable Relations on Abstract Structures.
ICALP
John V. Tucker, Jeffery I. Zucker
1989 J jnl
The concurrent assignment representation of synchronous systems.
Parallel Comput.
Andrew Richard Martin, John V. Tucker
1988 J jnl
Complete Local Rings as Domains.
J. Symb. Log.
Viggo Stoltenberg-Hansen, John V. Tucker
1988 — book
Program correctness over abstract data types, with error-state semantics.
John V. Tucker, Jeffery I. Zucker
1988 — conf
The Scope and Limits of Synchronous Concurrent Computation.
Concurrency
Karl Meinke, John V. Tucker
1987 J jnl
Algebraic Specifications of Computable and Semicomputable Data Types.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1987 — conf
The Concurrent Assignment Representation of Synchronous Systems.
PARLE (2)
Andrew Richard Martin, John V. Tucker
1985 J jnl
Top-Down Design and the Algebra of Communicating Processes.
Sci. Comput. Program.
Jan A. Bergstra, John V. Tucker
1984 J jnl
Hoare's Logic for Programming Languages with two Data Types.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1984 — conf
Process Algebra with Asynchronous Communication Mechanisms.
Seminar on Concurrency
Jan A. Bergstra, Jan Willem Klop, John V. Tucker
1984 J jnl
The Axiomatic Semantics of Programs Based on Hoare's Logic.
Acta Informatica
Jan A. Bergstra, John V. Tucker
1983 — conf
Algebraic Tools for System Construction.
Logic of Programs
Jan A. Bergstra, Jan Willem Klop, John V. Tucker
1983 J jnl
Hoare's Logic and Peano's Arithmetic.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1983 J jnl
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.
SIAM J. Comput.
Jan A. Bergstra, John V. Tucker
1982 J jnl
Complexity Theory and the Operational Structure of Algebraic Programming Systems.
Acta Informatica
Peter R. J. Asveld, John V. Tucker
1982 J jnl
Expressiveness and the Completeness of Hoare's Logic.
J. Comput. Syst. Sci.
Jan A. Bergstra, John V. Tucker
1982 J jnl
Floyds Principle, Correctness Theories and Program Equivalence.
Theor. Comput. Sci.
Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker
1982 J jnl
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1982 J jnl
The Completeness of the Algebraic Specification Methods for Computable Data Types
Inf. Control.
Jan A. Bergstra, John V. Tucker
1982 J jnl
Two Theorems About the Completeness of Hoare's Logic.
Inf. Process. Lett.
Jan A. Bergstra, John V. Tucker
1981 A* conf
Algebraically Specified Programming Systems and Hoare's Logic.
ICALP
Jan A. Bergstra, John V. Tucker
1981 B conf
On the Power of Algebraic Specifications.
MFCS
Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing
1981 — conf
The Refinement of Specifications and the Stabiliy of Hoare's Logic.
Logic of Programs
Jan A. Bergstra, John V. Tucker
1980 A* conf
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.
ICALP
Jan A. Bergstra, John V. Tucker
1980 J jnl
Computability and the Algebra of Fields: Some Affine Constructions.
J. Symb. Log.
John V. Tucker
1979 J jnl
On the adequacy of finite equational methods for data type specification.
ACM SIGPLAN Notices
Jan A. Bergstra, John V. Tucker