eCommons

 

An Environment for Automated Reasoning About Partial Functions

dc.contributor.authorBasin, David A.en_US
dc.date.accessioned2007-04-23T17:23:17Z
dc.date.available2007-04-23T17:23:17Z
dc.date.issued1987-11en_US
dc.description.abstractWe report on a new environment developed and implemented inside the Nuprl type theory that facilitates proving theorems about partial functions. It is the first such automated type-theoretic account of partiality. We demonstrate that such an environment can be used effectively for proving theorems about computability and for developing partial programs with correctness proofs. This extends the well-known proofs as programs paradigm to partial functions.en_US
dc.format.extent1208827 bytes
dc.format.extent294554 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-884en_US
dc.identifier.urihttps://hdl.handle.net/1813/6724
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Environment for Automated Reasoning About Partial Functionsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
87-884.pdf
Size:
1.15 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
87-884.ps
Size:
287.65 KB
Format:
Postscript Files