Unary PCF is decidable
type: Item
instance of: scholarly article
title: Unary PCF is decidable
zbMATH Open document ID: 0916.68017
DOI: 10.1016/S0304-3975(98)00048-6
author: Ralph Loader
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1238726
zbMATH Keywords: Lambda calculus
zbMATH Keywords: PCF
zbMATH Keywords: decidability
zbMATH Keywords: definability
MaRDI profile type: Publication
cites work: Polymorphic rewriting conserves algebraic confluence
cites work: The variable containment problem
cites work: Finitary PCF is not decidable
cites work: Decidability of all minimal models
cites work: LCF considered as a programming language
cites work: Decidability of behavioural equivalence in unary PCF
cites work: Logical relations and the typed λ-calculus
description: scientific article; zbMATH DE number 1238726