Downloads & Free Reading Options - Results

Funds under this grant were used to support three principal activities. The first was the Twelfth Workshop on the Mathematical Foundations of Programming Semantics, which took place on the campus of the University of Colorado, Boulder from June 3 to June 5, 1996. The second was a series of visits by researchers to Tulane University during the two-mouth period June - July, 1996, to collaborate with the Principal Investigator on topics of common research interest. These visits formed the bulk of the Workshop on Concurrency listed in the title of the grant. Lastly, funds were used to help support participants in a small workshop in New Orleans from September 15 to September 17,1996 which focused on applications of semantic techniques to problems in security of distributed computing systems.

This grant provided support for the Eighth Workshop on the Mathematical Foundations of Programming Semantics, held at the University of Oxford from April 6 to April 10, 1992. The Workshop attracted 101 participants from 13 countries including the United States. Twenty-nine of the participants were graduate students. There were six invited hour talks, and 38 contributed 30-minute talks. These talks ranged from talks on abstract mathematical topics such as topology and category theory to work on the mathematical foundations underlying semantics issues, to applications of such theories to the semantics of various high-level programming languages. There were two Special Sessions at the Workshop. The first was organized by J.M. Woodcock (Oxford) on Formal Methods, and featured a talk by Cliff Jones (Manchester). The second special session was on Linear Logic. It was organized by Samson Abramsky (Imperial College), and featured an address by J.-Y. Girard (Paris), as well as talks by Jean-Marc Andreoli (Muenchen) and Philip Scott (Edinburgh and Ottawa)

The major goal of this conference series is to bring together computer scientists who work in programming semantics and mathematicians who work in areas which might impact programming semantics so that they may share ideas and discuss problems of mutual interest. By letting mathematicians see applications of their work to programming semantics and by letting computer scientists see their ideas and intuitions expressed in pure mathematics, the organizers have sought to improve communication among the researchers in these areas and to establish ties between related areas of research.

The major goal of this conference series is to bring together computer scientists who work in programming semantics and mathematicians who work in areas which might impact programming semantics so that they may share ideas and discuss problems of mutual interest. By letting mathematicians see applications of their work to programming semantics and by letting computer scientists see their ideas and intuitions expressed in pure mathematics, the organizers have sought to improve communication among the researchers in these areas and to establish ties between related areas of research.

There were seven invited lectures and 25 contributed talks at the meeting. The invited talks were on three broad topics: polymorphism, applications of category theory to programming semantics, and concurrency. The specific topics included polymorphism and type theory, the use of functor categories to model ALGOL like languages, linear logic, the semantics of dataflow networks, semantic models of CSP, and the use of probability theory to model nondeterminism.

There were seven invited lectures and 25 contributed talks at the meeting. The invited talks were on three broad topics: polymorphism, applications of category theory to programming semantics, and concurrency. The specific topics included polymorphism and type theory, the use of functor categories to model ALGOL like languages, linear logic, the semantics of dataflow networks, semantic models of CSP, and the use of probability theory to model nondeterminism.

There were seven invited lectures and 25 contributed talks at the meeting. The invited talks were on three broad topics: polymorphism, applications of category theory to programming semantics, and concurrency. The specific topics included polymorphism and type theory, the use of functor categories to model ALGOL like languages, linear logic, the semantics of dataflow networks, semantic models of CSP, and the use of probability theory to model nondeterminism.

There were seven invited lectures and 25 contributed talks at the meeting. The invited talks were on three broad topics: polymorphism, applications of category theory to programming semantics, and concurrency. The specific topics included polymorphism and type theory, the use of functor categories to model ALGOL like languages, linear logic, the semantics of dataflow networks, semantic models of CSP, and the use of probability theory to model nondeterminism.

There were seven invited lectures and 25 contributed talks at the meeting. The invited talks were on three broad topics: polymorphism, applications of category theory to programming semantics, and concurrency. The specific topics included polymorphism and type theory, the use of functor categories to model ALGOL like languages, linear logic, the semantics of dataflow networks, semantic models of CSP, and the use of probability theory to model nondeterminism.