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

@inproceedings{Bellot1987ATF,
  title={A theory for natural modelisation and implementation of functions with variable arity},
  author={P. Bellot and V. Jay},
  booktitle={FPCA},
  year={1987}
}
  • P. Bellot, V. Jay
  • Published in FPCA 1987
  • Computer Science
  • 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. 
    6 Citations

    Figures and Topics from this paper

    Unformly Applicative Structures, A Theory of Computability and Polyadic Functions
    • P. Bellot
    • Mathematics, Computer Science
    • FSTTCS
    • 1988
    Extending Functional Programming Towards Relations
    • 3
    • PDF
    Functions and Relations: The GRAAL System
    A new approach to procedures with variable arity
    • 16
    • PDF
    A variable-arity procedural interface
    • 7

    References

    SHOWING 1-10 OF 16 REFERENCES
    A new implementation technique for applicative languages
    • D. Turner
    • Computer Science
    • Softw. Pract. Exp.
    • 1979
    • 682
    • PDF
    Introduction to Combinators and Lambda-Calculus
    • 241
    • PDF
    The lambda calculus - its syntax and semantics
    • H. Barendregt
    • Mathematics, Computer Science
    • Studies in logic and the foundations of mathematics
    • 1985
    • 3,671
    The U-Interpreter
    • 187
    Proposal for A Natural Formalization of Functional Programming Concepts
    • 1
    • PDF
    Compiling a functional language
    • 157
    • PDF