Decision algorithms for checking definability of order-2 finitary PCF

DOI10.1007/978-3-319-26529-2_17MaRDI QIDQ3459425zbMATH OpenOpenAlexFDO

Authors Sadaaki Kawata, Kazuyuki Asada, Naoki Kobayashi

Publication date 8 January 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26529-2_17

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• Finitary PCF is not decidable
• scientific article; zbMATH DE number 512784
• scientific article; zbMATH DE number 1531361
• A relative PCF-definability result for strongly stable functions and some corollaries
• Full abstraction for PCF

Cited in

(1)

• Finitary PCF is not decidable

This page was built for publication: Decision algorithms for checking definability of order-2 finitary PCF

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