#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1990

2002

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Val Tannen, Ramesh Subrahmanyam
- ICALP
- 1991

We study issues that arise in programming with primitive recursion over non-free datatypes such as lists, bags and sets. Programs written in this style can lack a meaning in the sense that their… (More)

- Daniel J. Dougherty, Ramesh Subrahmanyam
- Inf. Comput.
- 2000

We consider the lambda calculus obtained from the simply typed calculus by adding products, coproducts, and a terminal type. We prove the following theorem: The equations provable in this calculus… (More)

- Jon G. Riecke, Ramesh Subrahmanyam
- POPL
- 1993

We consider the following problem in proving observational congruences in functional languages: given a call-by-name language based on the simply-typed λ-calculus with algebraic operations… (More)

- Jon G. Riecke, Ramesh Subrahmanyam
- TACS
- 1994

We consider call-by-name, call-by-value, and lazy versions of PCF, and prove, using both syntactic and semantic means, that the operational equivalences of the base language are preserved when the… (More)

- Val Tannen, Ramesh Subrahmanyam
- LISP and Functional Programming
- 1992

Given an abstract data type(ADT), and algebra that specifies it, and an implementation of the data type in a certain language, if the implementation is “correct,” a certain principle of modularity of… (More)

- Daniel J. Dougherty, Ramesh Subrahmanyam
- Proceedings of Tenth Annual IEEE Symposium on…
- 1995

Consider the simply-typed lambda calculus with sum-type constructors, and let Set be the standard set-theoretic model of this calculus over an infinite base set. We present a proof system for the… (More)

- Vijay Chandru, Suman Roy, Ramesh Subrahmanyam
- ASIAN
- 1996

- Ramesh Subrahmanyam
- FSTTCS
- 1990

In the field of algebraic specification, the semantics of an equationally specified datatype is given by the initial algebra of the specifications. We show in this paper that in general the theory of… (More)

- Ramesh Subrahmanyam
- The Compiler Design Handbook
- 2002

Types Support for data abstraction is provided by existential types, which are “dual” to the universal types associated with polymorphism. 8.1 Statics The language Lpp Ω is defined to be an… (More)

- Vijay Chandru, Suman Roy, Ramesh Subrahmanyam
- Constraints
- 1998

Providing a clean procedural semantics of the “Negation As Failure rule” in Logic Programming has been an open problem for some time now. This rule has been treated as a technique in nonmonotonic… (More)