Curry's type-rules are complete with respect to the F-semantics too
type: Item
instance of: scholarly article
title: Curry's type-rules are complete with respect to the F-semantics too
zbMATH Open document ID: 0512.03010
DOI: 10.1016/0304-3975(83)90141-X
author: Roger Hindley
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 3807587
zbMATH Keywords: combinatory logic
zbMATH Keywords: semantics
zbMATH Keywords: type assignment
MaRDI profile type: Publication
cites work: The completeness theorem for typing lambda-terms
cites work: Combinatory logic. Vol. II
full work available at URL: 0304-3975(83)90141-x
OpenAlex ID: W2083844489
description: scientific article; zbMATH DE number 3807587