Publication:3138547
From MaRDI portal
zbMath0798.68097MaRDI QIDQ3138547
Publication date: 11 November 1993
Related Items
On phase semantics and denotational semantics: The exponentials, Finitary PCF is not decidable, On the expressive power of first-order boolean functions in PCF, Program equivalence in a simple language with state, A characterization of lambda definability in categorical models of implicit polymorphism, Full abstraction for the second order subset of an Algol-like language, Degrees of parallelism in the continuous type hierarchy, The behavior-realization adjunction and generalized homomorphic relations, Relative definability of boolean functions via hypergraphs, Projecting sequential algorithms on strongly stable functions, On phase semantics and denotational semantics in multiplicative-additive linear logic, A relational account of call-by-value sequentiality