SIGN IN
SIGN UP
Simple termination of context-sensitive rewriting
Full Text:
Pdf
Buy this Article
Authors:
Bernhard Gramlich
Institut für Computersprachen Technische Universität Wien Favoritenstr. 9, A-1040 Wien, Austria
Salvador Lucas
DSIC Universidad Politécnica de Valencia Camino de Vera s/n, 46022 Valencia, Spain
Published in:
· Proceeding
RULE '02
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Pages 29 - 42
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-606-4
doi>
10.1145/570186.570189
2002 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 202
· Citation Count: 10
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:
applicative programming
automatic proofs of termination
context-sensitive rewriting
declarative programming
design
evaluation strategies
evaluation strategies
languages
modular program analysis and verification
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