A semantic editor

Authors:
R. Kent Dybvig;Bruce T. Smith
Affiliations:
The University oy North Carolina at Chapel Hill;The University of North Carolina at Chapel Hill, Microelectronics Center of North Carolina
Venue:
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Year:
1985

Citing 10
Cited 0

Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Interactive Editing Systems: Part I

ACM Computing Surveys (CSUR)
Program Transformation Systems

ACM Computing Surveys (CSUR)
Programming with Equations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Universal Unification

Proceedings of the 7th International Conference on Automated Deduction
Rewriting systems on FP expressions that reduce the number of sequences they yield

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Type inference and type checking for functional programming languages: A reduced computation approach

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
A simple optimizer for FP-like languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Transformations of FP program schemes

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an interactive tool for program development and transformation, a semantic editor. The domain of the semantic editor is Backus's FP programming language. The editor facilitates manipulation of FP program schemas by the meaning-preserving transformations of FP's algebra of programs. The semantic editor aids program development, program optimization and equivalence proofs. It also serves as a tool for investigating the algebra of programs itself. The semantic editor does not depend on the existence of normal forms for FP programs. Instead, a history of all program transformations is retained in the system in the form of a congruence relation. The user is free to step through the congruence classes to see different but equivalent versions of his programs. A program equivalence is applied to a program schema by unifying one side of the equivalence with a sub-program, then labeling it congruent to the other side if the unification is successful. A congruence closure algorithm is applied to find any new congruence relations in expressions containing these program schemas. The program schemas are represented internally by a directed, acyclic graph (dag) with identical sub-programs occupying the same sub-graph. The semantic editor uses the Patterson and Wegman unification algorithm and the Nelson and Oppen congruence closure algorithm. Both employ the dag representation. The system is implemented in Scheme, a dialect of Lisp.