OXFORD UNIVERSITY COMPUTING LABORATORY

Linear realizability and full completeness for typed lambda-calculi

S. Abramsky and M. Lenisa

info

book title

Annals of Pure and Applied Logic

pages

122-168

volume

134

year

2005

links

BibTeX

Download (ps)

related pages

people

Random Image
Random Image
Random Image