Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Kamareddine:1994:UAT,
author = "Fairouz Kamareddine and Rob Nederpelt",
title = "A unified approach to type theory through a refined
lambda --- calculus",
journal = j-THEOR-COMP-SCI,
volume = "136",
number = "1",
pages = "183--216",
day = "19",
month = dec,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:40 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=136&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=136&issue=1&aid=1768",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4210L (Formal languages and
computational linguistics); C4240 (Programming and
algorithm theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Barendregt's cube; lambda calculus; lambda-calculus;
logic; logic cube; type theories; type theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}