SIGN IN
SIGN UP
Compound monads in specification languages
Full Text:
PDF
Buy this Article
Author:
Jeremy E. Dawson
National ICT Australia (NICTA):, Canberra, ACT, Australia
Published in:
· Proceeding
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Pages 3-10
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-677-6
doi>
10.1145/1292597.1292600
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 106
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
POPL '14
Share:
|
Tags:
angelic choice
compound monads
demonic choice
distributive law for monads
extended substitutions
generalised substitutions
languages
languages
logics of programs
pre- and post-conditions
specification languages
theory
verification
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