Comparing models of the intensional typed \(\lambda\)-calculus
type: Item
instance of: scholarly article
title: Comparing models of the intensional typed \(\lambda\)-calculus
zbMATH Open document ID: 0872.03009
DOI: 10.1016/0304-3975(95)00140-9
author: R. Hoofman
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 983423
zbMATH Keywords: powerset models
zbMATH Keywords: typed lambda calculus
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00140-9
OpenAlex ID: W1971835373
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: The system \({\mathcal F}\) of variable types, fifteen years later
cites work: Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
cites work: Lambda‐Calculus Models and Extensionality
cites work: Q2757813
cites work: The theory of semi-functors
cites work: Continuous information systems
cites work: Q4501148
cites work: Set-theoretical and other elementary models of the \(\lambda\)-calculus
description: scientific article; zbMATH DE number 983423