


default search action
"Linear realizability and full completeness for typed lambda-calculi."
Samson Abramsky, Marina Lenisa (2005)
- Samson Abramsky
, Marina Lenisa:
Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Log. 134(2-3): 122-168 (2005)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.