Fast verification of MLL proof nets via IMLL

doi:10.1145/1149114.1149116

Fast verification of MLL proof nets via IMLL

Full Text:

PDF

Buy this Article

Authors:	Andrzej S. Murawski	Oxford University Computing Laboratory, Oxford, United Kingdom
	C.-H. Luke Ong	Oxford University Computing Laboratory, Oxford, United Kingdom

Published in:

· Journal

ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive

Volume 7 Issue 3, July 2006
Pages 473-498
ACM New York, NY, USA
table of contents doi>10.1145/1149114.1149116

	2006 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 11 · Downloads (cumulative): 150 · Citation Count: 3

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms complexity of proof procedures disjoint union find dominator trees essential nets mathematical logic multiplicative linear logic proof nets 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 Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder