Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Milner:1977:FAM, author = "R. Milner", title = "Fully abstract models of typed $\lambda$-calculi", journal = j-THEOR-COMP-SCI, volume = "4", number = "1", pages = "1--22", month = feb, year = "1977", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Edinburgh Univ., Edinburgh, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "denotational semantic definition; formal languages; fully abstract models; programming language; typed lambda-calculi", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }