The language theory of Lambdainfty, a typed lambda-calculus where terms are types

L.S. Benthem Jutting, van

The language theory of Lambdainfty, a typed lambda-calculus where terms are types

L.S. Benthem Jutting, van

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

2 Downloads (Pure)

Abstract

No abstract.

Original language	English
Title of host publication	Selected Papers on Automath
Editors	R.P. Nederpelt, J.H. Geuvers, R.C. Vrijer, de
Place of Publication	Amsterdam
Publisher	North-Holland Publishing Company
Pages	655-683
ISBN (Print)	0-444-89822-0
Publication status	Published - 1994

Publication series

Name	Studies in Logic
Volume	133

Cite this

@inbook{304937b0006a4172adc7d73113505ae4,

title = "The language theory of Lambdainfty, a typed lambda-calculus where terms are types",

abstract = "No abstract.",

author = "\{Benthem Jutting, van\}, L.S.",

year = "1994",

language = "English",

isbn = "0-444-89822-0",

series = "Studies in Logic",

publisher = "North-Holland Publishing Company",

pages = "655--683",

editor = "R.P. Nederpelt and J.H. Geuvers and \{Vrijer, de\}, R.C.",

booktitle = "Selected Papers on Automath",

address = "Netherlands",

}

The language theory of Lambdainfty, a typed lambda-calculus where terms are types. / Benthem Jutting, van, L.S.
Selected Papers on Automath. ed. / R.P. Nederpelt; J.H. Geuvers; R.C. Vrijer, de. Amsterdam: North-Holland Publishing Company, 1994. p. 655-683 (Studies in Logic; Vol. 133).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

TY - CHAP

T1 - The language theory of Lambdainfty, a typed lambda-calculus where terms are types

AU - Benthem Jutting, van, L.S.

PY - 1994

Y1 - 1994

N2 - No abstract.

AB - No abstract.

M3 - Chapter

SN - 0-444-89822-0

T3 - Studies in Logic

SP - 655

EP - 683

BT - Selected Papers on Automath

A2 - Nederpelt, R.P.

A2 - Geuvers, J.H.

A2 - Vrijer, de, R.C.

PB - North-Holland Publishing Company

CY - Amsterdam

ER -

The language theory of Lambdainfty, a typed lambda-calculus where terms are types

Abstract

Publication series

Fingerprint

Cite this