Higher-order unCurrying

John Joseph Hannan, Patrick Hicks

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 which 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 which axiomatizes a judgment relating a source term with an unCurried form of the term. We prove that this system relates only typable terms and that it is correct with respect to an operational semantics. We define a practical algorithm, based on algorithm W, which implements the 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)1-10
Number of pages10
JournalConference Record of the Annual ACM Symposium on Principles of Programming Languages
StatePublished - 1998

Fingerprint

Specifications
Polymorphism
Semantics
Acoustic waves
Formal specification

All Science Journal Classification (ASJC) codes

  • Software

Cite this

@article{0f3c5782a0eb4de7b341dc9d2dbee5aa,
title = "Higher-order unCurrying",
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 which 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 which axiomatizes a judgment relating a source term with an unCurried form of the term. We prove that this system relates only typable terms and that it is correct with respect to an operational semantics. We define a practical algorithm, based on algorithm W, which implements the 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.",
author = "Hannan, {John Joseph} and Patrick Hicks",
year = "1998",
language = "English (US)",
pages = "1--10",
journal = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
issn = "0730-8566",
publisher = "Association for Computing Machinery (ACM)",

}

Higher-order unCurrying. / Hannan, John Joseph; Hicks, Patrick.

In: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, 1998, p. 1-10.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Higher-order unCurrying

AU - Hannan, John Joseph

AU - Hicks, Patrick

PY - 1998

Y1 - 1998

N2 - 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 which 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 which axiomatizes a judgment relating a source term with an unCurried form of the term. We prove that this system relates only typable terms and that it is correct with respect to an operational semantics. We define a practical algorithm, based on algorithm W, which implements the 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.

AB - 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 which 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 which axiomatizes a judgment relating a source term with an unCurried form of the term. We prove that this system relates only typable terms and that it is correct with respect to an operational semantics. We define a practical algorithm, based on algorithm W, which implements the 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.

UR - http://www.scopus.com/inward/record.url?scp=0031679328&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031679328&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031679328

SP - 1

EP - 10

JO - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

JF - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

SN - 0730-8566

ER -