Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
Linear realizability and full completeness for typed lambda−calculi
Linear realizability and full completeness for typed lambda−calculi
S. Abramsky and M. Lenisa
Book Title
Annals of Pure and Applied Logic
Pages
122−168
Volume
134
Year
2005
Links
BibTeX
Download (ps)
See Also
Samson Abramsky
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top