Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes

C. Oriat

Diagrammes (1998)

  • Volume: 39, page 3-120
  • ISSN: 0224-3911

How to cite


Oriat, C.. "Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes." Diagrammes 39 (1998): 3-120. <http://eudml.org/doc/193061>.

author = {Oriat, C.},
journal = {Diagrammes},
keywords = {specifications; modularity; diagrams; colimits},
language = {fre},
pages = {3-120},
publisher = {Université Paris 7, Unité d'enseignement et de recherche de mathématiques},
title = {Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes},
url = {http://eudml.org/doc/193061},
volume = {39},
year = {1998},

AU - Oriat, C.
TI - Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes
JO - Diagrammes
PY - 1998
PB - Université Paris 7, Unité d'enseignement et de recherche de mathématiques
VL - 39
SP - 3
EP - 120
LA - fre
KW - specifications; modularity; diagrams; colimits
UR - http://eudml.org/doc/193061
ER -


  1. [AL91] A. Asperti and G. Longo. Categories, Types and Structures, An Introduction to Category Theory for the Working Computer Scientist. Foundations of Computing Science, MIT Press, 1991. Zbl0783.18001MR1159196
  2. [AM75] M. A. Arbib and E. G. Manes. Arrows, Structures and Functors: The Categorical Imperative. Academic Press, 1975. Zbl0374.18001MR364383
  3. [B+90] D. Bert et al. Reference manual of the specification language LPG. Technical Report 59, LIFIA, Mars 1990. Anonymous ftp at imag.fr, in /pub/SC0P/LPG/NewSun4/man-lpg.dvi. 
  4. [BBC86] G. Bernot, M. Bidoit, and C. Choppy. Abstract data types with exception handling: An initial approach based on a distinction between exception and errors. Theoretical Computer Science, 46(1) : 13-45, 1986. Zbl0603.68015MR868261
  5. [BDMN73] G. Birtwistle, O.-J. Dahl, B. Myrhaug, and K. Nygaard. Simula Begin. Auerbach Pub., New York, 1973. 
  6. [BE86] D. Bert and R. Echahed. Design and implementation of a generic, logic and functional programming language. In Proceedings of ESOP'86, number 213 in LNCS, pages 119-132. Springer-Verlag, 1986. Zbl0587.68003
  7. [Ber83] D. Bert. Refinements of generic specifications with algebraic tools. In Proceedings of IFIP'83, Paris, pages 815-820, 1983. 
  8. [Ber90] D. Bert. Spécification de logiciels réutilisables. Technical Report RR-828-I-IMAG-116, LIFIA, Octobre 1990. 
  9. [BG77] R. M. Burstall and J. A. Goguen. Putting theories together to make specifications. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, pages 1045-1058, 1977. 
  10. [BG80] R. M. Burstall and J. A. Goguen. The semantics of CLEAR, a specification language. In Proceedings of Advanced Course on Abstract Software Specification, number 86 in LNCS, pages 292-332. Springer-Verlag, 1980. Zbl0456.68024
  11. [BHK90] J. A. Bergstra, J. Heering, and R. Klint. Module algebra. J. ACM, 37(2) : 335-372, Apr. 1990. Zbl0696.68040MR1072262
  12. [Bid89] M. Bidoit. PLUSS, un langage pour le développement de spécifications algébriques modulaires, Mai 1989. Thèse d'Etat, Université de Paris-Sud. 
  13. [BL93] G. Bernot and P. Le Gall. Exception handling and term labelling. In Proceedings of TAPSOFT93, number 668 in LNCS, pages 421-436. Springer-Verlag, 1993. MR1252209
  14. [BO95] D. Bert and C. Oriat. A model inference system for generic specification with application to code sharing. In Proceedings of TAPSOFT'95, number 915 in LNCS, pages 741-755. Springer-Verlag, 1995. 
  15. [BR86] R. M. Burstall and D. Rydeheard. Computing with categories. Technical Report ECS-LFCS-86-9, University of Edinburgh, September 1986. Zbl0616.68011
  16. [Bur80] R. M. Burstall. Electronic category theory. In Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science, 1980. Zbl0462.68003MR599553
  17. [BW85] S. L. Bloom and E. G. Wagner. Many-sorted theories and their algebras with some applications to data types. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 4, pages 133-168. Cambridge University Press, 1985. Zbl0575.18004MR835451
  18. [BW90] M. Barr and C. Wells. Category Theory for Computing Science. Prentice-Hall International, 1990. Zbl0714.18001MR1094561
  19. [BW94] M. Barr and C. Wells. The categorical theory generated by a limit sketch, Nov. 1994. 
  20. [Car86] J. Cartmell. Generalized algebraic theories and contextual categories. Annals of Pure and Applied Logic, 32:209-243, 1986. Zbl0634.18003MR865990
  21. [Coh65] P. M. Cohn. Universal Algebra. Harper and Row, 1965. Revised version 1980. Zbl0141.01002MR175948
  22. [Cur91] F. Cury. Catégories lax-localement-cartésiennes et catégories localement cartésiennes : un exemple de suffisante complétude connexe de sémantiques initiales. In diagrammes, volume 25, pages 1-155, Université Paris 7, Juillet 1991. Zbl0815.18004MR1142466
  23. [DN66] O.-J. Dahl and K. Nygaard. Simula - an Algol-based simulation language. Communications of the ACM, 9:671-678, Sept. 1966. Zbl0139.32903
  24. [DR94a] D. Duval and J.-C. Reynaud. Sketches and computation (part 1): Basic definitions and static evaluation. Mathematical Structures in Computer Science, 4:185-238, 1994. Zbl0810.68096MR1281759
  25. [DR94b] D. Duval and J.-C. Reynaud. Sketches and computation (part 2): Dynamic evaluation and applications. Mathematical Structures in Computer Science, 4:239-271, 1994. Zbl0822.68063MR1281760
  26. [Ehr68] C. Ehresmann. Esquisses et types de structures algébriques. Bulletin de l'institut Polytechnique, Iasi 14, 1968. Zbl0196.03102MR238918
  27. [EJO93] H. Ehrig, R. M. Jimenez, and F. Orejas. Compositionality results for different types of parameterization and parameter passing in specification languages. In Proceedings of the 4th International Joint Conference CAAP/FASE, number 668 in LNCS, pages 31-45. Springer-Verlag, 1993. 
  28. [EM85] H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Equations and Initial Semantics, volume 6 of EATCS Monographs on Theorectical Computer Sceince. Springer-Verlag, 1985. Zbl0557.68013MR788495
  29. [EM90] H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 2. Module Specifications and Constraints, volume 21 of EATCS Monographs on Theorectical Computer Science. Springer-Verlag, 1990. Zbl0759.68013MR1036519
  30. [FGJM85] K. Futatsugi, J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proceedings of Principles of Programming Languages, pages 52-66, 1985. 
  31. [Gau84] M.-C. Gaudel. A first introduction to PLUSS. Technical report, Université d'Orsay, France, 1984. 
  32. [GB84] J. A. Goguen and R. M. Burstall. Introducing institutions. In Proceedings of the Workshop on Logic of Programming, number 164 in LNCS, pages 221-256. Springer-Verlag, 1984. Zbl0543.68021MR778942
  33. [GB90] J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for specification and programming. Research Report ECS-LFCS-90-106, University of Edinburgh, January 1990. 
  34. [GKK+87] J. A. Goguen, C. Kirchner, H. Kirchner, A. Mégrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In Proceedings of the 1st International Workshop on Conditional Term Rewriting Systems, number 308 in LNCS, pages 258-263. Springer-Verlag, 1987. Zbl0666.68010MR900615
  35. [Gog73] J. A. Goguen. Categorical foundations for general systems theory. In Advances in Cybernetics and System Research, pages 121-130. Transcripta Books, 1973. 
  36. [Gog92] J. A. Goguen. Sheaf semantics for concurrent interacting objects. Mathematical Structures in Computer Science, 2:159-191, 1992. Zbl0763.18005MR1171509
  37. [Gol79] R. Goldblatt. Topoi: The Categorial Analysis of Logic, volume 98 of Studies in Logic and the Foundations of Mathematics. North Holland, 1979. Zbl0434.03050MR551362
  38. [GTW78] J. A. Goguen, J. W. Thatcher, and E. G. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In R. T. Yeh, editor, Current Trends in Programming Methodology, volume 4: Data Structuring, pages 80-149. Prentice-Hall, 1978. 
  39. [GTWW75] J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright. Abstract data types as initial algebras and the correctness of data representation. In Computer Graphics, Pattern Recognition and Data Structure, pages 89-93, 1975. 
  40. [GTWW77] J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright. Initial algebra semantics and continuous algebra. J. ACM, 24:68-95, 1977. Zbl0359.68018MR520711
  41. [Gut75] J. V. Guttag. The specification and application to programming of abstract data types. PhD thesis, University of Toronto, 1975. 
  42. [Gut77] J. V. Guttag. Abstract data types and the development of data structures. Communication of the ACM, 6:396-404, 1977. Zbl0356.68022
  43. [Huf92] J.-M. Hufflen. Proposal for GLIDER version 1.0: Principles and main features. ICARUS Technical Report, INRIA-LORRAINE & CRIN, 1992. 
  44. [Law63] W. Lawvere. Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci.. 50:869-873, 1963. Zbl0119.25901MR158921
  45. [LCW85] D. Lorge Parnas, P. C. Clements, and D. M. Weiss. The modular structure of complex systems. IEEE Transactions on Software Engineering, SE-11(3):259-266, March 1985. 
  46. [LS86] J. Lambek and P. J. Scott. Introduction to higher order categorical logic. Cambridge studies in advanced mathematics, 1986. Zbl0596.03002MR856915
  47. [LZ74] B. Liskov and S. Zilles. Programming with abstract data types. ACM SIGPLAN Notices, 9(4):50-59, 1974. 
  48. [Mar95] A. Martins. La généralisation: un outil pour la réutilisation. PhD thesis, INPG, Grenoble, Mars 1995. 
  49. [MB70] S. Mac Lane and G. Birkhoff. Algèbre. 1. Structures fondamentales. Gauthier-Villars, 1970. Zbl0201.01801MR266716
  50. [McL71] S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971. Zbl0232.18001MR1712872
  51. [MG85] J. Meseguer and J. A. Goguen. Initiality, induction, and computability. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 14, pages 459-541. Cambridge University Press, 1985. Zbl0571.68004MR835461
  52. [Ori94] C. Oriat. Representing modular specifications as diagrams. In Compte Rendu des Journées du GDR Programmation, Lille, pages 53-68, Septembre 1994. 
  53. [Ori95] C. Oriat. Detecting isomorphisms of modular specifications with diagrams. In Proceedings of AMAST'95, number 936 in LNCS, pages 184-198. Springer-Verlag, 1995. 
  54. [Poi92] A. Poigné. Basic category theory. In Handbook of Logic in Computer Science, Volume 1. Background: Mathematical Structures, pages 413-640. Oxford Science Publication, 1992. MR1426366
  55. [Ren91] G. Renardel de Lavalette. Logical semantics of modularisation. In Proceedings of CSL '91, number 626 in LNCS, pages 306-315. Springer-Verlag, 1991. Zbl0819.68079MR1232896
  56. [Rey87] J.-C. Reynaud. Sémantique de LPG. Research Report 651 I IMAG, LIFIA, Mars 1987. 
  57. [Rey90a] J.-C. Reynaud. Putting algebraic components together: A dependent type approach. Research Report 810 I IMAG, LIFIA, Avril 1990. Extended version. MR1066214
  58. [Rey90b] J.-C. Reynaud. Putting algebraic components together: A dependent type approach. In Proceedings of DISCO'90, number 429 in LNCS. Springer-Verlag, 1990. MR1066214
  59. [Rey93] J.-C. Reynaud. Isomorphism of typed algebraic specifications. Internal Report, LGI-IMAG, Avril 1993. 
  60. [See84] R. A. G. Seely. Locally cartesian closed categories and type theory. Math. Proc. Camb. Phil. Soc, 95(33):33-48, 1984. Zbl0539.03048MR727078
  61. [SP77] M. B. Smyth and G. D. Plotkin. The category-theoretic solution of recursive domain equations. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 13-17, 1977. MR488968
  62. [SST92] D. Sannella, S. Sokolowski, and A. Tarlecki. Toward formal development of programs from algebraic specifications: Parameterisation revisited. Acta Informatica, 29:689-736, 1992. Zbl0790.68077MR1202065
  63. [ST88] D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76:165-210, 1988. Zbl0654.68017MR935895
  64. [SW83] D. Sannella and M. Wirsing. A kernal language for algebraic specification and implementation. In Proceedings of the 11th Colloquium on Foundations of Computation Theory, number 158 in LNCS, pages 413-427. Springer-Verlag, 1983. Zbl0517.68043MR734738
  65. [SW91] T. Streicher and M. Wirsing. Dependent types considered necessary for specification languages. In Proceedings of the 7th Workshop on Specification of Abstract Data Types, number 534 in LNCS, pages 323-339, 1991. 
  66. [TBG91] A. Tarlecki, R. M. Burstall, and J. A. Goguen. Some fundamental algebraic tools for the semantics of computation: Part 3. Indexed categories. Theoretical Computer Science, 91:239-264, 1991. Zbl0755.18004MR1142330
  67. [TWW82] J. W. Thatcher, E. G. Wagner, and J. B. Wright. Data type specification: Parameterization and the power of specification techniques. ACM Trans. Prog. Lang. Syst., 4:711-773, 1982. Zbl0495.68020MR521047
  68. [Wan79] M. Wand. Fixed-point constructions in order-enriched categories. Theoretical Computer Science, 8:13-30, 1979. Zbl0401.18005MR523657
  69. [WBT85] E. G. Wagner, S. L. Bloom, and J. W. Thatcher. Why algebraic theories? In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 17, pages 607-634. Cambridge University Press, 1985. Zbl0637.68019MR835464
  70. [Wir86] M. Wirsing. Structured algebraic specifications: A kernel language. Theoretical Computer Science, 42:123-249, 1986. Zbl0599.68021MR858687
  71. [Wir90] M. Wirsing. Algebraic specification. In J. van Leeuwen, editor, Hand-book of Theoretical Computer Science, chapter 13, pages 677-788. Elsevier Science Publishers B.V., 1990. Zbl0900.68309MR1127198
  72. [Wir94] M. Wirsing. Algebraic specification languages: An overview. In Recent Trends in Data Type Specification. 10th Workshop on Specification of Abstract Data Types, number 906 in LNCS, 1994. 

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.