Skip to main content


eCommons@Cornell >

Browsing by Author Bloom, Bard

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 11 of 11
PreviewIssue DateTitleAuthor(s)
Aug-1990Bisimulation Can't Be TracedBloom, Bard; Istrail, Sorin; Meyer, Albert
Dec-1989Can LCF Be Topped? Flat Lattice Models of Typed $\lambda$-CalculusBloom, Bard
Jan-1996Compiling Joy Into Silicon: a Formally Verified Compiler forDelay-Insensitive CircuitsWeber, Sam; Bloom, Bard; Brown, Geoffrey
Jan-1996Metatheory of the $\pi$-CalculusWeber, Sam; Bloom, Bard
Dec-1989Partial Traces and the Semantics and Logic of CCS-Like LanguagesBloom, Bard
Aug-1993Proceedings of the North American Process Algebra Workshop 1993 - Ithaca, NYBloom, Bard
Sep-1991Putting Time into Proof OutlinesSchneider, Fred B.; Bloom, Bard; Marzullo, Keith
Aug-1993Ready, Set, Go: Structural Operational Semantics for Linear-Time Process AlgebrasBloom, Bard
Aug-1993Structural Operational Semantics for Weak BisimulationsBloom, Bard
Aug-1991Trade-offs in True Concurrency: Pomsets and Mazurkiewicz TracesBloom, Bard; Kwiatkowska, Marta
Jul-1991When Is Partial Trace Equivalence Adequate?Bloom, Bard
Showing results 1 to 11 of 11


© 2014 Cornell University Library Contact Us