Categorical shape theory as a formal language for pattern recognition?

  • Timothy Porter


Categorical shape theory adopts a minimalist approach to pattern recognition. It assumes given a collection of archetypes and a collection of ‘objects of interest’, each collection being provided with an internal means of comparison between objects. The two collections are externally linked so as to allow comparison of objects of interest with archetypes. The structure of archetypes and of objects of interest is only observable via comparisons within these two categories. The categorical form of infinitary language is reviewed, including the ideas of equational theories. It is shown that categorical shape theory is the syntax of the abstract recognition process.


Neural Network Artificial Intelligence Pattern Recognition Complex System Nonlinear Dynamics 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.C.M. Baeten and W.D. Weijland,Process Algebra (Kluwer, Deventer, 1986).Google Scholar
  2. [2]
    J.A. Bergstra and J.W. Klop, Process algebra for synchronous communication, Information and Control 69 (1984) 109–137.Google Scholar
  3. [3]
    D. Bourn and J.-M. Cordier, Distributeurs et théorie de la forme, Cahiers Top. et Géom. Diff. 21 (1980) 161–189.Google Scholar
  4. [4]
    J.-M. Cordier and T. Porter,Shape Theory: Categorical Methods of Approximation, Mathematics and its Application (Ellis Horwood, 1989).Google Scholar
  5. [5]
    A.C. Ehresmann and J.-P. Vanbremeersch, Hierarchical evolutive systems: a mathematical model for complex systems, Bull. Math. Biol. 49 (1987) 13–50.Google Scholar
  6. [6]
    A.C. Ehresmann and J.-P. Vanbremeersch, Systèmes hiérarchiques évolutifs à mémoire autorégulée,Synergie et cohérence dans les systèmes biologiques, Séminaire Transdisciplinaire, Centre Interuniversitaire Jussieu-St. Bernard, May 1989.Google Scholar
  7. [7]
    J.-Y. Girard, Linear logic, Theor. Comput. Sci. 50 (1987) 1–102.Google Scholar
  8. [8]
    J.A. Goguen, Types as theories,Proc. Symp. on General Topology and its Applications, Oxford, June 1989 (Oxford University Press, 1990).Google Scholar
  9. [9]
    J.A. Goguen, A categorical manifesto, Math. Struct. Comp. Sci. 1 (1991) 49–67.Google Scholar
  10. [10]
    G.M. Kelly,The Basic Concepts of Enriched Category Theory, London Mathematical Society Lecture Notes, No. 64 (Cambridge University Press, 1983).Google Scholar
  11. [11]
    F.E.J. Linton, Some aspects of equational categories,Proc. Conf. Categorical on Algebra, La Jolla, 1965 (Springer, 1966) pp. 84–95.Google Scholar
  12. [12]
    S. MacLane,Categories for the Working Mathematician, Grad. Texts in Maths. Vol. 5 (Springer, 1971).Google Scholar
  13. [13]
    M. Makkai and R. Paré,Accessible Categories: The Foundations of Categorical Model Theory, Contemporary mathematics, Vol. 104 (1989).Google Scholar
  14. [14]
    E.G. Manes and M.A. Arbib,Algebraic Approaches to Program Semantics, Texts and Monographs in Computer Science (Springer, 1986).Google Scholar
  15. [15]
    N. Martí-Oliet and J. Meseguer, From Petri nets to linear logic, Math. Struct. Comp. Sci. 1 (1991) 69–101.Google Scholar
  16. [16]
    J. Meseguer and U. Montari, Petri nets are monoids, Informat. Computat. 88 (1990) 105–155.Google Scholar
  17. [17]
    R. Paré, Some applications of categorical model theory, categories in computer science and logic,Proc. of a Summer Research Conf., June 14–20, 1987, Contemporary Mathematics, Vol. 92 (1989).Google Scholar
  18. [18]
    M. Pavel,Fundamentals of Pattern Recognition (Marcel Dekker, 1989) Pure and Applied Mathematics, Vol. 124.Google Scholar
  19. [19]
    D.E. Rydeheard and J.G. Stell, Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms,Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 283 (1987).Google Scholar
  20. [20]
    S. Vickers,Topology via Logic, Cambridge Tracts in Theoretical Computer Science 5 (Cambridge University Press, 1989).Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1994

Authors and Affiliations

  • Timothy Porter
    • 1
  1. 1.School of MathematicsUniversity of Wales at BangorBangorUK

Personalised recommendations