Iteration for applicative languages

Authors:
A. L. Furtado;P. A. S. Velosa
Affiliations:
Univ. Catolica, Rio de Janeiro, Brazil;Univ. Catolic, Rio de Janeiro, Brazil
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 8
Cited 0

Structuring FP-style functional programs

Computer Languages
Towards functional programming in Prolog

ACM SIGPLAN Notices
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Implementation of PROLOG

Implementation of PROLOG
Formal Specifications of Programming Language: A Panoramic Primer

Formal Specifications of Programming Language: A Panoramic Primer
Algorithmic Language and Program Development

Algorithmic Language and Program Development
Theory of Computation

Theory of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mathematical notion of function exponentiation is used to introduce an iteration construct suitable to applicative languages. The elements of the construct are explained as well as its evaluation. A prototype Prolog implementation is included to illustrate the discussion.