On the expressive power of first-order boolean functions in PCF

DOI10.1016/S0304-3975(00)00282-6zbMath0989.68014MaRDI QIDQ5958769

No author found.

Publication date: 3 March 2002

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

zbMATH Keywords

programming languagessemanticsPCFdegrees of parallelismsequentiality relations

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• Modularity and expressibility for nets of relations
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Sequentiality in an extensional framework
• Degrees of parallelism in the continuous type hierarchy
• Relative definability of boolean functions via hypergraphs
• Mechanizing logical relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the expressive power of first-order boolean functions in PCF