Degrees of parallelism in the continuous type hierarchy

DOI10.1016/S0304-3975(96)00234-4zbMath0901.68066OpenAlexW2090873633MaRDI QIDQ1391861

Antonio Bucciarelli

Publication date: 23 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00234-4

zbMATH Keywords

stabilitystrong stabilitysequentiality relationslogical relationssequentiality

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15)

Related Items (3)

A stable programming language ⋮ On the expressive power of first-order boolean functions in PCF ⋮ Relative definability of boolean functions via hypergraphs

Cites Work

• LCF considered as a programming language
• Mechanizing logical relations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degrees of parallelism in the continuous type hierarchy