Primitive string transformations as reductions to normal form

Authors:
Michael P. Barnett
Affiliations:
Department of Computer and Information Science, Brooklyn College of the City University of New York, Bedford Avenue, Brooklyn, New York and The John von Neumann National Supercomputer Center, 665 ...
Venue:
ACM SIGPLAN Notices
Year:
1990

Citing 6
Cited 1

The g-machine: a fast, graph-reduction evaluator

Proc. of a conference on Functional programming languages and computer architecture
Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Continued operation notation for symbol manipulation and array processing

Communications of the ACM
A simple mechanism that supports the prism language

ACM SIGPLAN Notices
Infix to prefix conversion as a PST reduction

ACM SIGPLAN Notices

Infix to prefix conversion as a PST reduction

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract