Ramesh Subrahmanyam

12 papers A* 3Journal 3Unranked 5
YearRankTypeTitle / Venue / Authors
2002 — ch.
Type Systems in Programming Languages.
The Compiler Design Handbook
Ramesh Subrahmanyam
2000 J jnl
Equality between Functionals in the Presence of Coproducts.
Inf. Comput.
Daniel J. Dougherty, Ramesh Subrahmanyam
1999 J jnl
Conditions for the completeness of functional and algebraic equational reasoning.
Math. Struct. Comput. Sci.
Jon G. Riecke, Ramesh Subrahmanyam
1998 J jnl
Negation as Failure as Resolution.
Constraints An Int. J.
Vijay Chandru, Suman Roy, Ramesh Subrahmanyam
1996 — conf
Constructive Negation in Definite Constraint Logic Programs.
ASIAN
Vijay Chandru, Suman Roy, Ramesh Subrahmanyam
1995 A* conf
Equality between Functionals in the Presence of Coproducts
LICS
Daniel J. Dougherty, Ramesh Subrahmanyam
1994 — conf
Extensions to Type Systems Can Preserve Operational Equivalences.
TACS
Jon G. Riecke, Ramesh Subrahmanyam
1993 A* conf
Algebraic Reasoning and Completeness in Typed Languages.
POPL
Jon G. Riecke, Ramesh Subrahmanyam
1992 — conf
On Extending Computational Adequacy by Data Abstraction.
LISP and Functional Programming
Val Tannen, Ramesh Subrahmanyam
1991 A* conf
Logical and Computational Aspects of Programming with Sets/Bags/Lists.
ICALP
Val Tannen, Ramesh Subrahmanyam
1991 — conf
On Adding Algebraic Theories with Induction to Typed Lambda Calculi.
AMAST
Val Breazu-Tannen, Ramesh Subrahmanyam
1990 — conf
Complexity of Algebraic Specification.
FSTTCS
Ramesh Subrahmanyam