Advances In Computing Science Asian 99

This book constitutes the refereed proceedings of the 5th Asian Computing Science Conference, ASIAN'99, held in Phuket, Thailand, in December 1999. The 28 revised full papers presented together with two invited contributions and 11 short presentations were carefully reviewed and selected from a total of 114 submissions. Among the topics addressed are programming theory, formal methods, automated reasoning, verification, embedded systems, real-time systems, distributed systems, and mobile computing.

This book constitutes the refereed proceedings of the 5th Asian Computing Science Conference, ASIAN'99, held in Phuket, Thailand, in December 1999. The 28 revised full papers presented together with two invited contributions and 11 short presentations were carefully reviewed and selected from a total of 114 submissions. Among the topics addressed are programming theory, formal methods, automated reasoning, verification, embedded systems, real-time systems, distributed systems, and mobile computing.

This book constitutes the refereed proceedings of the 6th Asian Computing Science Conference, ASIAN 2000, held in Penang, Malaysia in November 2000. The 18 revised full papers presented were carefully reviewed and selected from a total of 61 submissions. The papers presented cover various topics in computer science and its applications, with a certain focus on networking and network performance and on programming logics and program semantics.

This book constitutes the refereed proceedings of the 8th Asian Computing Science Conference, ASIAN 2003, held in Mumbai, India in December 2003.The 16 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 53 submissions. Among the topics addressed are type theory for operating systems protection, self configurable servers, network services, predicate detection, hierarchical specification, proof theory, electronic auctions, secure mobile computing, programming casculi, access control, middleware, program logic, real-time systems, and probabilistic distributed systems.

This book constitutes the refereed proceedings of the 8th Asian Computing Science Conference, ASIAN 2003, held in Mumbai, India in December 2003. The 16 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 53 submissions. Among the topics addressed are type theory for operating systems protection, self configurable servers, network services, predicate detection, hierarchical specification, proof theory, electronic auctions, secure mobile computing, programming casculi, access control, middleware, program logic, real-time systems, and probabilistic distributed systems.

This book constitutes the refereed proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, held in Brno, Czech Republic in August 2002.The 32 revised full papers presented together with abstracts of seven invited contributions were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on verification and model checking, logic, mobility, probabilistic systems, models of computation and process algebra, security, Petri nets, and bisimulation.

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc. The isomorphism has many aspects, even at the syntactic level: formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc. But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transforms proofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq). This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic. Key features - The Curry-Howard Isomorphism treated as common theme - Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics - Thorough study of the connection between calculi and logics - Elaborate study of classical logics and control operators - Account of dialogue games for classical and intuitionistic logic - Theoretical foundations of computer-assisted reasoning · The Curry-Howard Isomorphism treated as the common theme. · Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics · Thorough study of the connection between calculi and logics. · Elaborate study of classical logics and control operators. · Account of dialogue games for classical and intuitionistic logic. · Theoretical foundations of computer-assisted reasoning