Mathematical Foundations of Programming Semantics [electronic resource] : 5th International Conference Tulane University, New Orleans, Louisiana, USA March 29–April 1, 1989 Proceedings / edited by M. Main, A. Melton, M. Mislove, D. Schmidt.

By: Main, M [editor.]Contributor(s): Melton, A [editor.] | Mislove, M [editor.] | Schmidt, D [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 442Publisher: New York, NY : Springer New York, 1990Description: VIII, 444 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780387348087Subject(s): Computer science | Computer software | Logic design | Computer Science | Logics and Meanings of Programs | Algorithm Analysis and Problem Complexity | Programming TechniquesAdditional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access online
Contents:
A generalized Kahn Principle for abstract asynchronous networks -- Operations on records -- Connections between a concrete and an abstract model of concurrent systems -- A hierarchy of domains for real-time distributed computing -- Factorizing proofs in timed CSP -- Unbounded nondeterminism in CSP -- The semantics of priority and fairness in occam -- Inductively defined types in the Calculus of Constructions -- On some semantic issues in the reflective tower -- Semantic models for total correctness and fairness -- Equationally fully abstract models of PCF -- Generalization of final algebra semantics by relativization -- Termination, deadlock and divergence -- A category-theoretic semantics for unbounded indeterminacy -- Algebraic types in PER models -- Pseudo-retract functors for local lattices and bifinte L-domains -- L-domains and lossless powerdomains -- Does “N+1 times” prove more programs correct than “N times”? -- An algebraic formulation for data refinement -- Categorical semantics for programming languages -- Initial algebra semantics for lambda calculi.
In: Springer eBooksSummary: This is the latest in a series of proceedings of conferences on the Mathematical Foundations of Programming Semantics. The purpose of the series is to bring together mathematicians and theoretical computer scientists who share the common interests of working on problems related to programming language semantics. The purpose of the book is to bring into print as quickly as possible papers which reflect the state of research on the topics comprising this area. The intended audience for the book consists of those researchers and graduate students with an interest in the research areas which are related to those presented in the book: programming language semantics, including algebraic, denotational and operational semantics, logics of programs, specification techniques, etc., and the relevant areas of mathematics research, including category theory, domain theory, ordered structures and lattice theory, and metric space methods. The papers included in the book represent the latest results in various facets of this rather broad research area, and this is the first time some of the ideas contained in these works are appearing in print.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

A generalized Kahn Principle for abstract asynchronous networks -- Operations on records -- Connections between a concrete and an abstract model of concurrent systems -- A hierarchy of domains for real-time distributed computing -- Factorizing proofs in timed CSP -- Unbounded nondeterminism in CSP -- The semantics of priority and fairness in occam -- Inductively defined types in the Calculus of Constructions -- On some semantic issues in the reflective tower -- Semantic models for total correctness and fairness -- Equationally fully abstract models of PCF -- Generalization of final algebra semantics by relativization -- Termination, deadlock and divergence -- A category-theoretic semantics for unbounded indeterminacy -- Algebraic types in PER models -- Pseudo-retract functors for local lattices and bifinte L-domains -- L-domains and lossless powerdomains -- Does “N+1 times” prove more programs correct than “N times”? -- An algebraic formulation for data refinement -- Categorical semantics for programming languages -- Initial algebra semantics for lambda calculi.

This is the latest in a series of proceedings of conferences on the Mathematical Foundations of Programming Semantics. The purpose of the series is to bring together mathematicians and theoretical computer scientists who share the common interests of working on problems related to programming language semantics. The purpose of the book is to bring into print as quickly as possible papers which reflect the state of research on the topics comprising this area. The intended audience for the book consists of those researchers and graduate students with an interest in the research areas which are related to those presented in the book: programming language semantics, including algebraic, denotational and operational semantics, logics of programs, specification techniques, etc., and the relevant areas of mathematics research, including category theory, domain theory, ordered structures and lattice theory, and metric space methods. The papers included in the book represent the latest results in various facets of this rather broad research area, and this is the first time some of the ideas contained in these works are appearing in print.

There are no comments on this title.

to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha