Unary PCF is decidable

DOI10.1016/S0304-3975(98)00048-6zbMath0916.68017MaRDI QIDQ1274980

Ralph Loader

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilitydefinabilityLambda calculusPCF

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (6)

Unnamed Item ⋮ Finitary PCF is not decidable ⋮ Unnamed Item ⋮ Computing with Functionals—Computability Theory or Computer Science? ⋮ Decidability of behavioural equivalence in unary PCF ⋮ Definability and Full Abstraction

Cites Work

• LCF considered as a programming language
• Decidability of behavioural equivalence in unary PCF
• Polymorphic rewriting conserves algebraic confluence
• Logical relations and the typed λ-calculus
• The variable containment problem
• Decidability of all minimal models
• Finitary PCF is not decidable

This page was built for publication: Unary PCF is decidable