Four of the five invited talks are included in the proceedings. They discuss some decision problems of enormous complexity; plausibility measures and default reasoning; Cartesian closed double categories, their lambda notation, and the pi-calculus; and proving security protocols correct. Others of the 46 papers discuss such topics as two- variable descriptions of regularity, pattern matching as cut elimination, full abstraction and universality through realizability, a superposition decision procedure for the guarded ...
Read More
Four of the five invited talks are included in the proceedings. They discuss some decision problems of enormous complexity; plausibility measures and default reasoning; Cartesian closed double categories, their lambda notation, and the pi-calculus; and proving security protocols correct. Others of the 46 papers discuss such topics as two- variable descriptions of regularity, pattern matching as cut elimination, full abstraction and universality through realizability, a superposition decision procedure for the guarded fragment with equality, verifying broadcast protocols, concurrent games and full completeness, and linear types and non-size-increasing polynomial time computation. Only the authors made it into the index. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read Less
