Abstract

The way in which local data and data structures can be incorporated into untyped functional programming (FP) is demonstrated. A functional form called an infinite conditional (the CASE functional form) is added to the set of functional forms. CASE can be used to select functions dynamically, which has the effect of transforming objects into functions. In order to simulate pointers in algorithms on data structures, CASE could be used to define functions, which has the effect of changing contents of nodes into selector functions. Objects are defined using data structures which support local data. None of the definitions violate the simple semantics of FP. The object definitions also provide a mechanism to incorporate I/O into the FP style of programming. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.