 | 2002 |
|---|
| 12 |       | Ramesh Subrahmanyam:
Type Systems in Programming Languages.
The Compiler Design Handbook 2002: 801-840 |
| 2000 |
|---|
| 11 | | Daniel J. Dougherty,
Ramesh Subrahmanyam:
Equality between Functionals in the Presence of Coproducts.
Inf. Comput. 157(1-2): 52-83 (2000) |
| 1999 |
|---|
| 10 | | Jon G. Riecke,
Ramesh Subrahmanyam:
Conditions for the completeness of functional and algebraic equational reasoning.
Mathematical Structures in Computer Science 9(6): 651-685 (1999) |
| 1998 |
|---|
| 9 | | Vijay Chandru,
Suman Roy,
Ramesh Subrahmanyam:
Negation as Failure as Resolution.
Constraints 3(4): 315-329 (1998) |
| 1996 |
|---|
| 8 | | Vijay Chandru,
Suman Roy,
Ramesh Subrahmanyam:
Constructive Negation in Definite Constraint Logic Programs.
ASIAN 1996: 335-336 |
| 1995 |
|---|
| 7 | | Daniel J. Dougherty,
Ramesh Subrahmanyam:
Equality between Functionals in the Presence of Coproducts
LICS 1995: 282-291 |
| 1994 |
|---|
| 6 | | Jon G. Riecke,
Ramesh Subrahmanyam:
Extensions to Type Systems Can Preserve Operational Equivalences.
TACS 1994: 76-95 |
| 1993 |
|---|
| 5 | | Jon G. Riecke,
Ramesh Subrahmanyam:
Algebraic Reasoning and Completeness in Typed Languages.
POPL 1993: 185-195 |
| 1992 |
|---|
| 4 |  | Val Tannen,
Ramesh Subrahmanyam:
On Extending Computational Adequacy by Data Abstraction.
LISP and Functional Programming 1992: 161-169 |
| 1991 |
|---|
| 3 | | Val Breazu-Tannen,
Ramesh Subrahmanyam:
On Adding Algebraic Theories with Induction to Typed Lambda Calculi.
AMAST 1991: 327-340 |
| 2 | | Val Tannen,
Ramesh Subrahmanyam:
Logical and Computational Aspects of Programming with Sets/Bags/Lists.
ICALP 1991: 60-75 |
| 1990 |
|---|
| 1 | | Ramesh Subrahmanyam:
Complexity of Algebraic Specification.
FSTTCS 1990: 33-37 |
