SIGN IN
SIGN UP
Proving correctness via free theorems: the case of the destroy/build-rule
Full Text:
PDF
Buy this Article
Author:
Janis Voigtländer
Technische Universität Dresden, Germany
Published in:
· Proceeding
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Pages 13-20
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-977-7
doi>
10.1145/1328408.1328412
2008 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 125
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
applicative programming
correctness proofs
data types and structures
intermediate data structures
languages
polymorphism
program transformations
rank-2 types
relational parametricity
shortcut deforestation
theorems for free
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder