A Complete Transformational Toolkit for Compilers

A Complete Transformational Toolkit for Compilers (1996)

Cached

Download Links

[ftp.cwi.nl]
[www.cwi.nl]

Other Repositories/Bibliography

DBLP

by J.A. Bergstra , T.B. Dinesh , J. Field , J. Heering

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	21 - 9 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Complete Transformational Toolkit for Compilers	user correction - Legacy Corrections
AUTHOR NAME	J.A. Bergstra	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	T.B. Dinesh	user correction - Legacy Corrections
AUTHOR AFFIL	; 2; 3	user correction - Legacy Corrections
AUTHOR ADDR	;, J. Field	user correction - Legacy Corrections
AUTHOR NAME	J. Field	user correction - Legacy Corrections
AUTHOR NAME	J. Heering	user correction - Legacy Corrections
AUTHOR AFFIL	; 2; 1; Faculty of Mathematics and Computer Science, University of Amsterdam; 2; 3; IBM T.J. Watson Research Center	user correction - Legacy Corrections
AUTHOR ADDR	; Kruislaan 403, 1098 SJ Amsterdam, The Netherlands (janb@fwi.uva.nl); CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands; P.O. Box 704, Yorktown Heights, NY 10598, USA	user correction - Legacy Corrections
ABSTRACT	. In an earlier paper, one of the present authors presented a preliminary account of an equational logic called PIM. PIM is intended to function as a "transformational toolkit" to be used by compilers and analysis tools for imperative languages, and has been applied to such problems as program slicing, symbolic evaluation, conditional constant propagation, and dependence analysis. PIM consists of the untyped lambda calculus extended with an algebraic rewriting system that characterizes the behavior of lazy stores and generalized conditionals. A major question left open in the earlier paper was whether there existed a complete equational axiomatization of PIM's semantics. In this paper, we answer this question in the affirmative for PIM's core algebraic component, PIM t , under the assumption of certain reasonable restrictions on term formation. We systematically derive the complete PIM logic as the culmination of a sequence of increasingly powerful equational systems starti...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	ACM Transactions on Programming Languages and Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	639--684	INFERENCE
VOLUME	19	INFERENCE
CITATIONS	28 found	ParsCit 1.0