Constructive Methods in Computing Science

This paper explains the notion of propositions as types within the context of Per Martin-LM's theory of types. The relationship between constructive and classical logic is also discussed. In addition mention is made of the connection between the natural-deduction-style reasoning used here and the theory of preorders discussed by Hoare elsewhere in this volume. "The material in these notes is adapted from an excerpt of the forthcoming book entitled "Constructive Type Theory" and is reproduced here with the permission of its publishers, Prentice/Hall International, Inc. NATO ASI Series, Vol. F 55 Constructive Methods in Computing Science Edited by M. Broy © Springer-Verlag Berlin Heidelberg 1989

[1]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[2]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[3]  Leslie Lamport,et al.  Artificial Intelligence and Language Processing ]acques Cohen Editor a Simple Approach to Specifying Concurrent Systems , 2022 .

[4]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[5]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[6]  David Gries,et al.  A Note on a Standard Strategy for Developing Loop Invariants and Loops , 1982, Sci. Comput. Program..

[7]  Matthew Hennessy,et al.  A Term Model for CCS , 1980, MFCS.

[8]  Edsger W. Dijkstra,et al.  Co-operating sequential processes , 1968 .

[9]  Manfred Broy,et al.  Applicative Real-Time Programming , 1983, IFIP Congress.

[10]  James J. Horning,et al.  Synchronization Primitives for a Multiprocessor: A Formal Speci cation , 1987 .

[11]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[12]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[13]  Edsger W. Dijkstra.  A Tutorial on the Split Binary Semaphore , 1982 .

[14]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[15]  Butler W. Lampson,et al.  Designing a global name service , 1986, PODC '86.

[16]  K. Mani Chandy.  Concurrent programming for the masses (invited address) , 1985, PODC '85.

[17]  P Degano,et al.  Distributed systems, partial orderings of events, and event structures , 1986 .

[18]  J. D. Brock,et al.  Finding the Largest Empty Rectangle on a Grated Surface , 1987, STACS.

[19]  Martin Rem,et al.  Small Programming Exercises 5 , 1984, Science of Computer Programming.

[20]  Manfred Broy,et al.  Specification and Top Down Design of Distributed Systems , 1985, TAPSOFT, Vol.1.

[21]  Robin Milner,et al.  On relating synchrony and asynchrony , 1980 .

[22]  Arthur J. Bernstein,et al.  Analysis of Programs for Parallel Processing , 1966, IEEE Trans. Electron. Comput..

[23]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[24]  Manfred Broy,et al.  A Theory for Nondeterminism, Parallelism, Communication, and Concurrency , 1986, Theor. Comput. Sci..

[25]  Manfred Broy,et al.  Predicative Specifications for Functional Programs Describing Communication Networks , 1987, Inf. Process. Lett..

[26]  Józef Winkowski,et al.  Behaviours of Concurrent Systems , 1980, Theor. Comput. Sci..

[27]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[28]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers , 1985 .

[29]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.