Extending PowerEpsilon with algebraic rewriting

Authors:
Li-Xin Zeng;Ming-Yuan Zhu
Affiliations:
Beijing Institute of Systems Engineering, P.O.Box 9702-19, Beijing 100101, People's Republic of China;Beijing Institute of Systems Engineering, P.O.Box 9702-19, Beijing 100101, People's Republic of China
Venue:
ACM SIGPLAN Notices
Year:
1994

Citing 4
Cited 0

The calculus of constructions

Information and Computation - Semantics of Data Types
On the representation of data in lambda-calculus

CSL '89 Proceedings of the third workshop on Computer science logic
Polymorphic rewriting conserves algebraic strong normalization

Selected papers of the 16th international colloquium on Automata, languages, and programming
Towards a theory of type structure

Programming Symposium, Proceedings Colloque sur la Programmation

Quantified Score

Hi-index	0.00

Visualization

Abstract

PowerEpsilon ([ZhuW9l]) is a strongly-typed polymorphic functional programming language based on Martin-Löf's type theory and the Calculus of Constructions. In PowerEpsilon there are no constant time definitions of the predecessor functions which will lead to non-efficient programs. In this paper, we give a solution to this problem by introducing an algebraic rewriting mechanism into the system.