Foundations of Software Technology and Theoretical Computer Science
-
Foundations of Software Technology and Theoretical Computer Science: 19th Conference, Chennai, India, December 13-15, 1999 Proceedings
By R. Ramanujam, C. Pandu Rangan, V. RamanWe now introduce such a calculus of closures, named the calculus of weak explicit substitutions, and study its connection to the weak λ-calculus. The language contains terms which are reductible, and programs which are constant.
-
Foundations of Software Technology and Theoretical Computer Science: 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings
By Vijay Chandru1105 : T.I. Ören , G.J. Klir ( Eds . ) , Computer Aided Systems Theory - CAST '94 . Proceedings , 1994. IX , 439 pages . 1996 . Vol . 1106 : M. Jampel , E. Freuder , M. Maher ( Eds . ) , OverConstrained Systems . X , 309 pages . 1996 .
-
Foundations of Software Technology and Theoretical Computer Science: Eighth Conference, Pune, India, December 21-23, 1988. Proceedings
By Sanjeev kumar, Kesav V. NoriLet e be an edge of G. We call e a touching edge of G ; if one end vertex of e is in and the other end is in G ;. A touching edge of G ; is called an essential touching edge if there does not exist another touching edge e ' of G ; which ...
-
Foundations of Software Technology and Theoretical Computer Science: 15th Conference; Bangalore, India, December 1995. Proceedings
By P.S. ThiagarajanThis book constitutes the refereed proceedings of the 15th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '95, held in Bangalore, India in December 1995.
-
Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. Proceedings
By Kesav V. NoriThis volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science.
-
Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15 - 17, 1994. Proceedings
By P.S. ThiagarajanThe gain obtained by shrinking e , gain ( e ) , is defined as the difference in the costs of the initial and final M STs . To shrink a triple z { a , b , c } e Co ( which we shall call a triangle ) is to place two zero weight blue edges ...
-
Foundations of Software Technology and Theoretical Computer Science: 17th Conference, Kharagpur, India, December 18-20, 1997. Proceedings
By S. Ramesh935 , 103-120 ( 1995 ) . 4. E. Best , H. Fleischhack , W. Fraczak , R.P. Hopkins , H. Klaudel , and E. Pelz . An M - Net Semantics of B ( PN ) 2 . Structures in Concurrency Theory : STRICT'95 Proceedings . Springer , 85-100 ( 1995 ) .