Relative definability of boolean functions via hypergraphs

DOI10.1016/S0304-3975(00)00332-7zbMath1002.68106MaRDI QIDQ1605175

Pasquale Malacaria, Antonio Bucciarelli

Publication date: 15 July 2002

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

zbMATH Keywords

Boolean functionsPCFdegrees of parallelism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Boolean functions (06E30)

Related Items (1)

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

Uses Software

• LCF

Cites Work

• The system \({\mathcal F}\) of variable types, fifteen years later
• LCF considered as a programming language
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Sequentiality in an extensional framework
• Degrees of parallelism in the continuous type hierarchy
• Parallel and serial hypercoherences
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Kripke logical relations and PCF
• Interdefinability of parallel operations in PCF
• Mechanizing logical relations
• Finitary PCF is not decidable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relative definability of boolean functions via hypergraphs