**
**

** CLASSIFIED LIST OF PUBLICATIONS
**

** **

** **

** **

I have
classified my research publications under the following headings:

**Algebraic specification
of data types**

**Logical foundations
of program verification**

**Domain representability and concrete
computability of topological data types **

**Synchronous concurrent algorithms and hardware**

**Synchronous concurrent algorithms
and dynamical systems**

** **

Within the sections
the publications are listed in the order of their publication date; often
this does *not* represent the order of their composition. Most,
but not all, publications are included. There are 4 books, 5 major survey
articles, and 80+ research papers. In addition, there are some unpublished
reports, lecture notes and general articles.

**
**

1.
J V Tucker and J I Zucker, * ***Program correctness over abstract
data types with error-state semantics**, North-Holland, Amsterdam, 1988,
pp. vii+212.

2.
K McEvoy and J V Tucker, **Theoretical foundations of VLSI design**,**
**edited work, Cambridge Tracts in Theoretical Computer Science, Cambridge
University Press, 1990, pp. xi+438.

3.
K Meinke and J V Tucker, **Many sorted logic and its applications**,**
**edited work, J Wiley & Sons, 1993, pp. vii+391.

4.
B Möller and J V Tucker, **Prospects for hardware foundations**,**
**edited work, Springer Lecture Notes in Computer Science, Vol 1546,
Springer Verlag, 1998, pp. x+468.

1.
K McEvoy and J V Tucker, * Theoretical foundations of hardware design,
* in K McEvoy and J V Tucker (eds.), **Theoretical foundations of
VLSI design**, Cambridge University Press, 1990, pp.1-62.

2.
K Meinke and J V Tucker, *Universal algebra*,** **in S. Abramsky,
D. Gabbay and T Maibaum (eds.) **Handbook of Logic in Computer Science.
Volume I: Mathematical Structures**, Oxford University Press, 1992,
pp.189-411.

**
**

3.**
**V Stoltenberg-Hansen and J V Tucker, *Effective algebras, ***
**in S Abramsky, D Gabbay and T Maibaum (eds.) **Handbook of Logic
in Computer Science. Volume IV: Semantic Modelling **, Oxford University
Press, 1995, pp.357-526.

**
**

4.
V Stoltenberg-Hansen and J V Tucker, *Computable rings and fields*,
in E Griffor (ed.), **Handbook of Computability Theory**, Elsevier,
1999, pp.363-447.

5.
J V Tucker and J I Zucker, *Computable functions and semicomputable
sets on many sorted algebras*,** **in S. Abramsky, D. Gabbay and
T Maibaum (eds.) **Handbook of Logic for Computer Science. Volume V**,
Oxford University Press, 317-523.

1.
J V Tucker, *Computability and the algebra of fields: Some affine
constructions*, **Journal of Symbolic Logic**, 45 (1980) 103-120.

2.
V Stoltenberg-Hansen and J V Tucker, *Computing roots of unity in
fields*,* ***Bulletin of the London Mathematical Society**,
12 (1980) 463-471.

See
also **Surveys **and** Domain Representability**.

**
**

**
**

1.
J V Tucker, *Computing in algebraic systems*, in F R Drake and S
S Wainer (eds.)* ***Recursion Theory, its Generalisations and Applications**,
London Mathematical Society Lecture Note Series 45, Cambridge University
Press, Cambridge, 1980, pp. 215-235.

2.
J Moldestad, V Stoltenberg-Hansen and J V Tucker, *Finite algorithmic
procedures and inductive definability*,** Mathematica Scandinavica**,**
**46 (1980) 62-76.

3.
J Moldestad, V Stoltenberg-Hansen and J V Tucker, *Finite algorithmic
procedures and computation theories*,** Mathematica Scandinavica**,
46 (1980) 77-94.

4.
P R J Asveld and J V Tucker, *Complexity theory and the operational
structure of algebraic programming systems*,** Acta Informatica**,
17 (1982) 451-476.

5.
J V Tucker, *Applications of computability theory over abstract data
types*, in J W Klop (ed.) **J W de Bakker: 25 Jaar Semantiek. Liber
Amicorum**, CWI Amsterdam, 1989, 421-432.

6.
J V Tucker and J I Zucker, * Horn programs and semicomputable relations
on abstract structures. *** **In G Ausiello, M Dezani-Ciancaglini,
S Ronchi Della Rocca (eds.) **Automata, Languages and Programming, Sixteenth
Colloquium, Stresa, 1989**, Springer Lecture Notes in Computer Science
372, Springer-Verlag, Berlin, 1989, pp.745-760.

7.
S S Wainer, J V Tucker and J I Zucker, *Provably computable functions
on abstract data types*, In M Patterson (ed) **Automata, Languages
and Programming, Seventeenth Colloquium, Coventry, 1990, **Springer
Lecture Notes in Computer Science 443, Springer-Verlag, 1990, pp.660-673.

8.
J V Tucker and J I Zucker, *Toward a general theory of computation and
specification over abstract data types, *in S G Akl, F Fiala, and W
W Koczkodaj (eds), **Advances in computation and information, May 1990**,
Canadian Scholars Press, 1990, pp.101-102. Also book republished in Springer
Lecture Notes in Computer Science 468, Springer-Verlag, Berlin, 1990,
129-133.

9.
J V Tucker, *Theory of computation and specification over abstract
data types and its applications*, in F L Bauer (ed), Proceedings of
NATO Summer School 1989 at Marktoberdorf, in **Logic, algebra and computation,***
* Springer, 1991, pp.1-39.

10.
J V Tucker and J I Zucker, *Examples of semicomputable sets of real
and complex numbers*, in J P Myers Jr and M J O'Donnell (eds), **Constructivity
in computer science,** Springer Lecture Notes in Computer Science 613,
Berlin, pp.179-198.

11.
J V Tucker and J I Zucker, *Projections of semicomputable relations
on abstract data types*, **International J of Foundations of Computer
Science** 2 (1991) 267-296.

12.
J V Tucker and J I Zucker, *Deterministic and nondeterministic computation,
and Horn programs, on abstract data types*, **Journal of Logic Programming**,
13 (1992) 23-55.

13.
J V Tucker and J I Zucker, *Theory of computation over stream algebras,
and its applications*, in I M Havel and V Koubek (eds) **Mathematical
Foundations of Computer Science 1992, 17th International Symposium, Prague**,
Springer Lecture Notes in Computer Science 629, Berlin, 62-80.

14.
J V Tucker and J I Zucker, *Provable computable selection functions
on abstract structures, *in P Aczel, H Simmons and S S Wainer (eds)**
Proof theory**, Cambridge University Press, 1993, 277-306.

15.
J V Tucker and J I Zucker, *Computable functions on stream algebras,
* in H Schwichtenberg (ed)*, *Proceedings of NATO Advanced Study
Institute, International Summer School 1993 at Marktoberdorf, in **Proof
and Computation,*** *Springer, 1994, 341-382.

16.
J V Tucker and J I Zucker, *Computation by while programs on topological
partial algebras, ***Theoretical Computer Science**, 219 (1999)
379-421.

17.
(with J I Zucker) *Infinitary initial algebraic specifications for
stream algebras,* in W Sieg, R Somer, C Talcott (editors),*Reflections
on the foundations of mathematics: Essays in honour of Solomon Feferman*,
Lecture Notes in Logic, volume 15, Association for Symbolic Logic, 2002,
234-253.

18.
J V Tucker and J I Zucker, *Abstract computability and algebraic
specification*, **ACM Transactions on Computational Logic**, 3
(2002), 279-333.

19.
J V Tucker and J I Zucker, *Abstract versus concrete models of computation
on partial metric algebras*, **ACM Transactions on Computational
Logic**, accepted.

20.
J V Tucker and J I Zucker, *Computable total functions, algebraic
specifications and dynamical systems*, **Journal of Algebraic and
Logic Programming**, accepted.

21.
J V Tucker and J I Zucker, *Origins of our theory of computation on
abstract data types at the Mathematical Centre, Amsterdam, 1979-80*,
J W de Bakker. Liber Amicorum, CWI Amsterdam, 2002

** Algebraic specification of data types
**

1.
J A Bergstra and J V Tucker, * On the adequacy of finite equational
methods for data type specification*,** ACM-SIGPLAN Notices**, 14.11
(1979) 13-18.

2.
J A Bergstra and J V Tucker, *A natural data type with a finite equational
final semantics specification but no effective equational initial semantics
specification*,** Bulletin of the European Association for Theoretical
Computer Science**, 11 (1980) 23-33.

3.
J A Bergstra and J V Tucker, *A characterisation of computable data
types by means of a finite equational specification method*,** **in
J W de Bakker and J van Leeuwen (eds.) **Automata, Languages and Programming,
Seventh Colloquium, Noordwijkerhout, 1980**, Springer Lecture Notes
in Computer Science 81, Springer-Verlag, Berlin, 1980, pp. 76-90.

4.
J A Bergstra, M Broy, J V Tucker and M Wirsing,* On the power of algebraic
specifications*,** **in J Gruska and M Chytil (eds.) ** Mathematical
Foundations of Computer Science 1981, Proceedings Strbske Pleso, Czechoslovakia**,
Springer Lecture Notes in Computer Science 118, Springer-Verlag, Berlin,
1981, pp. 192-204.

5.
J A Bergstra and J V Tucker, *The completeness of the algebraic specification
methods for data types*,** Information and Control**, 54 (1982)
186-200.

6.
J A Bergstra and J V Tucker, ** ***Initial and final algebra semantics
for data type specifications: two characterisation theorems*,** Society
for Industrial and Applied Mathematics (SIAM) Journal on Computing**,
12 (1983) 366-387.

7.
J A Bergstra and J V Tucker, *Algebraic specifications of computable
and semicomputable data types*, **Theoretical Computer Science**,
50 (1987) 137-181.

**
**

8.
J Derrick and J V Tucker,* Logic programming and abstract data types*,
in ** Proceedings of 1988 UK IT Conference**, held under the auspices
of the Information Engineering Directorate of the DTI, IEE, 217-219.

9.
J A Bergstra and J V Tucker, *Equational specifications for computable
data types: 6 hidden functions suffice and other sufficiency bounds*,**
** in J V Tucker and K Meinke (eds.), **Many sorted logic and its applications**,
J Wiley & Sons, 1993, pp.89-102.

10.
J A Bergstra and J V Tucker, *On bounds for the specification of
finite data types by means of equations and conditional equations*,**
**in J V Tucker and K Meinke (eds.), **Many sorted logic and its
applications**, J Wiley & Sons, 1993, pp.103-122.

11.
J A Bergstra and J V Tucker, *The data type variety of stack algebras,*
in H Barendregt, M Bezem and J W Klop (eds.), **Dirk van Dalen Festschrift**,
Department of Philosophy, University of Utrecht, 1993, pp.9-40.

Revised version in **Annals of Pure and Applied Logic,** 73 (1995)
11-36.

12.
J A Bergstra and J V Tucker, *Equational specifications, complete
term rewriting systems, and computable and semicomputable algebras*,
**Journal of ACM**, 42 (1995) 1194-1230.

13.
K Stephenson, J V Tucker and D Rees, *The algebraic structure of
interfaces,* Science of Computer Programming, 49 (2003), pp. 47-88.

**
**

Unpublished Report

J A Bergstra and J V Tucker, *The inescapable stack: an exercise in
algebraic specification with total functions*,** **Centre for Theoretical
Computer Science Report 13.88, University of Leeds, 1988, (32pp). Also
Programming Research Group, University of Amsterdam, Report P8804, 1988,
and second revised edition P8804b, 1990.

**
**

**
**

** Logical foundations of program verification
**

1.
J A Bergstra and J V Tucker, * Algebraically specified programming
systems and Hoare's logic*,** **in S Even and O Kariv (eds.)* ***
Automata, Languages and Programming, Eighth Colloquium, Acre, 1981**,
Springer Lecture Notes in Computer Science 115, Springer- Verlag, Berlin,
1981, pp. 348-362.

2.
J A Bergstra, J V Tucker and J. Tiuryn, *Floyd's principle, correctness
theories and program equivalence*,** Theoretical Computer Science**,
17 (1982) 113-149.

3.
J A Bergstra and J V Tucker, ** ***Some natural structures which
fail to possess a sound and decidable Hoare-like logic for their while-programs*,**
Theoretical Computer Science **17 (1982) 303-315.

4.
J A Bergstra and J V Tucker, ** ***Expressiveness and the completeness
of Hoare's logic*,** Journal Computer and System Sciences**, 25
(1982) 267-284.

5.
J A Bergstra and J V Tucker,* The refinement of specifications and
the stability of Hoare's logic*,** **in D Kozen (ed.) * ***Logics
of Programs**, Springer Lecture Notes in Computer Science 131, Springer-Verlag,
Berlin, 1982, pp. 24-36.

6.
J A Bergstra and J V Tucker, * Two theorems about the completeness
of Hoare's logic*,** Information Processing Letters**, 15.4 (1982)
143-149.

7.
J A Bergstra and J V Tucker, * Hoare's logic and Peano's arithmetic*,**
Theoretical Computer Science**, 22 (1983) 265-284.

8.
J A Bergstra and J V Tucker, *Hoare's logic for programming languages
with two data types*,** Theoretical Computer Science**, 28 (1984)
215-221.

9.
J A Bergstra and J V Tucker, *The axiomatic semantics of programs based
on Hoare's logic*, **Acta Informatica**, 21 (1984) 293-320.

**Domain
representability and concrete computability of topological data types
**

**
**

1.
V Stoltenberg-Hansen and J V Tucker, ** ***Complete local rings
as domains*, **Journal of Symbolic Logic**, 53 (1988) 603-624.

2.
V Stoltenberg-Hansen and J V Tucker, ** ***Algebraic equations and
fixed-point equations in inverse limits*,** Theoretical Computer Science**,
87 (1991) 1-24.

3.
V Stoltenberg-Hansen and J V Tucker, *Infinite systems of equations
over inverse limits and infinite synchronous concurrent algorithms *in
J W de Bakker, G Rozenberg, and W P de Roever (eds.) **Semantics - Foundations
and applications**, Springer Lecture Notes in Computer Science 666,
Springer Verlag, 1993, 531-562.

4.
V Stoltenberg-Hansen and J V Tucker, *Concrete models of computation
for topological algebras*, **Theoretical Computer Science**, 219
(1999) 347-378.

5.
J Blanck, V Stoltenberg-Hansen and J V Tucker, *Streams, stream transformers
and domain representations*,** **in B Möller and J V Tucker (editors),
**Prospects for hardware foundations**, Springer Lecture Notes in
Computer Science, Vol 1546, 1998, 27-68.

6.
J Blanck, V Stoltenberg-Hansen and J V Tucker, *Domain representations
of partial functions, with applications to spatial objects and constructive
volume geometry,* **Theoretical Computer Science**, 284 (2002)
207-240.

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

**
**

See
also** Surveys.
**

**
**

**
**

1.
J A Bergstra and J V Tucker, *Top-down design and the algebra of
communicating processes*,** Science of Computer Programming**, 5 (1985)
171-199.

2.
J A Bergstra, J W Klop and J V Tucker, * Process algebra with asynchronous
communication mechanisms*,** **in S D Brookes, A W Roscoe and G
Winskel (eds.) **Seminar on Concurrency**, Springer Lecture Notes in
Computer Science 197, Berlin 1985, pp. 76-95.

3.
J A Bergstra, J-W Klop and J V Tucker, * Algebraic tools for system
construction*,** **in E Clarke and D Kozen (eds.) **Logics of
Programs**, Springer Lecture Notes in Computer Science 164, Springer-Verlag,
Berlin, 1985, pp. 34-44.

**
**

**
**

**Synchronous
concurrent algorithms and hardware
**

1.
B C Thompson and J V Tucker, *Theoretical considerations in algorithm
design*,** **in R A Earnshaw (ed.) **Fundamental Algorithms for
Computer Graphics**, Springer, Heidelberg 1985, pp. 855-878.

2.
A R Martin and J V Tucker, *Concurrent assignment representation
of synchronous systems*, in J W de Bakker, A J Nijman and P C Treleaven
(eds.) **PARLE: Parallel architectures and languages Europe. Vol II:
Parallel languages**, Springer Lecture Notes in Computer Science 259,
Springer-Verlag, 1987, pp. 369-386. A revised version of this paper appeared
in **Parallel Computing**, 9 (1988-89) 227-256.

3.
S M Eker and J V Tucker, *Specification, derivation and verification
of concurrent line drawing algorithms and architectures*, in R A Earnshaw
(ed.) **Theoretical foundations of computer graphics and CAD**, Springer-Verlag,
Heidelberg, 1988, pp. 449-516.

4.
K Meinke and J V Tucker, *Scope and limits of synchronous concurrent
computation*, in F H Vogt (ed)* ***Concurrency `88**, Springer
Lecture Notes in Computer Science 335, Springer-Verlag, 163-180.

5.
B C Thompson and J V Tucker, *A parallel deterministic language and
its application to synchronous concurrent algorithms*, in **Proceedings
of 1988 UK IT Conference**, held under the auspices of the Information
Engineering Directorate of the Department of Trade and Industry (DTI),
Institute of Electrical Engineers (IEE), 228-231.

6.
N A Harman and J V Tucker, *Formal specifications and the design of
verifiable computers*, in **Proceedings of 1988 UK IT Conference**,
held under the auspices of the Information Engineering Directorate of
the DTI, IEE, 500-503.

7.
S M Eker and J V Tucker, * Specification and verification of synchronous
concurrent algorithms: a case study of the Pixel Planes architecture*,**
** in P M Dew, R A Earnshaw, and T R Heywood (eds), **Parallel processing
for computer vision and display**, Addison- Wesley, 1989, pp.16-49.

8.
S M Eker and J V Tucker, *Tools for the development of rasterisation
algorithms. *In R A Earnshaw and B Wyvill (eds) **New Advances in
Computer Graphics, Proceedings of Computer Graphics International '89**,
Springer Verlag, Tokyo, 1989, pp.53-89.

9.
N A Harman and J V Tucker, * The formal specification of a digital
correlator I : User specification process*, in K McEvoy and J V Tucker
(eds), **Theoretical foundations of VLSI design**, Cambridge University
Press, 1990, pp.161-262.

10.
P M Dew, E S King, J V Tucker and A Williams, ** ***The prioritizer
experiment: estimation and measurement of computation time in VLSI*,
in K McEvoy and J V Tucker (eds), **Theoretical foundations of VLSI design**,
Cambridge University Press, 1990, pp.347-401.

11.
K M Hobley, B C Thompson and J V Tucker, ** ***Specification and
verification of synchronous concurrent algorithms: a case study of a
convolution algorithm*,** **in G Milne (ed.) **The fusion of
hardware design and verification** (Proceedings of IFIP Working Group
10.2 Working Conference) North-Holland, pp.347-374.

12.
N A Harman and J V Tucker, *Clocks, retimings, and the formal specification
of a UART*, in G Milne (ed) **The fusion of hardware design and verification
**(Proceedings of IFIP Working Group 10.2 Working Conference), North-Holland,
pp.375-396.

13.
S M Eker, V Stavridou and J V Tucker, *Verification of synchronous
concurrent algorithms using OBJ3. A case study of the Pixel Planes architecture,*
In G Jones and M Sheeran (eds) **Designing Correct Circuits**, Springer,
1991, pp.231-252.

14.
N.A. Harman and J V Tucker, ** ***Consistent refinements of specifications
for digital systems*, in: P Prinetto and P Camurati (eds.) Proceedings
of ESPRIT BRA CHARME Advanced Research Worksop on **Correct hardware
design methodologies**, Elsevier, Amsterdam, 1991, pp.281-304.

15.
B McConnell and J V Tucker, *Infinite synchronous concurrent algorithms:
the specification and verification of a hardware stack*, in F L Bauer,
W Brauer, H Schwichtenberg (eds), Proceedings of NATO Summer School
1991 at Marktoberdorf, in **Logic and algebra of specification,***
*Springer, 1993, 321-375.

16.
N A Harman and J V Tucker, *Algebraic models computers and the correctness
of micro processors, *in G J Milne and L Pierre (ed.), **Correct
hardware design and verification methods **(Proceedings of IFIP Working
Group 10.2, May 1993), Springer Lecture Notes in Computer Science 683, Berlin,
1993, 92-108.

17.
K Hobley and J V Tucker, *Clocks, retimings and the transformation
of synchronous concurrent algorithms*. in G Megson (ed), **Transformational
approaches to systolic design**, Chapman Hall, 1994, pp.99-132.

18.
N A Harman and J V Tucker, *Algebraic models of microprocessors:
architecture and organisation*, **Acta Informatica**, 33 (1996)
421-456.

19.
(with N A Harman),* Algebraic models of microprocessors: the verification
of a simple computer*, in V Stavridou (ed) **Mathematics for dependable
systems II**, Proceedings of the Second IMA Conference, Oxford University
Press, 1997, 135-169.

Unpublished Notes and Reports

J Derrick, G Lajos and J V Tucker, *Specification and verification
of synchronous concurrent algoithms using the Nuprl proof development system,
* Leeds, 1989.

B C Thompson and J V Tucker, *Equational specification of synchronous
concurrent algorithms and architectures*, Computer Division Research
Report CSR 9-91, University College of Swansea, 1991. Second Edition 1994.

**
**

See
also **Books**,** Surveys
**and** Lecture notes.
**

**
**

**Synchronous concurrent algorithms and dynamical systems
**

1.
A V Holden, B C Thompson and J V Tucker, *The computational structure
of neural systems*, in A V Holden and V I Kryukov (eds.) **Neurocomputers
and attention. I: Neurobiology, synchronisation and chaos,** Manchester
University Press, 1990, pp.223-240.

2.
A V Holden, B C Thompson and J V Tucker, *Can excitable media be
considered as computational systems?* in A V Holden, M Markus, H G Othmer
(eds.) **Nonlinear wave processes in excitable media,*** *Plenum,
New York, 1990, pp. 509-516. A revised version appears in **Physica D**
49 (1991) 240-246. The revised version is reprinted in Harry L Swinney
and Valentin I Krinsky (eds.) **Waves and patterns in chemical and biological
media**, MIT/North Holland, pp.240-246.

3.
A V Holden, B C Thompson, J V Tucker, D Withington, and H Zhang), * Theoretical
framework for synchronisation, coherence and chaos in real and simulated
neural networks, *in J G Taylor, E R Caianiello, R H Cotterill, and
J W Clark (ed.), **Neural network dynamics**, Perspectives in Neural
Computing, Springer-Verlag, 1992, pp.155-169.

4.
A V Holden, J V Tucker, H Zhang and M Poole, *Coupled map lattices as
computational systems, ***American Institute of Physics - Chaos **2
(1992),* *367-376.

5.
A V Holden, J V Tucker, M Poole and H Zhang, *Characterising the synchronisation
of a CML neural computing system*, **Chaos, Solitons and Fractals**,
4 (1994) 2249-2268.

6.
A V Holden, J V Tucker and M Poole, *Reconstructing the heart, *
**Chaos, Solitons and Fractals**, 5 (1995), 691-704.

**
**

7.
A V Holden, M Poole and J V Tucker, *Theoretical framework for analysis
and synthesis of networks of neurones,*** **in R Moreno-Diaz and
J Mira-Mira (eds),** Brain processes, theories and models**, MIT Press,
1996, 320-329.

8.
A V Holden, M Poole and J V Tucker, *An algorithmic model of the mammalian
heart: propogation, vulnerability, reentry and fibrillation, *** International
J of Bifurcation and Chaos,** 6 (1996) 1623-1635.

**
**

9.
M J Poole, J V Tucker and A V Holden, *Hierarchies of spatially extended
systems and synchronous concurrent algorithms, *in B Möller and J
V Tucker (editors), **Prospects for hardware foundations**, Springer
Lecture Notes in Computer Science Vol 1546, 1998, 184-235.

10.
M J Poole, J V Tucker and A V Holden,, *Hierarchical reconstructions
of cardiac tissue,*

**
Chaos, Solitons and Fractals**, 13 (2002) 1581-1612.

**
**

**
**

1.
M Chen J V Tucker and A Leu, *Constructive representations of volumetric
environments*, M Chen, A Kaufman and R Yagel (eds), **Volume graphics**,
Springer Verlag, 2000, 97-117.

2.
M Chen and J V Tucker, *Constructive volume geometry*, **Computer
Graphics Forum**, 19 (2000) 281-293.

3.
M Chen, R H Clayton, A V Holden, and J V Tucker, *Constructive volume
geometry applied to visualisation of cardiac anatomy and electrophysiology*,
submitted.

Unpublished Report

M Chen and J V Tucker, Constructive volume geometry, Technical report,
Department of Computer Science, University of Wales Swansea, 1998.

**
**

See
also **Domain representability
**

**
**

1.
T E Rihll and J V Tucker, *Greek Engineering. The Case of Eupalinos’
Tunnel*, in A Powell (ed), **The Greek world**, Routledge, 1995,
402-431.

2.
T E Rihll and J V Tucker, *Practice makes perfect: processing materials
in Classical Athens, *in C Tuplin and TE Rihll (ed), **Science and
mathematics in ancient Greek culture**, Oxford University Press, 2002,
274-305

**
**

1.**
**J V Tucker and K Stephenson, **Data, syntax and semantics.**

**
**Notes for the Second Year Undergraduate Course *Theory of
Programming Languages*, Department of Computer Science, University
of Wales Swansea, 1993. 10th Edition 2003, 550pp.

**
**

2.
A Wilder and J V Tucker, **Documenting computer systems using tables.**

**
**Notes for the Second Year Undergraduate Course *System Development,
*Department of Computer Science, University of Wales Swansea, Third
Edition 1996, 112pp.

**
**

3.**
**M Poole and J V Tucker,** Synchronous concurrent algorithms.**

**
**Notes for a Graduate/Final Year Undergraduate Course, Department
of Computer Science, University of Wales Swansea, Third Edition 1997,
198pp.

**
**

**
**

1.
*The Centre for Theoretical Computer Science*,** University of
Leeds Review** 29 (1986-7) 189-202.

2.
*New forms of computers*, **University College of Swansea, Annual
Report 1989-90, **September 1990, p14.

3.**
***Theoretical computer science at Swansea, ***Bulletin of
the European Association for Theoretical Computer Science**, 49 (1992)
340-345.

4.**
***Computation takes command, *Inaugural Lecture, Video, University
of Wales Swansea, November 1994.

5.
Entries in **Oxford Dictionary of Computing** (Fourth Edition), OUP,
1996. I revised 267 entries and contributed 37 new entries on theoretical
computer science.

Page last updated 8 June 2003 by J V Tucker.