Searching for "Definability and Full Abstraction." – sorted by Relevance.
-
A Characterization Of Lambda Definability In Categorical Models Of Implicit Polymorphism
- definability and the full abstraction problem for various models of languages based on simply typed lambda
- Cited by 12 (0 self) – Add To MetaCart
-
A fully abstract trace semantics for general references
- , definability and full abstraction results extend straightforwardly to this setting. 1.1 Related Work Labelled
- Cited by 1 (0 self) – Add To MetaCart
-
A Semantic analysis of control
- cartesian closed category with infinite products. Computational adequacy, definability and full abstraction
- Cited by 29 (5 self) – Add To MetaCart
-
Overview of Milner’s work
- show that a certain class of bistructures represent bidomains. 2. Axioms for Definability and Full
- Add To MetaCart
-
Proof, Language, and Interaction: Essays in Honour of Robin Milner
- show that a certain class of bistructures represent bidomains. 2. Axioms for Definability and Full
- Add To MetaCart
-
Full Abstraction, Totality and PCF
- notion of full abstraction appropriate for totality. It turns out that one can define both operational
- Cited by 6 (1 self) – Add To MetaCart
-
Proving Behavioural Theorems with Standard First-Order Logic
- . [11]), we define full abstractness with respect to the observable sorts SObs as follows: Definition
- Cited by 15 (5 self) – Add To MetaCart
-
Objects, Interference, and the Yoneda Embedding
- of state change. As an indication of the accuracy obtained, we present a full abstraction result for closed
- Cited by 15 (5 self) – Add To MetaCart
-
Embedding
- well [22]. But we have not obtained definability and full abstraction results in the presence
- Add To MetaCart
-
Reversible, Irreversible and Optimal lambda-machines (Extended Abstract)
- of an embedding of AJM-games into HO-games, which in turns gives a simple proof of definability, or full
- Cited by 6 (1 self) – Add To MetaCart

