Complexity of Algebraic Specification. - Ramesh Subrahmanyam (FSTTCS, 1990)

On Adding Algebraic Theories with Induction to Typed Lambda Calculi. - Val Breazu-Tannen; Ramesh Subrahmanyam (AMAST, 1991)

Logical and Computational Aspects of Programming with Sets/Bags/Lists. - Val Tannen; Ramesh Subrahmanyam (ICALP, 1991)

On Extending Computational Adequacy by Data Abstraction. - Val Tannen; Ramesh Subrahmanyam (LISP and Functional Programming, 1992)

Algebraic Reasoning and Completeness in Typed Languages. - Jon G. Riecke; Ramesh Subrahmanyam (POPL, 1993)

Extensions to Type Systems Can Preserve Operational Equivalences. - Jon G. Riecke; Ramesh Subrahmanyam (TACS, 1994)

Constructive Negation in Definite Constraint Logic Programs. - Vijay Chandru; Suman Roy 001; Ramesh Subrahmanyam (ASIAN, 1996)

Negation as Failure as Resolution. - Vijay Chandru; Suman Roy 001; Ramesh Subrahmanyam (Constraints An Int. J., 1998)

Conditions for the completeness of functional and algebraic equational reasoning. - Jon G. Riecke; Ramesh Subrahmanyam (Math. Struct. Comput. Sci., 1999)

Equality between Functionals in the Presence of Coproducts. - Daniel J. Dougherty; Ramesh Subrahmanyam (Inf. Comput., 2000)

Type Systems in Programming Languages. - Ramesh Subrahmanyam (The Compiler Design Handbook, 2002)