General Logics

Studies in Logic and the Foundations of Mathematics

Volumn 129, Issue C, 1989, Pages 275-329

  Meseguer, José ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957664229     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(08)70132-0     Document Type: Article

References (73)

1. L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proceedings of the Symposium on Logic in Computer Science, pages 346–357, IEEE, June 1986.
2. Barwise, J., Feferman, S., (eds.) Model-Theoretic Logics, 1985, Springer-Verlag.
3. Barwise, K.J., Axioms for abstract model theory. Ann. Math. Logic. 7 (1974), 221–265.
4. Bénabou, Jean, Structures algébriques dans les catégories. Cahiere de Topologie et Géometrie Différentielle 10 (1968), 1–126.
5. Bergstra, Jan., Tucker, John, Characterization of computable data types by means of a finite equational specification method. de Bakker, J.W., van Leeuwen, J., (eds.) Automata, Languages and Programming, Seventh Colloquium, 1980, Springer-Verlag, 76–90 Lectures Notes in Computer Science, Volume 81.
6. Boileau, A., Joyal, A., La logique des topos. J. Symbol. Logic 46:1 (1981), 6–16.
7. Burstall, R., Lampson, B., A kernel language for abstract data types and modules. Kahn, G., MacQueen, D.B., Plotkin, G.D., (eds.) Semantics of Data Types, pages 1–50, Springer Lecture Notes in Computer Science, 173, 1984.
8. Cardelli, L., A polymorphic γ-calculus with Type: Type. Technical Report, 1985, DEC System Research Center, Palo Alto, Ca.
9. Cardelli, L., A Quest Preview. Technical Report, 1988, DEC System Research Center, Palo Alto.
10. Cartmell, J., Generalised algebraic theories and contextual categories. Ananls Pure Appl. Logic 32 (1986), 209–243.
11. Colmerauer, A., Kanoui, H., van Caneghem, M., Etude et Réalisation d'un Système Prolog. Technical Report, Groupe d'Intelligence Artificielle, U.E.R. de Luminy, Université d'Aix-Marseille II, 1979.
12. Cousineau, G., Curien, P.-L., Mauny, M., The categorical abstract machine. Science of Computer Programming 8 (1987), 173–202.
13. Curien, Pierre-Louis, Categorical Combinators, Sequential Algorithms and Functional Programming., 1986, Pitman, London.
14. de Paiva, ValeriaC.V., The Dialectica Categories, 1988, Mathematics Department, University of Cambridge PhD thesis.
15. Nachum Dershowitz, David, Plaisted, A., Equational programming. Richards, J., (eds.) Machine Intelligence 11: The logic and acquisition of knowledge, 1988, Oxford University Press, 21–56.
16. Ebbinghaus, H.-D., Extended logics: the general framework. Barwise, J., Feferman, S., (eds.) Model-Theoretic Logics, 1985, Springer Verlag, 25–76.
17. Fiadeiro, J., Sernades, A., Structuring Theories on Consequence. Technical Report, 1988?, INESC/IST, Lisbon.
18. Fribourg, Laurent, Oriented equational clauses as a programming language. Journal of Logic Programming 1:2 (1984), 179–210.
19. Futatsugi, Kokichi, Goguen, Joseph, Jouannaud, Jean-Pierre, Meseguer, José, Principles of OBJ2. Reid, Brian, (eds.) Proceedings of 12th ACM Symposium on Principles of Programming Languages, 1985, ACM, 52–66.
20. Girard, Jean-Yves, Towards a geometry of interaction. Gray, J.W., Scedrov, A., (eds.) Proc. AMS Summer Research Conference on Categories in Computer Science and Logic, Boulder, Colorado, June 1987, 1988, American Mathematical Society.
21. Girard, J.Y., Interprétation Fonctionelle et Élimination des Coupures dans l'Arithmétique d'ordre Supérieure, 1972, Univ. Paris VII PhD thesis.
22. Girard, J.Y., Linear Logic. Theoretical Computer Science 50 (1987), 1–102.
23. Goguen, Joseph, Abstract errors for abstract data types. Neuhold, Peter, (eds.) Proceedings of First IFIP Working Conference on Formal Description of Programming Concepts, 1977, MIT, 21.1–21.32.
24. Goguen, Joseph, One, none, a hundred thousand specification languages. Kugler, H.J., (eds.) Information Proceesing '86, 1986, Elsevier, 995–1003 Proceedings of 1986 IFIP Congress.
25. Goguen, Joseph, Some design principles and theory for OBK-0, a language for expressing and executing algebriac specifications of programs. Blum, Edward, Paul Satsoru Takasu, Manfred, (eds.) Proceedings, Mathematical Studies of Information Processing, 1979, Springer-Verlag, 425–473 Lecture Notes in Computer Science, Volume 75; Proceedings of a Workshop held August 1978.
26. Goguen, Joseph, Burstall, Rod, Institutions: Abstract Model Theory for Computer Science. Technical Report CSLI-85–30, Center for the Study of Language and Information, 1985, Stanford University Also submitted for publication.
27. Goguen, Joseph, Burstall, Rod, Introducing institutions. Clarke, Edmund, Kozen, Dexter, (eds.) Logics of Programs, 1984, Springer-Verlag, 221–256 Lecture Notes in Computer Science, Volume 164.
28. Goguen, Joseph, Burstall, Rod, A study in the foundations of programming methodology: specifications, institutions, charters and parchments. Pitt, David, Abramsky, Samson, Poigné, Axel, Rydeheard, David, (eds.) Proceedings, Conference on Category Theory and Computer Programming, 1986, Springer-Verlag, 313–333 Lecture Notes in Computer Science, Volume 240; also, Report Number CSLI-86–54, Center for the Study of Language and Information, Stanford University, June 1986.
29. Goguen, Joseph, Kirchner, Claude, Kirchner, Hélène, Mégrelis, Aristide, Meseguer, José, An introduction to obj3. Jouannaud, Jean-Pierre, Kaplan, Stephane, (eds.) Proceedings, Conference on Conditional Term Rewriting, Orsay, France, July 8–10, 1987, Springer-Verlag, 258–263 Lecture Notes in Computer Science No. 308, 1988.
30. Goguen, Joseph, Kirchner, Claude, Meseguer, José, Concurrent term rewriting as a model of computation. Keller, Robert, Fasel, Joseph, (eds.) Proceedings, Graph Reduction Workshop, 1987, Springer-Verlag, 53–93 Lecture Notes in Computer Science, Volume 279.
31. Goguen, Joseph, Meseguer, José, Completeness of many-sorted equational logic. Houston Journal of Mathematics 11:3 (1985), 307–334.
32. Goguen, Joseph, Meseguer, José, Eqlog: equality, types, and generic modules for logic programming. DeGrott, Douglas, Lindstrom, Gary, (eds.) Logic Programming: Functions, Relations and Equations, 1986, Prentice-Hall, 295–363.
33. Goguen, Joseph, Meseguer, José, Equality, types, modules and generics for logic programming. Tärnlund, S.-A., (eds.) Proc. 2nd Intl. Logic Programming Conf., Uppsala, July 2–6, 1984, 1984, Uppasala University, 115–125.
34. Goguen, Joseph, Meseguer, José, Models and equality for logical programming. Ehrig, Hartmut, Levi, Giorgio, Kowalski, Robert, Montanari, Ugo, (eds.) Proceedings, 1987 TAPSOFT, 1987, Springer-Verlag, 1–22.
35. Goguen, Joseph, Meseguer, José, Order-Sorted Algebra I: Partial and Over-loaded Operations, Errors and Inheritance. Technical Report to appear, SRI International, Computer Science Lab, 1989, Carnegie-Mellon University 1983 June Given as lecturer at Seminar on Types.
36. Goguen, Joseph, Meseguer, José, Leinwand, Sany, Winkler, Timothy, Aida, Hitoshi, The Rewrite Rule Machine. Technical Report to appear, 1989, SRI International, Computer Science Lab.
37. Goguen, Joseph, Thatcher, James, Wagner, Eric, An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. Technical Report RC 6487, 1976, IBM T. J. Watson Research Center October.
38. Harper, Robert, MacQueen, David, Milner, Robin, Standard ML. Technical Report ECS-LFCS-86–2, 1986, Dept. of Computer Science, University of Edinburgh.
39. Christoph Hoffmann, M., O'Donnell, Michael, Programming with equations. Transactions on Programming Languages and Systems 1:4 (1982), 83–112.
40. Hullot, Jean-Marie, Canonical forms and unification. Bibel, Wolfgang, Kowalski, Robert, (eds.) Proceedings, Fifth Conference on Automated Deduction, 1980, Springer-Verlag, 318–334 Lecture Notes in Computer Science, Volume 87.
41. Hyland, J.M.E., Pitts, A., The theory of constructions: categorical semantics and topos-theoretic models. Gray, J.W., Scedrov, A., (eds.) Proc. AMS Summer Research Conference on Categories in Computer Science and Logic, 1987, Boulder, Colorado June.
42. Kowalski, Robert, Logic for Problem Solving. Technical Report DCL Memo 75, 1974, Department of Artificial Intelligence, University of Edinburgh Also, a book in the Artificial Intelligence Series, North-Holland Press, 1979.
43. Lambek, J., Scott, P.J., Introduction to Higher Order Categorical Logic, 1986, Cambridge Univ. Press.
44. Lambek, Joachim, Deductive systems and categories II. In Category Theory, Homology Theory and their Applications I, Springer Lecture Notes in Mathematics No. 86, 1969.
45. William Lawvere, F., Functorial semantics of algebriac theories. Proceedings, National Academy of Sciences, 50, 1963, Columbia University Summary of Ph.D. Thesis.
46. Lawvere, F.W., Adjointness in foundations. Dialectica 23:3/4 (1969), 281–296.
47. MacLane, Saunders, Categories for the working mathematician, 1971, Springer.
48. J.A. Makowski Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples Technical Report 329, C.S. Dept, Technion, July 1984.
49. Martin-Löf, P., An Intuitionistic Theory of Types: Predicative Part. Rose, H.E., Shepherdson, J.C., (eds.) Logic Colloq., 73, 1973 Noth-Holland.
50. Martin-Löf, P., Intuitionistic Type Theory, 1984, Bibliopolis.
51. Mayoh, BrianH., Galleries and Institutions. Technical Report DAIMI PB-191, Computer Science Dept., 1985, Aarhus University.
52. Meseguer, J., Relating Models of Polymorphism. in Proc. POPL'89, 1988, ACM, 228–241.
53. Meseguer, José, Goguen, Joseph, Initiality, induction and computability. Nivat, Maurice, Reynolds, John, (eds.) Algebriac Methods in Semantics, 1985, Cambridge University Press, 459–541.
54. O'Donnell, M., Equational Logic as a Programming Language, 1985, MIT Press.
55. O'Donnell, MichaelJ., Computing in Systems Described by Equations. Springer-Verlag Lecture Notes in Computer Science, 58, 1977.
56. Martí-Oliet, Narciso, Meseguer, José, From Petri Nets to Linear Logic. Technical Report SRI-CSL-89–4, C.S. Lab., 1989, SRI International March.
57. Plotkin, GordonD., A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Dept., 1981, Aarhus University.
58. Poigné, Axel, Foundation are rich institutions, but institutions are poor foundations, 1986, Imperial College.
59. Prawits, Dag, Natural Deduction., 1965, Almqvist and Wiksell, Stockholm.
60. Reynolds, J.C., Towards a Theory of Type Structure. Robinet, B., (eds.) Springer Lecture Notes in Computer Science, 19, 1974, 408–425 Programming Symposium.
61. Sannella, Donald, Tarlecki, Andrazej, Specifications in an arbitrary institution. Information and Computation 76 (1988), 165–210.
62. Scott, D., Completeness and axiomatizability in many-valued logic. Henkin, L., et al. (eds.) Proc. Tarski Sump., 1974, AMS, 411–435.
63. Seely, R.A.C., Categorical semantics for higher order polymorphic lambda calculus. J. Symbol. Lotic. 52:4 (1987), 969–989.
64. Seely, R.A.G., Linear logic, *-autonomous categories and cofree coalgebras. Gray, J.W., Scedrov, A., (eds.) Proc AMS Summer Research Conference on Categories in Computer Science and Logic, 1987, AMS, Boulder, Colorado June 1988.
65. Seely, R.A.G., Locally cartesian closed categories and type theory. Math. Proc. Camb. Phil. Soc. 95 (1984), 33–48.
66. Shoenfield, JosephR., Degrees of Unsolvability. North-Holland, 1971.
67. Tarlecki, Andrzej, On the Existence of Free Models in Abstract Algebriac Institutions. Theoretical Computer Science 37 (1985), 269–304.
68. Tarlecki, Andrzej, Quasi-varieties in abstract algebriac institutions. Journal of Computer and System Sciences 33 (1986), 333–360.
69. Tarski, A., On some fundamental concepts of metamathematics. Logic, Semantics, Metamathematics, 1956, Oxford U.P., 30–37.
70. Taylor, P., Recursive Domains, Indexed Category Theory and Polymorphism, 1987, Mathematics Department, University of Cambridge PhD thesis.
71. van Emden, MaartenH., Yukawa, Keitaro, Equational Logic Programming. Technical Report CS-86–05, 1986, University of Waterloo March.
72. van Emden, M.H., Kowalski, R.A., The semantics of predicate logic as a programming language. Journal of the Association for Computing Machinery 23:4 (1976), 733–742.
73. Volger, H., Completeness theorem for logical categories. Lawvere, F.W., Maurer, C., Wraith, G.C., (eds.) Model Theory and Topoi, Springer Lecture Notes in Mathematics No. 445, 1975.