The completeness theorem for typing lambda-terms
type: Item
instance of: scholarly article
title: The completeness theorem for typing lambda-terms
zbMATH Open document ID: 0512.03009
DOI: 10.1016/0304-3975(83)90136-6
author: Roger Hindley
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 3807586
zbMATH Keywords: combinatory logic
zbMATH Keywords: semantics
zbMATH Keywords: typing
zbMATH Keywords: type assignment
describes a project that uses: ML
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90136-6
OpenAlex ID: W2090790829
cites work: Resolution in type theory
cites work: A filter lambda model and the completeness of type assignment
cites work: Q3889024
cites work: Modified basic functionality in combinatory logic
cites work: Q5565113
cites work: Q5686017
cites work: Q5537368
cites work: The Principal Type-Scheme of an Object in Combinatory Logic
cites work: Lambda‐Calculus Models and Extensionality
cites work: Q3659755
cites work: A theory of type polymorphism in programming
cites work: Q4068054
cites work: Functionals defined by recursion
cites work: Data Types as Lattices
cites work: Q3661543
cites work: Foliations on open manifolds. II
description: scientific article; zbMATH DE number 3807586