Higher-order uncurrying

John Hannan, Patrick Hicks

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of functions, even for functions that are passed as arguments or returned as values. The specification also supports partial unCurrying of any consecutive parameters of a function, rather than only unCurrying all of a function's parameters. We present the specification as a deductive system that axiomatizes a judgment relating a source term with an unCurried form of the term. We prove that this system relates only typeable terms and that it is correct with respect to an operational semantics. We define a practical algorithm, based on algorithm W, that implements unCurrying and prove this algorithm sound and complete with respect to the deductive system. This algorithm generates maximally unCurried forms of source terms. These results provide a declarative framework for reasoning about unCurrying and support a richer form of unCurrying than is currently found in compilers for functional languages.

Original languageEnglish (US)
Pages (from-to)179-216
Number of pages38
JournalHigher-Order and Symbolic Computation
Volume13
Issue number3
DOIs
StatePublished - Sep 1 2000

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications

Cite this