Interdefinability of parallel operations in PCF

DOI10.1016/0304-3975(91)90337-2zbMath0717.68014OpenAlexW2072883797MaRDI QIDQ2638760

Allen Stoughton

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90337-2

zbMATH Keywords

programming language PCF

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (3)

A stable programming language ⋮ Operational domain theory and topology of sequential programming languages ⋮ Relative definability of boolean functions via hypergraphs

Cites Work

• Unnamed Item
• LCF considered as a programming language

This page was built for publication: Interdefinability of parallel operations in PCF