default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn V. Tucker
John Vivian Tucker
Person information
- affiliation: Swansea University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j65]Jan A. Bergstra
, John V. Tucker:
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. Comput. J. 67(5): 1866-1871 (2024)- [j64]Jan A. Bergstra, John V. Tucker:
Synthetic Fracterm Calculus. J. Univers. Comput. Sci. 30(3): 289-307 (2024) - [i14]Jan A. Bergstra, John V. Tucker:
Rings with common division, common meadows and their conditional equational theories. CoRR abs/2405.01733 (2024) - [i13]Edwin J. Beggs, John V. Tucker, Victoria Wang:
On human-centred security: A new systems model based on modes and mode transitions. CoRR abs/2405.02043 (2024) - 2023
- [j63]Jan A. Bergstra, John V. Tucker:
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness. Comput. J. 66(7): 1565-1572 (2023) - [j62]Jan A. Bergstra, John V. Tucker:
Naive Fracterm Calculus. J. Univers. Comput. Sci. 29(9): 961-987 (2023) - [j61]Jan A. Bergstra, John V. Tucker:
Eager Equality for Rational Number Arithmetic. ACM Trans. Comput. Log. 24(3): 22:1-22:28 (2023) - [c35]John Vivian Tucker:
Teaching History of Computing. UKICER 2023: 23:1 - [c34]John Vivian Tucker:
Local Histories of Computing. UKICER 2023: 24:1 - [i12]Jan A. Bergstra, John V. Tucker:
A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows. CoRR abs/2307.04270 (2023) - 2022
- [j60]Jan A. Bergstra, John V. Tucker:
Which Arithmetical Data Types Admit Fracterm Flattening? Sci. Ann. Comput. Sci. 32(1): 87-107 (2022) - [j59]Edwin J. Beggs, John V. Tucker:
A model of systems with modes and mode transitions. J. Log. Algebraic Methods Program. 127: 100774 (2022) - [j58]Jan A. Bergstra, John V. Tucker:
Partial arithmetical data types of rational numbers and their equational specification. J. Log. Algebraic Methods Program. 128: 100797 (2022) - [c33]Jan A. Bergstra, John V. Tucker:
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 63-80 - [i11]Edwin J. Beggs, John V. Tucker:
The dynamics of belief: continuously monitoring and visualising complex systems. CoRR abs/2208.05764 (2022) - 2021
- [i10]Edwin J. Beggs, John V. Tucker:
A model of systems with modes and mode transitions. CoRR abs/2107.06152 (2021) - 2020
- [c32]Jan A. Bergstra, John V. Tucker:
The Wheel of Rational Numbers as an Abstract Data Type. WADT 2020: 13-30
2010 – 2019
- 2018
- [j57]Edwin J. Beggs, Pedro Cortez, José Félix Costa, John V. Tucker:
Classifying the Computational Power of Stochastic Physical Oracles. Int. J. Unconv. Comput. 14(1): 59-90 (2018) - [c31]Liang-Ting Chen, Markus Roggenbach, John V. Tucker:
An Algebraic Theory for Data Linkage. WADT 2018: 47-66 - [i9]Edwin J. Beggs, John V. Tucker:
Analogue-digital systems and the modular decomposition of physical behaviour. CoRR abs/1804.05539 (2018) - [i8]Liang-Ting Chen, Markus Roggenbach, John V. Tucker:
An algebraic theory for data linkage. CoRR abs/1810.08096 (2018) - 2017
- [j56]Victoria Wang, John V. Tucker:
Surveillance and identity: conceptual framework and formal models. J. Cybersecur. 3(3): 145-158 (2017) - [j55]Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker:
Computations with oracles that measure vanishing quantities. Math. Struct. Comput. Sci. 27(8): 1315-1363 (2017) - [i7]Kenneth Johnson, John V. Tucker, Victoria Wang:
Monitoring and Intervention: Concepts and Formal Models. CoRR abs/1701.07484 (2017) - 2016
- [c30]Kenneth Johnson, John V. Tucker, Victoria Wang:
Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations. WADT 2016: 13-35 - 2014
- [j54]John V. Tucker, Jeffery I. Zucker:
Computability of Operators on Continuous and Discrete Time Streams. Comput. 3(1): 9-44 (2014) - [j53]Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker:
An analogue-Digital Church-Turing Thesis. Int. J. Found. Comput. Sci. 25(4): 373-390 (2014) - [j52]Edwin J. Beggs, José Félix Costa, John V. Tucker:
A Natural Computation Model of Positive Relativisation. Int. J. Unconv. Comput. 10(1-2): 111-141 (2014) - [j51]Jan A. Bergstra, John V. Tucker:
Editor's Note. J. Log. Algebraic Methods Program. 83(2): 82 (2014) - [j50]Edwin J. Beggs, José Félix Costa, John V. Tucker:
Three Forms of Physical Measurement and their Computability. Rev. Symb. Log. 7(4): 618-646 (2014) - [i6]Victoria Wang, John V. Tucker:
On the Role of Identity in Surveillance. CoRR abs/1408.3438 (2014) - [i5]Victoria Wang, John V. Tucker:
Formalising Surveillance and Identity. CoRR abs/1408.3439 (2014) - [i4]Edwin J. Beggs, John V. Tucker:
Analogue-digital systems with modes of operation. CoRR abs/1412.2643 (2014) - 2013
- [j49]Kenneth Johnson, John V. Tucker:
The data type of spatial objects. Formal Aspects Comput. 25(2): 189-218 (2013) - [j48]Victoria Wang, John V. Tucker, Kevin Haines:
Viewing Cybercommunities through the Lens of Modernity: The Case of Second Life. Int. J. Virtual Communities Soc. Netw. 5(1): 75-90 (2013) - [j47]Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker:
Oracles that measure thresholds: the Turing machine and the broken balance. J. Log. Comput. 23(6): 1155-1181 (2013) - [c29]Kenneth Johnson, Yuanzhi Wang, Radu Calinescu, Ian Sommerville, Gordon D. Baxter, John V. Tucker:
Services2Cloud: A Framework for Revenue Analysis of Software-as-a-Service Provisioning. CloudCom (2) 2013: 144-151 - [c28]Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker:
On the Power of Threshold Measurements as Oracles. UCNC 2013: 6-18 - 2012
- [j46]Edwin J. Beggs, José Félix Costa, John V. Tucker:
The impact of models of a physical oracle on computational power. Math. Struct. Comput. Sci. 22(5): 853-879 (2012) - [c27]Kenneth Johnson, John V. Tucker:
Algebraic Specifications of Computing as a Service with Applications to Cost Analysis. UCC 2012: 143-150 - 2011
- [j45]Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker:
Stability of representations of effective partial algebras. Math. Log. Q. 57(2): 217-231 (2011) - [j44]John V. Tucker, Jeffery I. Zucker:
Continuity of operators on continuous and discrete time streams. Theor. Comput. Sci. 412(28): 3378-3403 (2011) - 2010
- [j43]Edwin J. Beggs, José Félix Costa, John V. Tucker:
Limits to measurement in experiments governed by algorithms. Math. Struct. Comput. Sci. 20(6): 1019-1050 (2010) - [j42]Edwin J. Beggs, José Félix Costa, John V. Tucker:
Physical Oracles: The Turing Machine and the Wheatstone Bridge. Stud Logica 95(1-2): 279-300 (2010)
2000 – 2009
- 2009
- [j41]Edwin J. Beggs, John V. Tucker:
Computations via Newtonian and relativistic kinematic systems. Appl. Math. Comput. 215(4): 1311-1322 (2009) - [j40]B. C. Thompson, John V. Tucker, Jeffery I. Zucker:
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. Appl. Math. Comput. 215(4): 1386-1403 (2009) - [j39]Edwin J. Beggs, José Félix Costa, John V. Tucker:
Physical Experiments as Oracles. Bull. EATCS 97: 137-151 (2009) - [j38]Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker:
Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009) - [i3]Edwin J. Beggs, José Félix Costa, John V. Tucker:
Limits to measurement in experiments governed by algorithms. CoRR abs/0911.3836 (2009) - 2008
- [j37]Jan A. Bergstra, John V. Tucker:
Division Safe Calculation in Totalised Fields. Theory Comput. Syst. 43(3-4): 410-424 (2008) - [c26]Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker:
Fields, Meadows and Abstract Data Types. Pillars of Computer Science 2008: 166-178 - [c25]Edwin J. Beggs, John V. Tucker:
Programming Experimental Procedures for Newtonian Kinematic Machines. CiE 2008: 52-66 - [c24]Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker:
On the Complexity of Measurement in Classical Physics. TAMC 2008: 20-30 - [c23]Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker:
Oracles and Advice as Measurements. UC 2008: 33-50 - [c22]Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker:
Stability for Effective Algebras. CCA 2008: 3-15 - 2007
- [j36]Jan A. Bergstra, John V. Tucker:
The rational numbers as an abstract data type. J. ACM 54(2): 7 (2007) - [j35]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) - [j34]John V. Tucker, Jeffery I. Zucker:
Computability of analog networks. Theor. Comput. Sci. 371(1-2): 115-146 (2007) - 2006
- [j33]Edwin J. Beggs, John V. Tucker:
Embedding infinitely parallel computation in Newtonian kinematics. Appl. Math. Comput. 178(1): 25-43 (2006) - [c21]Jan A. Bergstra, John V. Tucker:
Elementary Algebraic Specifications of the Rational Complex Numbers. Essays Dedicated to Joseph A. Goguen 2006: 459-475 - [e2]Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker:
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 [contents] - 2005
- [j32]John V. Tucker, Jeffery I. Zucker:
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. J. Log. Algebraic Methods Program. 62(1): 71-108 (2005) - [c20]John V. Tucker, Jeffery I. Zucker:
A Network Model of Analogue Computation over Metric Algebras. CiE 2005: 515-529 - 2004
- [j31]John V. Tucker, Jeffery I. Zucker:
Abstract versus concrete computation on metric partial algebras. ACM Trans. Comput. Log. 5(4): 611-668 (2004) - [c19]David P. Clark, Min Chen, John V. Tucker:
Automatic program translation - a third way. ISMSE 2004: 265-272 - 2003
- [j30]Viggo Stoltenberg-Hansen, John V. Tucker:
Computable and continuous partial homomorphisms on metric partial algebras. Bull. Symb. Log. 9(3): 299-334 (2003) - [j29]Min Chen, John V. Tucker, Richard H. Clayton, Arun V. Holden:
Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology. Int. J. Bifurc. Chaos 13(12): 3591-3604 (2003) - [j28]D. Ll. L. Rees, Karen Stephenson, John V. Tucker:
The algebraic structure of interfaces. Sci. Comput. Program. 49(1-3): 47-88 (2003) - [c18]Min Chen, Richard H. Clayton, Arun V. Holden, John V. Tucker:
Visualising Cardiac Anatomy Using Constructive Volume Geometry. FIMH 2003: 30-38 - 2002
- [j27]Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker:
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theor. Comput. Sci. 284(2): 207-240 (2002) - [j26]John V. Tucker, Jeffery I. Zucker:
Abstract computability and algebraic specification. ACM Trans. Comput. Log. 3(2): 279-333 (2002) - 2001
- [i2]John V. Tucker, Jeffery I. Zucker:
Abstract versus Concrete Computation on Metric Partial Algebras. CoRR cs.LO/0108007 (2001) - [i1]John V. Tucker, Jeffery I. Zucker:
Abstract Computability, Algebraic Specification and Initiality. CoRR cs.LO/0109001 (2001) - 2000
- [j25]Min Chen, John V. Tucker:
Constructive Volume Geometry. Comput. Graph. Forum 19(4): 281-293 (2000) - [p2]Min Chen, John V. Tucker, Adrian Leu:
Constructive Representations of Volumetric Environments. Volume Graphics (Graphics) 2000: 97-117
1990 – 1999
- 1999
- [j24]Viggo Stoltenberg-Hansen, John V. Tucker:
Concrete Models of Computation for Topological Algebras. Theor. Comput. Sci. 219(1-2): 347-378 (1999) - [j23]John V. Tucker, Jeffery I. Zucker:
Computation by 'While' Programs on Topological Partial Algebras. Theor. Comput. Sci. 219(1-2): 379-420 (1999) - [p1]Viggo Stoltenberg-Hansen, John V. Tucker:
Computable Rings and Fields. Handbook of Computability Theory 1999: 363-447 - 1998
- [c17]Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker:
Streams, Stream Transformers and Domain Representations. Prospects for Hardware Foundations 1998: 27-68 - [c16]M. J. Poole, Arun V. Holden, John V. Tucker:
Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms. Prospects for Hardware Foundations 1998: 184-235 - [e1]Bernhard Möller, John V. Tucker:
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 [contents] - 1996
- [j22]Neal A. Harman, John V. Tucker:
Algebraic Models of Microprocessors: Architecture and Organisation. Acta Informatica 33(5): 421-456 (1996) - 1995
- [j21]Jan A. Bergstra, John V. Tucker:
A Data Type Variety of Stack Algebras. Ann. Pure Appl. Log. 73(1): 11-36 (1995) - [j20]Jan A. Bergstra, John V. Tucker:
Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. J. ACM 42(6): 1194-1230 (1995) - 1993
- [c15]Neal A. Harman, John V. Tucker:
Algebraic Models and the Correctness of Microprocessors. CHARME 1993: 92-108 - 1992
- [j19]John V. Tucker, Jeffery I. Zucker:
Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types. J. Log. Program. 13(1): 23-55 (1992) - [c14]John V. Tucker, Jeffery I. Zucker:
Theory of Computation over Stream Algebras, and its Applications. MFCS 1992: 62-80 - [c13]Viggo Stoltenberg-Hansen, John V. Tucker:
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms. REX Workshop 1992: 531-562 - 1991
- [j18]John V. Tucker, Jeffery I. Zucker:
Projections of Semicomputable Relations on Abstract Data Tzpes. Int. J. Found. Comput. Sci. 2(3): 267-296 (1991) - [j17]Viggo Stoltenberg-Hansen, John V. Tucker:
Algebraic and Fixed Point Equations over Inverse Limits of Algebras. Theor. Comput. Sci. 87(1): 1-24 (1991) - [c12]John V. Tucker, Jeffery I. Zucker:
Examples of Semicomputable Sets of Real and Complex Numbers. Constructivity in Computer Science 1991: 179-198 - 1990
- [c11]John V. Tucker, Stanley S. Wainer, Jeffery I. Zucker:
Provable Computable Functions on Abstract Data Types. ICALP 1990: 660-673 - [c10]John V. Tucker, Jeffery I. Zucker:
Toward a General Theory of Computation and Specification over Abstract Data Types. ICCI 1990: 129-133
1980 – 1989
- 1989
- [j16]Andrew Richard Martin, John V. Tucker:
The concurrent assignment representation of synchronous systems. Parallel Comput. 9(2): 227-256 (1989) - [c9]John V. Tucker, Jeffery I. Zucker:
Horn Programs and Semicomputable Relations on Abstract Structures. ICALP 1989: 745-760 - 1988
- [b1]John V. Tucker, Jeffery I. Zucker:
Program correctness over abstract data types, with error-state semantics. CWI monographs 6, North-Holland 1988, ISBN 978-0-444-70340-8, pp. I-VIII, 1-212 - [j15]Viggo Stoltenberg-Hansen, John V. Tucker:
Complete Local Rings as Domains. J. Symb. Log. 53(2): 603-624 (1988) - [c8]Karl Meinke, John V. Tucker:
The Scope and Limits of Synchronous Concurrent Computation. Concurrency 1988: 163-180 - 1987
- [j14]Jan A. Bergstra, John V. Tucker:
Algebraic Specifications of Computable and Semicomputable Data Types. Theor. Comput. Sci. 50: 137-181 (1987) - [c7]Andrew Richard Martin, John V. Tucker:
The Concurrent Assignment Representation of Synchronous Systems. PARLE (2) 1987: 369-386 - 1985
- [j13]Jan A. Bergstra, John V. Tucker:
Top-Down Design and the Algebra of Communicating Processes. Sci. Comput. Program. 5(2): 171-199 (1985) - 1984
- [j12]Jan A. Bergstra, John V. Tucker:
The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Informatica 21: 293-320 (1984) - [j11]Jan A. Bergstra, John V. Tucker:
Hoare's Logic for Programming Languages with two Data Types. Theor. Comput. Sci. 28: 215-221 (1984) - [c6]Jan A. Bergstra, Jan Willem Klop, John V. Tucker:
Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95 - 1983
- [j10]Jan A. Bergstra, John V. Tucker:
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. SIAM J. Comput. 12(2): 366-387 (1983) - [j9]Jan A. Bergstra, John V. Tucker:
Hoare's Logic and Peano's Arithmetic. Theor. Comput. Sci. 22: 265-284 (1983) - [c5]Jan A. Bergstra, Jan Willem Klop, John V. Tucker:
Algebraic Tools for System Construction. Logic of Programs 1983: 34-44 - 1982
- [j8]Peter R. J. Asveld, John V. Tucker:
Complexity Theory and the Operational Structure of Algebraic Programming Systems. Acta Informatica 17: 451-476 (1982) - [j7]Jan A. Bergstra, John V. Tucker:
The Completeness of the Algebraic Specification Methods for Computable Data Types. Inf. Control. 54(3): 186-200 (1982) - [j6]Jan A. Bergstra, John V. Tucker:
Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982) - [j5]Jan A. Bergstra, John V. Tucker:
Expressiveness and the Completeness of Hoare's Logic. J. Comput. Syst. Sci. 25(3): 267-284 (1982) - [j4]Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker:
Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982) - [j3]Jan A. Bergstra, John 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) - 1981
- [c4]Jan A. Bergstra, John V. Tucker:
Algebraically Specified Programming Systems and Hoare's Logic. ICALP 1981: 348-362 - [c3]Jan A. Bergstra, John V. Tucker:
The Refinement of Specifications and the Stabiliy of Hoare's Logic. Logic of Programs 1981: 24-36 - [c2]Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing:
On the Power of Algebraic Specifications. MFCS 1981: 193-204 - 1980
- [j2]John V. Tucker:
Computability and the Algebra of Fields: Some Affine Constructions. J. Symb. Log. 45(1): 103-120 (1980) - [c1]Jan A. Bergstra, John V. Tucker:
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. ICALP 1980: 76-90
1970 – 1979
- 1979
- [j1]Jan A. Bergstra, John V. Tucker:
On the adequacy of finite equational methods for data type specification. ACM SIGPLAN Notices 14(11): 13-18 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
