Skip to main content
Conference ProceedingsOPEN ACCESS

A theory for natural modelisation and implementation of functions with variable arity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1987) 274 LNCS 212-233
DOI: 10.1007/3-540-18317-5_13
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The aim of this article is to provide a new theorical 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.

Cite

CITATION STYLE

APA

Bellot, P., & Jay, V. (1987). A theory for natural modelisation and implementation of functions with variable arity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 274 LNCS, pp. 212–233). Springer Verlag. https://doi.org/10.1007/3-540-18317-5_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free