Ramesh Subrahmanyam

Publication List Details

Period

1989 - 2003

Number

19

Co-Authors

Negation as Failure as Resolution (1998)

Chandru, Vijay, Roy, Suman, Subrahmanyam, Ramesh

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...

Negation as Failure as Resolution (1998)

Chandru, Vijay, Roy, Suman, Subrahmanyam, Ramesh

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...

Conditions for the Completeness of Functional and Algebraic Equational Reasoning (1998)

Jon G. Riecke, Ramesh Subrahmanyam

We consider the following question: in the simply-typed l-calculus with algebraic operations, is the set of equations valid in a particular model exactly those provable from (b), (h), and the set of...

Semantic Orthogonality of Type Disciplines (1997)

Jon G. Riecke, Ramesh Subrahmanyam

We consider a version of PCF, and prove, using both syntactic and semantic means, that the operational equivalences of the base language are preserved when the language is extended with sum and...

Conditions for the Completeness of Functional and Algebraic Equational Reasoning (1997)

Jon G. Riecke, Ramesh Subrahmanyam

We consider the following problem in proving equations in models of functional languages: given a call-by-name language based on the simplytyped -calculus with algebraic operations axiomatized by...

Equality Between Functionals in the Presence of Coproducts (1995)

Daniel J. Dougherty, Ramesh Subrahmanyam

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...

Data abstraction in programming language semantics (1992)

Subrahmanyam, Ramesh

Most modern programming languages allow the user to define abstract data types, thereby creating an extended language. While the programming language without the definition of ADT's is completely...

Data abstraction in programming language semantics / (1992)

Subrahmanyam, Ramesh.

Thesis (Ph.D. in Computer and Information Science) -- Graduate School of Arts and Sciences, University of Pennsylvania, 1992.

Algebraic Reasoning and Completeness in Typed Languages (1992)

Jon G. Riecke, Ramesh Subrahmanyam

: We consider the following problem in proving observational congruences in functional languages: given a call-by-name language based on the simplytyped -calculus with algebraic operations...

Logical and Computational Aspects of Programming with Sets/Bags/Lists (1991)

Tannen, Val, Subrahmanyam, Ramesh

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...

Data Abstraction and General Recursion (1991)

Subrahmanyam, Ramesh

Existing approaches to semantics of algebraically specified data types such as Initial Algebra Semantics and Final Algebra Semantics do not take into account the possibility of general recursion and...

Logical and Computational Aspects of Programming with Sets/Bags/Lists (1991)

Val Breazu-tannen, Ramesh Subrahmanyam

. 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...

Lambda Calculus,Conservative Extension and Structural Induction (1989)

Tannen, Val, Subrahmanyam, Ramesh

The issue of whether embedding algebraic theories in higher-order theories such as the simply typed and polymorphic lambda calculi is of interest in programming language design. The establishment of...

The NH2-Terminal Coiled-Coil Domain and Tyrosine 177 Play Important Roles in Induction of a Myeloproliferative Disease in Mice by Bcr-Abl

Zhang, Xiaowu, Subrahmanyam, Ramesh, Wong, Ray, Gross, Alec W., Ren, Ruibao

Bcr-Abl, a fusion protein generated by t(9;22)(q34;q11) translocation, plays a critical role in the pathogenesis of chronic myelogenous leukemia (CML). It has been shown that Bcr-Abl contains...

The NH2-Terminal Coiled-Coil Domain and Tyrosine 177 Play Important Roles in Induction of a Myeloproliferative Disease in Mice by Bcr-Abl

Zhang, Xiaowu, Subrahmanyam, Ramesh, Wong, Ray, Gross, Alec W., Ren, Ruibao

Bcr-Abl, a fusion protein generated by t(9;22)(q34;q11) translocation, plays a critical role in the pathogenesis of chronic myelogenous leukemia (CML). It has been shown that Bcr-Abl contains...

Oncogenic NRAS rapidly and efficiently induces CMML- and AML-like diseases in mice

Parikh, Chaitali, Subrahmanyam, Ramesh, Ren, Ruibao

Activating mutations in RAS, predominantly NRAS, are common in myeloid malignancies. Previous studies in animal models have shown that oncogenic NRAS is unable to induce myeloid malignancies...

β-Catenin Expression Results in p53-Independent DNA Damage and Oncogene-Induced Senescence in Prelymphomagenic Thymocytes In Vivo▿ †

Xu, Mai, Yu, Qing, Subrahmanyam, Ramesh, Difilippantonio, Michael J., Ried, Thomas, Sen, Jyoti Misra

The expression of β-catenin, a potent oncogene, is causally linked to tumorigenesis. Therefore, it was surprising that the transgenic expression of oncogenic β-catenin in thymocytes resulted in...