Foundations of software technology and theoretical computer science. 13th conference, Bombay, India, December 15-17, 1993. Proceedings (Q1310283)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Foundations of software technology and theoretical computer science. 13th conference, Bombay, India, December 15-17, 1993. Proceedings |
scientific article; zbMATH DE number 479573
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Foundations of software technology and theoretical computer science. 13th conference, Bombay, India, December 15-17, 1993. Proceedings |
scientific article; zbMATH DE number 479573 |
Statements
Foundations of software technology and theoretical computer science. 13th conference, Bombay, India, December 15-17, 1993. Proceedings (English)
0 references
8 December 1993
0 references
The articles of this volume will be reviewed individually. The 14th conference (1994) has been reviewed (see Zbl 0802.00044). Indexed articles: \textit{van Bakel, Steffen}, Essential intersection type assignment, 13-23 [Zbl 0924.03027] \textit{Aït-Kaci, Hassan; Garrigue, Jacques}, Label-selective \(\lambda\)-calculus syntax and confluence, 24-40 [Zbl 0925.03090] \textit{Castagna, Giuseppe}, A meat-language for typed object-oriented languages, 52-71 [Zbl 0925.03086] \textit{Kulkarni, S. R.; Mitter, S. K.; Richardson, T. J.; Tsitsiklis, J. N.}, Local versus non-local computation of length of digitized curves, 94-103 [Zbl 0925.68437] \textit{Krishna Rao, M. R. K.}, Completeness of hierarchical combinations of term rewriting systems, 125-138 [Zbl 0925.68262] \textit{Dershowitz, Nachum; Mitra, Subrata}, Higher-order and semantic unification, 139-150 [Zbl 0925.03146] \textit{Basin, David; Matthews, Seán}, A conservative extension of first-order logic and its applications to theorem proving, 151-160 [Zbl 0924.03103] \textit{Ramakrishna, Y. S.; Dillon, L. K.; Moser, L. E.; Melliar-Smith, P. M.; Kutty, G.}, A real-time interval logic and its decision procedure, 173-192 [Zbl 0924.03028] \textit{Halldórsson, Magnús M.; Radhakrishnan, Jaikumar; Subrahmanyan, K. V.}, On some communication complexity problems related to threshold functions, 248-259 [Zbl 0925.68217] \textit{Cucker, Felipe; Rosselló, Francesc}, Recursiveness over the complex numbers is time-bounded, 260-267 [Zbl 0924.03068] \textit{Mulmuley, Ketan}, A lower bound for solvability of polynomial equations, 268-283 [Zbl 0925.68212] \textit{Cheng, Allan; Esparza, Javier; Palsberg, Jens}, Complexity results for 1-safe-nets, 326-337 [Zbl 0925.68329] \textit{Janin, David}, Some results about logical descriptions of nondeterministic behaviours, 338-347 [Zbl 0924.03039] \textit{Janicki, Ryszard; Koutny, Maciej}, Order structures and generalisations of Szpilrajn's theorem, 348-357 [Zbl 0924.06005] \textit{Honda, Kohei; Yoshida, Nobuko}, On reduction-based process semantics, 373-387 [Zbl 0925.68304] \textit{Dubhashi, Devdatt; Mehlhorn, Kurt; Ranjan, Desh; Thiel, Christian}, Searching, sorting and randomised algorithms for central elements and ideal counting in posets, 436-443 [Zbl 0925.68122] \textit{Bhattacharyya, P.; Nagaraja, G.}, Learning classes of regular and linear languages in Valiant's learnability framework, 444-453 [Zbl 0925.68378]
0 references
Bombay (India)
0 references
Conference
0 references
Proceedings
0 references
Software technology
0 references
Theoretical computer science
0 references
Computer science
0 references