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

L.S. Benthem Jutting, van

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

2 Downloads (Pure)

Abstract

No abstract.
Original languageEnglish
Title of host publicationSelected Papers on Automath
EditorsR.P. Nederpelt, J.H. Geuvers, R.C. Vrijer, de
Place of PublicationAmsterdam
PublisherNorth-Holland Publishing Company
Pages655-683
ISBN (Print)0-444-89822-0
Publication statusPublished - 1994

Publication series

NameStudies in Logic
Volume133

Fingerprint

Dive into the research topics of 'The language theory of Lambdainfty, a typed lambda-calculus where terms are types'. Together they form a unique fingerprint.

Cite this