Archives - Page 12
-
PB-324 On the compositional checking of validity
No. 324 (1990) -
PB-319 INTERFACE
No. 319 (1990) -
PB-323 Two analyses of CSCW and groupware
No. 323 (1990) -
PB-318 Genericity and inheritance
No. 318 (1990) -
PB-325 Data flow analysis as model checking
No. 325 (1990) -
PB-316 Types and automata
No. 316 (1990) -
PB-315 Extended Smolensky's method
No. 315 (1990) -
PB-326 Strong typing of object-oriented languages revisited
No. 326 (1990) -
PB-310 Elementary transition systems
No. 310 (1990) -
PB-308 True concurrency can be traced
No. 308 (1990) -
PB-313 A note on opaque types
No. 313 (1990) -
PB-312 Teaching object-oriented programming using BETA
No. 312 (1990) -
PB-311 Optimal detection of query injectivity
No. 311 (1990) -
PB-306 Are There Elimination Algorithms for the Permanent?
No. 306 (1990) -
PB-304 Graph Grammars for Knowledge Representation
No. 304 (1990) -
PB-301 Petri Nets as Models of Linear Logic
No. 301 (1990) -
PB-303 A Note on the Jacobian Conjecture
No. 303 (1990)