scientific article
From MaRDI portal
Publication:3138547
zbMath0798.68097MaRDI QIDQ3138547
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Mechanizing logical relations ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Full abstraction for the second order subset of an Algol-like language ⋮ Projecting sequential algorithms on strongly stable functions ⋮ 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 ⋮ Program equivalence in a simple language with state ⋮ On phase semantics and denotational semantics in multiplicative-additive linear logic ⋮ A characterization of lambda definability in categorical models of implicit polymorphism ⋮ The variable containment problem ⋮ On phase semantics and denotational semantics: The exponentials ⋮ A relational account of call-by-value sequentiality ⋮ Finitary PCF is not decidable ⋮ On the expressive power of first-order boolean functions in PCF ⋮ Definability and Full Abstraction ⋮ Linear capabilities for fully abstract compilation of separation-logic-verified code ⋮ Relative definability of boolean functions via hypergraphs
This page was built for publication:
