scientific article; zbMATH DE number 2061703

zbMATH Open1039.68031MaRDI QIDQ4457450FDOQ4457450

Authors: Antonio Bucciarelli, Benjamin Leperchey, Vincent Padovani 

Publication date: 22 March 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2701/27010075.htm

Title of this publication is not available (Why is that?)

Recommendations

• Unary PCF is decidable
• Full abstraction for PCF
• Decidability of behavioural equivalence in unary PCF
• A relative PCF-definability result for strongly stable functions and some corollaries
• scientific article; zbMATH DE number 1531361

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Cited In (2)

• Unfixing the fixpoint: the theories of the \(\lambda Y\)-calculus
• Decidability of behavioural equivalence in unary PCF

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457450)