On the Correspondence Metween Two Classes of Reduction Systems. - Satish R. Thatte (Inf. Process. Lett., 1985)

Towards a Semantic Theory for Equational Programming Languages. - Satish R. Thatte (LISP and Functional Programming, 1986)

Optimal semantics of data type extensions. - Lawrence S. Moss; Satish R. Thatte (Algebraic Logic and Universal Algebra in Computer Science, 1988)

Implementing First-Order Rewriting with Constructor Systems. - Satish R. Thatte (Theor. Comput. Sci., 1988)

Generalization of Final Algebra Semantics by Relativization. - Lawrence S. Moss; Satish R. Thatte (Mathematical Foundations of Programming Semantics, 1989)

Full Abstraction and Limiting Completeness in Equational Languages. - Satish R. Thatte (Theor. Comput. Sci., 1989)

Quasi-Static Typing. - Satish R. Thatte (POPL, 1990)

Coercive Type Isomorphism. - Satish R. Thatte (FPCA, 1991)

Finite Acyclic Theories are Unitary. - Satish R. Thatte (J. Symb. Comput., 1993)

Modal Logic and Algebraic Specifications. - Lawrence S. Moss; Satish R. Thatte (Theor. Comput. Sci., 1993)

Semantics of Type Classes Revisited. - Satish R. Thatte (LISP and Functional Programming, 1994)

Type Inference with Partial Types. - Satish R. Thatte (Theor. Comput. Sci., 1994)

Object Imaging. - Satish R. Thatte (ECOOP, 1995)

06291 Abstracts Collection – The Role of Business Processes in Service-Oriented Architectures. - Frank Leymann; Wolfgang Reisig; Satish R. Thatte; Wil M. P. van der Aalst (The Role of Business Processes in Service Oriented Architectures, 2006)