Defining concurrent processes constructively

DOI10.1016/0304-3975(94)90205-4zbMath0801.68056OpenAlexW1993553418WikidataQ127937952 ScholiaQ127937952MaRDI QIDQ1314421

Yukihide Takayama

Publication date: 22 February 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90205-4

zbMATH Keywords

constructive logicintuitionismformal program developmentconcurrent processstream typesstream-based concurrent programs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Intuitionistic mathematics (03F55)

Uses Software

• Nuprl
• Quty

Cites Work

• Linear logic
• Extraction of redundancy-free programs from constructive natural deduction proofs
• A functional programming approach to the specification and verification of concurrent systems
• Constructivism in mathematics. An introduction. Volume I
• \(QPC_ 2\): A constructive calculus with parameterized specifications
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• A final coalgebra theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Defining concurrent processes constructively