Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
36
click to vote
TCS
1998
113
views
Theoretical Computer Science
»
more
TCS 1998
»
Unary PCF is Decidable
14 years 2 days ago
Download
homepages.ihug.co.nz
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
Ralph Loader
claim paper
Read More »