M.B. Trakhtenbrot. On Representation of Sequential and Parallel Functions. In Proc. Fourth Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 32, Springer 1975. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Relative Definability of Boolean Functions via Hypergraphs - Bucciarelli (Correct)
....equiparallel) then we would have a simple and e ective tool for the study of degrees. We will indeed prove such a result as a corollary of our main result: hypergraphs morphisms re ect par relations. 1. 1 Related works The study of degrees of parallelism was pioneered by Sazonov and Tracktembrot [14,18] who singled out some nite subposet of degrees. Some results on degrees are corollary of well known facts: for instance Plotkin full abstraction result for PCF por implies that this poset has a top. The bottom of degrees is the set of PCF de nable functions which is fully characterized by the ....
M.B. Trakhtenbrot. On Representation of Sequential and Parallel Functions. In Proc. Fourth Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 32, Springer 1975.
Logical Full Abstraction and PCF - Longley, Plotkin (1996) (1 citation) (Correct)
....the recursive versions of categories of games [1, 8] Note in passing that the evident r.e. subinterpretation of Milner s EFA interpretation for PCF [12] does not provide an LFA interpretation, as there exist first order functions that are effective and sequential but not PCF definable (see e.g. [19]) We do not know of any natural LFA interpretations for PCF . Although in this paper we have concentrated mainly on LFA interpretations for the whole of J L , it is also natural to consider logical full abstraction for fragments of the language. One way to obtain such a fragment is to ....
M. B. Trakhtenbrot, On Representation of Sequential and Parallel Functions, in Proc. 4th Symposium on Mathematical Foundations of Computer Science, LNCS 32, pp. 411--417, Springer-Verlag, Berlin, 1975. 20
A Uniform Approach to Domain Theory in Realizability Models - Longley, Simpson (1996) (5 citations) (Correct)
No context found.
M.B. Trakhtenbrot. On representation of sequential and parallel functions. In Proc. 4th Symposium on Mathematical Foundations of Computer Science. Springer LNCS 32, 1975.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC