University of Oxford Logo University of OxfordDepartment of Computer Science - Home

Linear realizability and full completeness for typed lambda−calculi

S. Abramsky and M. Lenisa

Details

Book Title

Annals of Pure and Applied Logic

Pages

122−168

Volume

134

Year

2005

Links

BibTeX

Download  (ps)

Related pages

People