Extracting Non-Deterministic Concurrent Programs.

DOI10.4230/LIPIcs.CSL.2016.26zbMath1369.68128OpenAlexW2533507430MaRDI QIDQ5278412

No author found.

Publication date: 19 July 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CSL.2016.26

zbMATH Keywords

proof theoryrealizabilityprogram extractionconcurrencycomputable analysisnon-determinism

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Constructive and recursive analysis (03F60) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Extracting total Amb programs from proofs ⋮ Unnamed Item ⋮ Intuitionistic fixed point logic

This page was built for publication: Extracting Non-Deterministic Concurrent Programs.