Abstract
In order to study relative PCF-definability of boolean functions, we associate a hypergraph H f to any boolean function f (following [3,5]).
We introduce the notion of timed hypergraph morphism and show that it is:
-
Sound: if there exists a timed morphism from H f to H g then f is PCF-definable relatively to g.
-
Complete for subsequential functions: if f is PCF-definable relatively to g, and g is subsequential, then there exists a timed morphism from H f to H g .
We show that the problem of deciding the existence of a timed morphism between two given hypergraphs is NP-complete.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
An annotated list of selected NP-complete problems, http://www.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html
Amadio, R.M., Curien, P.-L.: Domains and Lambda-Calculi. In: Cambridge Tracts in Theoretical Computer Science, vol. 46, Cambridge University Press, Cambridge (1998)
Bucciarelli, A.: Degrees of parallelism in the continuous type hierarchy. Theoretical Computer Science 177(1), 59–71 (1997)
Bucciarelli, A., Ehrhard, T.: Sequentiality in an extensional framework. Information and Computation 110(2), 265–296 (1994)
Bucciarelli, A., Malacaria, P.: Relative definability of boolean functions via hypergraphs. Theoretical Computer Science 278, 91–110 (2002)
Curien, P.-L.: Categorical Combinators,Sequential Algorithms and Functional Programming. Birkhäuser, revised edition (1993)
Loader, R.: Finitary PCF is not decidable. Theoretical Computer Science 266(1– 2), 341–364 (2001)
Plotkin, G.D.: LCF considered as a programming language. Theoretical Computer Science 5(3), 223–255 (1977)
Pucella, Panangaden.: On the expressive power of first-order boolean functions in PCF. TCS: Theoretical Computer Science, 266 (2001)
Sazonov, V.Y.: Degrees of parallelism in computations. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 517–523. Springer, Heidelberg (1976)
Scott, D.S.: A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science 121(1–2), 411–440 (1993)
Sieber, K.: Reasoning about sequential functions via logical relations. In: Fourman, M.P., Johnstone, P.T., Pitts, A.M. (eds.) Proc. LMS Symposium on Applications of Categories in Computer Science, Durham. LMS, vol. 177, pp. 258–269. Cambridge University Press, Cambridge (1992)
Stoughton, A.: Mechanizing logical relations. Lecture Notes in Computer Science 802, 359–377 (1994)
Trackhtenbrot, M.B.: On representation of sequential and parallel functions. In: Becvar, J. (ed.) MFCS 1975. LNCS, vol. 32, Springer, Heidelberg (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bucciarelli, A., Leperchey, B. (2004). Hypergraphs and Degrees of Parallelism: A Completeness Result. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive