Foundations of software science and computation structures. 3rd international conference, FOSSACS 2000. Held as part of the joint European conferences on theory and practice of software, ETAPS 2000, Berlin, Germany, March 25 -- April 2, 2000. Proceedings (Q1972821)

The articles of mathematical interest will be reviewed individually. The preceding conference (2nd, 1999) has been indicated (see Zbl 0911.00045). Indexed articles: \textit{Baier, Christel; Stoelinga, Mariëlle}, Norm functions for probabilistic bisimulations with delays, 1-16 [Zbl 0961.68087] \textit{Barthe, Gilles; van Raamsdonk, Femke}, Constructor subtyping in the calculus of inductive constructions, 17-34 [Zbl 0955.03039] \textit{Bérard, Beatrice; Labroue, Anne; Schnoebelen, Philippe}, Verifying performance equivalence for timed basic parallel processes, 35-47 [Zbl 0965.68063] \textit{Caucal, Didier}, On word rewriting systems having a rational derivation, 48-62 [Zbl 0965.68031] \textit{Di Cosmo, Roberto; Kesner, Delia; Polonovski, Emmanuel}, Proof nets and explicit substitutions, 63-81 [Zbl 0955.03064] \textit{Damiani, Ferruccio}, Typing local definitions and conditional expressions with rank 2 intersection. (Extended abstract), 82-97 [Zbl 0961.68030] \textit{Drewes, Frank; Hoffmann, Berthold; Plump, Detlef}, Hierarchical graph transformation, 98-113 [Zbl 0961.68106] \textit{Engelhardt, Kai; van der Meyden, Ron; Moses, Yoram}, A program refinement framework supporting reasoning about knowledge and time. (Preliminary report), 114-129 [Zbl 0961.68031] \textit{Hannay, Jo Erskine}, A higher-order simulation relation for System F, 130-145 [Zbl 0961.68082] \textit{Herescu, Oltea Mihaela; Palamidessi, Catuscia}, Probabilistic asynchronous \(\pi\)-calculus, 146-160 [Zbl 0961.68088] \textit{Honsell, Furio; Longley, John; Sannella, Donald; Tarlecki, Andrzej}, Constructive data refinement in typed lambda calculus, 161-176 [Zbl 0965.68012] \textit{Husson, Jean-François; Morin, Rémi}, On recognizable stable trace languages, 177-191 [Zbl 0961.68089] \textit{Laroussinie, François; Schnoebelen, Philippe}, The state explosion problem from trace to bisimulation equivalence, 192-207 [Zbl 0961.68090] \textit{Lin, Huimin; Yi, Wang}, A proof system for timed automata, 208-222 [Zbl 0961.68071] \textit{Maietti, Maria Emilia; de Paiva, Valeria; Ritter, Eike}, Categorical models for intuitionistic and linear type theory, 223-237 [Zbl 0955.03069] \textit{Merro, Massimo}, Locality and polyadicity in asynchronous name-passing calculi, 238-251 [Zbl 0961.68091] \textit{Morvan, Christophe}, On rational graphs, 252-266 [Zbl 0961.68107] \textit{Pinto, Jorge Sousa}, Sequential and concurrent abstract machines for interaction nets, 267-282 [Zbl 0961.68070] \textit{Quaglia, Paola; Walker, David}, On synchronous and asynchronous mobile processes, 283-296 [Zbl 0961.68092] \textit{Schubert, Aleksy}, Type inference for first-order logic, 297-313 [Zbl 0961.68032] \textit{Thiemann, Peter}, An algebraic foundation for adaptive programming, 314-328 [Zbl 0961.68028] \textit{Treinen, Ralf}, Predicate logic and tree automata with tests, 329-343 [Zbl 0961.68072] \textit{Tsay, Yih-Kuen}, Compositional verification in linear-time temporal logic, 344-358 [Zbl 0961.68093] \textit{Yang, Hongseok; Reddy, Uday S.}, On the semantics of refinement calculi, 359-374 [Zbl 0961.68033] \textit{Zimmer, Pascal}, Subtyping and typing algorithms for mobile ambients, 375-390 [Zbl 0961.68094]