On the expressive power of first-order boolean functions in PCF
From MaRDI portal
Recommendations
Cites work
- Categorical combinators, sequential algorithms, and functional programming.
- Degrees of parallelism in the continuous type hierarchy
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 431771 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3514981 (Why is no real title available?)
- scientific article; zbMATH DE number 3531367 (Why is no real title available?)
- LCF considered as a programming language
- Mechanizing logical relations
- Modularity and expressibility for nets of relations
- Relative definability of boolean functions via hypergraphs
- Sequentiality in an extensional framework
Cited in
(2)
This page was built for publication: On the expressive power of first-order boolean functions in PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958769)