José Meseguer (meseguer-j)

Contributi a Philosophie.ch

Bibliography

Goguen, Joseph A., Jr. and Meseguer, José. 1984. “Completeness of Many-Sorted Equational Logic.” csli-84-15. Stanford, California: Center for the Study of Language; Information.
Goguen, Joseph A., Jr. and Meseguer, José. 1987. “Models and Equality for Logical Programming.” in TAPSOFT ’87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, edited by G. Goos and J. Hartmanis, pp. 1–22. Berlin: Springer.
Goguen, Joseph A., Jr. and Meseguer, José. 1989. “Order-Sorted Algebra I.” sri–csl–89–10. Menlo Park, California: AI Center, SRI Center International.
Martı́-Oliet, N. and Meseguer, José. 1994. “General Logics and Logical Frameworks.” in What is a Logical System?, edited by Dov M. Gabbay, pp. 355–392. Oxford: Oxford University Press.
Martı́-Oliet, N. and Meseguer, José. 2002. “Rewriting Logic as a Logical and Semantic Framework.” in Handbook of Philosophical Logic, Volume IX, edited by Dov M. Gabbay and Franz Guenthner, 2nd ed., pp. 1–88. Dordrecht: Springer.
Meseguer, José and Goguen, Joseph A., Jr. 1990. “Order-Sorted Algebra Solves the Constraint-Selector, Multiple Representation and Coercion Problems.” sri–csl–90–06. Menlo Park, California: AI Center, SRI Center International.
Meseguer, José, Goguen, Joseph A., Jr. and Smolka, Gert. 1989. “Order-Sorted Unification.” Journal of Symbolic Computation 8: 383–413.
Meseguer, José and Winkler, Timothy. 1990. “Parallel Programming in Maude.” sri–csl–91–09. Menlo Park, California: AI Center, SRI Center International.