scientific article; zbMATH DE number 4016174

From MaRDI portal
Publication:3028328





[For the entire collection see Zbl 0621.00026.] The aim of this article is to provide a new theoretical framework based on combinators for the study and implementation of applicative programming languages. This formal theory can be viewed as a Computability theory where functions are defined in a natural and usable way because Curryfication is abolished. This allows short definitions of functions and fast graph reduction machines.











This page was built for publication:

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