Ramesh Subrahmanyam

According to our database1, Ramesh Subrahmanyam authored at least 11 papers between 1990 and 2002.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Type Systems in Programming Languages.
Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2002

2000
Equality between Functionals in the Presence of Coproducts.
Inf. Comput., 2000

1999
Conditions for the completeness of functional and algebraic equational reasoning.
Math. Struct. Comput. Sci., 1999

1998
Negation as Failure as Resolution.
Constraints An Int. J., 1998

1996
Constructive Negation in Definite Constraint Logic Programs.
Proceedings of the Concurrency and Parallelism, 1996

1994
Extensions to Type Systems Can Preserve Operational Equivalences.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Algebraic Reasoning and Completeness in Typed Languages.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1992
On Extending Computational Adequacy by Data Abstraction.
Proceedings of the Conference on Lisp and Functional Programming, 1992

1991
Logical and Computational Aspects of Programming with Sets/Bags/Lists.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

On Adding Algebraic Theories with Induction to Typed Lambda Calculi.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
Complexity of Algebraic Specification.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990


  Loading...