Some FP algebra with currying operation

DOI10.1016/0020-0190(83)90110-2MaRDI QIDQ789160zbMATH OpenOpenAlexWikidataFDO

Authors Tetsuo Ida

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90110-2

zbMATH Keywords

combinatorfunctional programmingprogram algebra

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Review text

This paper is concerned with the algebra of function equations in the framework of a functional programming language FP proposed by Backus. In the original FP, a certain types of algorithms which are naturally expressed by Curried functions are awkward to express. Therefore, we introduce combinators into FP, and give algebraic equations that hold between the FP expressions without the use of Curried functions and the new FP expressions which make use of Curried functions and the combinators.

Cites work

• A new implementation technique for applicative languages
• Can programming be liberated from the von Neumann style?
• scientific article; zbMATH DE number 3960963 (Why is no real title available?)

Cited in

(5)

• Curry algebras P
• scientific article; zbMATH DE number 6476783 (Why is no real title available?)
• scientific article; zbMATH DE number 3871313 (Why is no real title available?)
• scientific article; zbMATH DE number 3928329 (Why is no real title available?)
• scientific article; zbMATH DE number 4094791 (Why is no real title available?)

This page was built for publication: Some FP algebra with currying operation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789160)