Honda, Kohei - Department of Computer Science, Queen Mary, University of London

• Nobuko Yoshida, Martin Berger and Kohei Honda We introduce a typed -calculus where strong normalisation is ensured by typa-
• EXPRESS'00 to appear The Two-Phase Commitment Protocol
• REPLICATION IN CONCURRENT COMBINATORS KOHEI HONDA NOBUKO YOSHIDA
• Principal typing schemes in a polyadic calculus 3 Vasco T. Vasconcelos Kohei Honda
• Sequential Process Logics: Notes on Origins Kohei Honda
• Types for Dyadic Interaction \Lambda Kohei Honda
• Sequentiality and the -Calculus ? Martin Berger y , Kohei Honda y , and Nobuko Yoshida z
• Recursive Types in Games: Axiomatics and Process Representation
• Scribbling Interactions with a Formal Foundation
• A Compositional Logic for Polymorphic HigherOrder Functions Kohei Honda
• Genericity and the -Calculus Martin Berger ? Kohei Honda ? Nobuko Yoshida ??
• NOTES ON UNDIRECTED ACTIONS KOHEI HONDA
• Descriptive and Relative Completeness of Logics for HigherOrder Functions
• Linearity and Bisimulation Nobuko Yoshida ? Kohei Honda y Martin Berger y
• An Interactionbased Language and its Typing System \Lambda Kaku Takeuchi Kohei Honda Makoto Kubo
• ISSN 1361 6161 Computer Science
• A Logical Analysis of Aliasing in Imperative HigherOrder Functions
• Under consideration for publication in Math. Struct. in Comp. Science Elementary Structures in Process Theory (1)
• An Observationally Complete Program Logic for Imperative Higher-Order Functions
• A Logical Analysis of Aliasing in Imperative Higher-Order Functions
• LANGUAGE PRIMITIVES AND TYPE DISCIPLINE FOR STRUCTURED COMMUNICATION-BASED PROGRAMMING
• Issues in Software Safety (for Dependable Computing)
• Combinatory Representation of Mobile Processes \Lambda Kohei Honda y
• On ReductionBased Process Semantics \Lambda Kohei Honda Nobuko Yoshida
• A Compositional Logic for Polymorphic Higher-Order Functions Kohei Honda
• Under consideration for publication in J. Functional Programming 1 From Process Logic to Program Logic
• A Uniform Type Structure for Secure Information KOHEI HONDA
• Logical Reasoning for Higher-Order Functions with Local State
• A Logical Analysis of Aliasing in Imperative Higher-Order Functions
• An Observationally Complete Program Logic for Imperative Higher-Order Functions
• From Process Logic to Program Logic Kohei Honda
• Process Logic and Duality Part I: Sequential Processes
• Sequential Process Logics: Notes on Origins Kohei Honda
• Session-Based Distributed Programming in Java Raymond Hu1
• Strong Normalisation in the p-Calculus Nobuko Yoshida + , Martin Berger # and Kohei Honda #
• Two bisimilarities in calculus Kohei Honda
• Published in Electronic Note in Coputer Science, Elsevier, 2003 Processes and Games
• Process Logic and Duality Part I: Sequential Processes
• Under consideration for publication in J. Functional Programming 1 Noninterference through Flow Analysis
• A Uniform Type Structure for Secure Information KOHEI HONDA
• Composing Processes \Lambda Kohei Honda y
• An Observationally Complete Program Logic for Imperative HigherOrder Functions
• Multiparty Asynchronous Session Types Kohei Honda
• GAME THEORETIC ANALYSIS OF CALLBYVALUE COMPUTATION KOHEI HONDA NOBUKO YOSHIDA
• From Process Logic to Program Logic Kohei Honda
• Secure Information Flow as Typed Process Behaviour Kohei Honda 1 Vasco Vasconcelos 2
• Genericity and the -Calculus Martin Berger Kohei Honda Nobuko Yoshida
• Scribbling Interactions with a Formal Foundation