Titlebook: Games and Full Abstraction for a Functional Metalanguage with Recursive Types; Guy McCusker Book 1998 Springer-Verlag London Limited 1998

BALE

Foreknowledge

惡意

978-1-4471-1165-8Springer-Verlag London Limited 1998

abstemious

Cost Allocation as Cooperative Games,some code does not change the behaviour, or that a given program meets its specification. However, the problem of showing that two programs are equivalent is not at all simple. Syntax is clumsy and difficult to work with, and in any case it is not really the syntax that is of concern, but the .: wha

antecedence

催眠藥

HALO

Fuzzy Set Theory and Psychology, .. Typically each type . of the language is interpreted as an object ?.? in the semantic category, and a program . of type . with a single free variable of type . is interpreted as a morphism ?.? : ?.? →?.?. (More free variables are handled using products in the category.) Supposing that a notion o

Fortify

Prior and Likelihood Representation,ation that the category ε of games constructed in Chapter 3 captures precisely the notion of sequential functional computation embodied in .. The content of this chapter is largely technical in nature, involving a detailed analysis of the strategies which form the morphisms in ε We first reduce the

積習已深

Allergic

Introduction,some code does not change the behaviour, or that a given program meets its specification. However, the problem of showing that two programs are equivalent is not at all simple. Syntax is clumsy and difficult to work with, and in any case it is not really the syntax that is of concern, but the .: wha