A Higher-Order Colon Translation

Olivier Danvy, Lasse Reichstein Nielsen

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

    Abstract

    A lambda-encoding such as the CPS transformation gives rise to administrative redexes. In his seminal article ``Call-by-name, call-by-value and the lambda-calculus'', 25 years ago, Plotkin tackled administrative reductions using a so-called ``colon translation.'' 10 years ago, Danvy and Filinski integrated administrative reductions in the CPS transformation, making it operate in one pass. The technique applies to other lambda-encodings (e.g., variants of CPS), but we do not see it used in practice--instead, Plotkin's colon translation appears to be favored. Therefore, in an attempt to link both techniques, we recast Plotkin's proof of Indifference and Simulation to the higher-order specification of the one-pass CPS transformation. To this end, we extend his colon translation from first order to higher order
    OriginalsprogEngelsk
    TitelFunctional and Logic Programming : 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings
    RedaktørerHerbert Kuchen, Kazunori Ueda
    Antal sider14
    ForlagSpringer
    Publikationsdato2001
    Sider78-91
    DOI
    StatusUdgivet - 2001
    Begivenhed5th International Symposium on Functional and Logic Programming (FLOPS 2001) - Tokyo, Japan
    Varighed: 7 mar. 20019 mar. 2001
    Konferencens nummer: 5

    Konference

    Konference5th International Symposium on Functional and Logic Programming (FLOPS 2001)
    Nummer5
    Land/OmrådeJapan
    ByTokyo
    Periode07/03/200109/03/2001
    NavnLecture Notes in Computer Science
    Vol/bind2024

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'A Higher-Order Colon Translation'. Sammen danner de et unikt fingeraftryk.

    Citationsformater