Parameterized Programming

IEEE Transactions on Software Engineering

Volumn SE-10, Issue 5, 1984, Pages 528-543

  Goguen, Joseph A ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Adaptability; Index Terms; interfaces; logic programming; methodology; modularization; OBJ; parameterized; program library; program transformation; programming; reliability; reusability

Indexed keywords

REUSABLE SOFTWARE;

COMPUTER PROGRAMMING;

EID: 0021500605     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1984.5010277     Document Type: Article

References (50)

1. J. Backus, “Can programming be liberated from the von Neumann style?” Commun. ACM, vol. 21, no. 8, pp. 613–641, 1978.
2. J. A. Bergstra and J. V. Tucker, “Algebraic specifications of computable and semicomputable data structures,” Theoretical Comput. Sci., to be published.
3. G. Berry and P. L. Currien, “The applicative language CDS: Its denotational and operational semantics,” in Algebraic Methods in Semantics, M. Nivat and J. Reynolds, Eds. Cambridge, England: Cambridge Univ. Press, 1984, to be published.
4. R. M. Burstall and J. A. Goguen, “Putting theories together to make specifications,” in Proc. Fifth Int. Joint Conf. Artificial Intell., vol. 5, pp. 1045–1058, 1977.
5. R. M. Burstall and J. A. Goguen, “The semantics of Clear, a specification language,” Proc. 1979 Copenhagen Winter School on Abstract Software Specification (Lecture Notes in Computer Science, vol. 86). New York: Springer-Verlag, 1980, pp. 292–332.
6. R. M. Burstall and J. A. Goguen, “Algebras, theories and freeness: An introduction for computer scientists,” in Proc. 1981 Marktoberdorf NATO Summer School. Reidel, 1982.
7. R. M. Burstall, D. MacQueen, and D. Sanella, “HOPE: An experimental applicative language,” in Conf Rec. 1980 LISP Conf., Stanford Univ., Stanford, CA, 1980, pp. 136–143.
8. A. Colmerauer, H. Kanoui, and M. van Caneghem, “Etude et réalisation d'un systeme prolog,” Groupe d'Intelligence Artificielle, U.E.R. de Luminy, Universite d'Aix-Marseille II, France, Tech. Rep., 1979.
9. A. Colmerauer, H. Kanoui, “Etude et realisation d'un systeme prolog,” Groupe d'Intelligence Artificielle, U.E.R. de Luminy, Universite d'Aix-Marseille II, France, Tech.
10. Reference Manual for the Ada Programming Language. U.S. Dep. Defense, ANSI/MIL-STD-1815 A.
11. K. Futatsugi, “Hierarchical software development in HISP,” in Computer Science and Technologies 1982, T. Kitagawa, Ed. Amsterdam, The Netherlands: North-Holland, 1982, pp. 151–174.
12. J. Goguen, “Mathematical foundations of hierarchically organized systems,” in Global Systems Dynamics, E. Attinger, Ed. S. Karger, 1971, pp. 112–128.
13. J. A. Goguen, “Abstract errors for abstract data types,” in IFIP Working Conf. Formal Description Propramming Concepts, M.I.T., Cambridge, MA, 1977, P. Neuhold, Ed. New York: North-Holland, 1979.
14. J. A. Goguen, “Order sorted algebra,” Dep. Comput. Sci., Univ. California, Los Angeles, Semantics and Theory of Computation Rep. 14; also, J. Comput. Syst. Sci., to be published.
15. J. A. Goguen, “Algebraic specification,” in Research Directions in Software Technology, P. Wegner, Ed. Cambridge, MA: M.I.T. Press, 1979, pp. 370–376.
16. J. A. Goguen, “How to prove algebraic inductive hypotheses without induction: With applications to the correctness of data type representations,” in Proc. 5th Conf. Automated Deduction (Lecture Notes in Computer Science, vol. 87), W. Bibel and R. Kowalski, Eds. New York: Springer-Verlag, 1980.
17. J. A. Goguen, “Merged views, closed worlds and ordered sorts: Some novel database features in OBJ,” SRI International, Menlo Park, CA, Tech. Rep., 1982; also to appear in SIGMOD.
18. J. A. Goguen, “Suggestions for using and organizing libraries for Ada program development,” Tech. Rep. prepared for Ada Joint Program Office, SRI International, Menlo Park, CA, 1984.
19. J. A. Goguen and R. M. Burstall, “Introducing institutions,” in Proc. Logics of Programming Workshop (Lecture Notes in Computer Science, vol. 164), E. Clarke and D. Kozen, Eds. New York: Springer-Verlag, 1984, pp. 221–256.
20. J. A. Goguen and S. Ginali, “A categorical approach to general systems theory,” in Applied General Systems Research, G. Klir, Ed. New York: Plenum, 1978, pp. 257–270.
21. J. Goguen and J. Meseguer, “Rapid prototyping in the OBJ executable specification language,” Software Engineering Notes, vol. 7, no. 3, pp. 75–84, 1982; also in Proc. Rapid Prototyping Workshop.
22. J. Goguen and J. Meseguer, “Equality, types and generics for logic programming,” Center for the Study of Logic and Information, Stanford Univ., Stanford, CA, Tech. Rep. CSLI-84-5, Mar. 1984; see also Proc. 1984 Logic Programming Symp., Upsala, Sweden.
23. J. Goguen and J. Meseguer, An Initiality Primer. Book in preparation.
24. J. A. Goguen and K. Parsaye-Ghomi, “Algebraic denotational semantics using parameterized abstract modules,” in Formalizing Programming Concepts (Lecture Notes in Computer Science, vol. 107), J. Diaz and I. Ramos, Eds. Peniscola, Spain: Springer-Verlag, 1981, pp. 292–309.
25. J. A. Goguen and J. Tardo, “An introduction to OBJ: A language for writing and testing software specifications,” in Specification of Reliable Software. New York: IEEE Press, 1979, pp. 170–189.
26. J. A. Goguen, J. Meseguer, and D. Plaisted, “Programming with parameterized abtract objects in OBJ,” in Theory and Practice of Software Technology, D. Ferrari, M. Bolognani, and J. Goguen, Eds. Amsterdam, The Netherlands: North-Holland, 1982, pp. 163–193.
27. J. A. Goguen, J. W. Thatcher, and E. Wagner, “An initial algebra approach to the specification, correctness and implementation of abstract data types,” in Current Trends in Programming Methodology, R. Yeh, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1978, pp. 80-149; see also original version, IBM T. J. Watson Research Center, Yorktown Heights, NY, Tech. Rep. RC 6487, Oct. 1976.
28. J. A. Goguen, J. W. Thatcher, E. Wagner, and J. B. Wright, “Abstract data types as initial algebras and the correctness of data representations,” in Computer Graphics, Pattern Recognition and Data Structure. New York: IEEE Press 1975, pp. 89–93.
29. M. J. Gordon, R. Milner, and C. P. Wadsworth, Edinburgh LCF (Lecture Notes in Computer Science, vol. 78). New York: Springer-Verlag, 1979.
30. J. V. Guttag, “The specification and application to programming of abstract data types,” Ph.D. dissertation, Dep. Comput. Sci., Univ. Toronto, Toronto, Ont., Canada, Rep. CSRG-59, 1975.
31. J. V. Guttag, E. Horowitz, and D. R. Musser, “Abstract data types and software validation,” Commun. ACM, 1978.
32. C. M. Hoffman and M. J. O'Donnell, “Programming with equations,” ACM Trans. Programming Languages Syst., vol. 1, no. 4, pp. 83–112, 1982.
33. J. Hsiang, “Refutational theorem proving using term rewriting systems,” Ph.D. dissertation, Univ. Illinois, Urbana.
34. G. Huet, “Confluent reductions: Abstract properties and applications to term rewriting systems,” J. Ass. Comput. Mach., vol. 27, pp. 797–821, 1980; see also preliminary version in 18th IEEE Symp. Foundations Comput. Sci., 1977.
35. G. Huet and D. Oppen, “Equations and rewrite rules: A survey,” in Formal Language Theory: Perspectives and Open Problems, R. Book, Ed. New York: Academic, 1980.
36. M. A. Jackson, Principles of Program Design. New York: Academic, 1975.
37. J. P. Jouannaud, “Confluent and coherent equational term rewriting systems,” in Proc. 5th CAAP (Lecture Notes in Computer Science). New York: Springer-Verlag, 1983.
38. G. Levy and F. Sirovich, “TEL: A proof-theoretic language for efficient symbolically expression manipulation,” IEI, Tech. Rep., Nota Interna B77-3, Feb. 1977.
39. P. Lucas and T. Risch, “Representation of factual information by equations and their evaluation,” IBM Research, Yorktown Heights, NY, Tech. Rep., 1982.
40. J. McCarthy, M. Levin, et al., LISP 1.5 Programmer's Manual. Cambridge, MA: M.I.T. Press, 1966.
41. R. Milner, “A theory of type polymorphism in programming,” J. Comput. Syst. Sci., vol. 17, no. 3, pp. 348–375, 1978.
42. M. J. O'Donnell, Computing in Systems Described by Equations (Lecture Notes in Computer Science). New York: Springer-Verlag 1977.
43. D. L. Parnas, “Information distribution aspects of design methodology,” Inform. Processing, vol. 71, 1972.
44. D. L. Parnas, “A technique for software module specification,” Commun. vol. 1972.
45. D. Plaisted, “An initial algebra sematics for error presentations,” SRI International, Menlo Park, CA, 1982.
46. J. Reynolds, “Using category theory to design implicit conversions and generic operators,” in Semantics Directed Compiler Generation (Lecture Notes in Computer Science, vol. 94). New York: Springer-Verlag, 1980, pp. 211–258.
47. J. Tardo, “The design specification and implementation of OBJT: A language for writing and testing abstract algebraic program specifications,” Ph.D. dissertation, Dep. Comput. Sci., Univ. California, Los Angeles, 1981.
48. M. H. van Emden and R. A. Kowalski, “The semantics of predicate logic as a programming language,” J. Ass. Comput. Mach., vol. 23, no. 4, pp. 733–742, 1976.
49. M. Wand, “Algebraic theories and tree rewriting systems,” Dep. Comput. Sci., Indiana Univ., Bloomington, Tech. Rep. 66, 1977.
50. S. Zilles, “Abstract specification of data types.” Computation Structures Group, Massachusetts Inst. Technol., Cambridge, Tech. Rep. 119, 1974.