DOCSLIB.ORG

The Interpretation and Inter-Derivation of Small-Step and Big-Step Specifications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Interpretation and Inter-Derivation of Small-Step and Big-Step Specifications The Interpretation and Inter-derivation of Small-step and Big-step Specifications Ian Zerny PhD Dissertation Department of Computer Science Aarhus University Denmark The Interpretation and Inter-derivation of Small-step and Big-step Specifications A Dissertation Presented to the Faculty of Science and Technology of Aarhus University in Partial Fulfillment of the Requirements for the PhD Degree by Ian Zerny June 21, 2013 Abstract We study the interpretation and inter-derivation of big-step and small-step specifications. In particular, we consider formal specifications of program- ming languages, e.g., denotational semantics and operational semantics, and investigate how these specifications relate to each other. We carry out this investigation by interpreting specifications as programs in a pure functional meta-language and by constructively deriving one program from the other us- ing program transformations. To this end, we use two derivational correspon- dences: The functional correspondence between compositional higher-order specifications and first-order transition systems, and the syntactic correspon- dence between rewriting specifications and first-order transition systems. The main contribution of this dissertation is threefold: First, we extend these correspondences to systematically derive small-step reduction semantics and abstract machines from big-step reduction strategies. Second, we show how these correspondences can be used to relate specifications for lazy evalua- tion, e.g., graph reduction and call-by-need evaluation. Third, we describe an alternative interpretation of specifications as logic programs in a logical framework, and we give a logical counterpart to the functional correspon- dence. i Resumé Vi studerer fortolkningen og udledelsen af big-step og small-step specifika- tioner. Især betragter vi formelle specifikationer af programmeringssprog, så- som denotationel semantik og operationel semantik, og vi undersøger, hvor- dan disse specifikationer relaterer til hinanden. Denne relation undersøger vi ved at fortolke specifikationer som programmer i et effektfri funktionel metasprog og bruger programtransformationer til konstruktivt at udlede et program fra et andet. Til dette benytter vi to udledningskorrespondancer: Den funktionelle korrespondance mellem kompositionelle højereordensspeci- fikationer og transitionssystemer, samt den syntaktiske korrespondance mellem omskrivningsspecifikationer og transitionssystemer. Hovedbidraget i denne afhandling er tredelt: Først udvider vi disse korrespon- dancer med en systematisk udledning af en small-step reduktionssemantik og en abstrakt maskine fra en big-step reduktionsstrategi. Dernæst viser vi, hvordan disse korrespondancer kan relatere specifikationer for lazy evaluer- ing, såsom grafreduktion og call-by-need evaluering. Slutteligt beskriver vi en alternativ fortolkning af specifikationer som logikprogrammer i et logisk system, og vi giver en logisk pendant til den funktionelle korrespondance. iii Acknowledgments As many before me, I would like to thank my supervisor Olivier Danvy, whose supervision goes well beyond the call of duty. As a teacher, Olivier exposed to me the structure, notation, and interpretation of programs. As a mentor, Olivier guided me through the academic world of writing, publishing, and teaching. As a colleague, Olivier introduced me to the wonders of research, discovery, and development. As a friend, Olivier kindled my interests in tech culture, science fiction, and many other fine details of life. I would like to thank Jan Midtgaard. As a teaching assistant, Jan, who was then a PhD student, made a lasting impression on me that ultimately led to my own pursuit of a PhD degree. I have since been fortunate to receive Jan’s support as colleague, as coauthor, as friend, and as, de facto, second advisor. I am also grateful to Zena Ariola and Glynn Winskel for reviewing this PhD dissertation and serving in its PhD committee. I would also like to thank Kevin Millikin for his advice and encouragements as a Google Fellowship Mentor and for hosting a fruitful internship at Google in the early fall of 2012. I would like to thank Frank Pfenning for an inspiring stay at Carnegie Mellon University during the winter from 2011 to 2012. CMU is a truly remarkable institution which is made so by many: Thanks to Frank Pfenning for his course on logic, to Karl Crary for his course on LF, to Robert Harper for his courses on functional programming and type theory, and to Stephen Brookes for his course on semantics. Thanks to the POP students, to the tea trolls, and for the weekly D’z. I would like to thank Kenichi Asai and his PhD students for a wonderful visit in the programming-language lab of Ochanomizu University in December 2010. Thanks to Moe Masuko, Kanae Tsushima, and Yayoi Ueda for their great hos- pitality and academic engagement. I was fortunate enough to attend Henk Barendregt and Jan Willem Klop’s mini-course on Lambda Calculus and Term Rewriting Systems in 2009, the Midlands Graduate School in 2009, the Central European School on Func- tional Programming in 2009, the Estonian Winter School in Computer Sci- v ence in 2010, and the Oregon Summer School in 2009 and in 2011. These events have shaped my PhD studies, and I want to extend grateful thanks to their organizers. Thanks to my coauthors, Olivier Danvy, Jacob Johannsen, Jan Midtgaard, Kevin Millikin, Johan Munk, Ken Shan, Robert Simmons, Peter Thiemann, and Johnni Winther. This dissertation is but a single fruit of our collabora- tion. Thanks to Kent Grigo, Mathias Schwarz, and Jakob Thomsen for their feedback on this dissertation. Thanks to the other members of the programming-languages group at Aarhus University and to Christian Christoffersen, Dennis Decker Jensen, Finn Jensen, Peter Kristensen, Carsten Nørby, Matthias Puech, Thomas Salomon, Filip Siecz- kowski, and Sarah Zakarias for our discussions and also their support. Thanks to the kind and effective support of the administrative staff at Aarhus Univer- sity and in particular to Michael Glad, Ellen Kjemtrup, and Ann Eg Mølhave. My PhD studies have successively been funded by the Faculty of Science at Aarhus University and by the Google Fellowship program. I was also awarded an EliteForsk travel grant from the Ministry of Science, Innovation and Higher Education. For this support I express my sincere thanks. Finally, I am forever grateful to Anne for her unreserved love, for her unwa- vering support, and for Erik, our son. Ian Zerny, Aarhus, June 21, 2013. vi Contents Abstract i Resumé iii Acknowledgments v Contents vii I Background and overview 1 1 Introduction 3 2 The semantics of programming languages 7 2.1 Syntax .......................................... 8 2.2 Denotational semantics ................................ 9 2.3 Operational semantics ................................ 19 2.4 Representations and implementations ....................... 31 3 A functional correspondence: from definitional interpreter to abstract machine 39 3.1 The CPS transformation: from direct-style to continuation-style . 39 3.2 Defunctionalization: from higher order to first order . 44 3.3 Summary and conclusion ............................... 45 3.4 The functional correspondence in perspective . 45 4 A syntactic correspondence: from reduction semantics to abstract machine 51 4.1 A prequel to reduction semantics: from search to decompose . 51 4.2 Refocusing: from reduction-based to reduction-free evaluation . 56 4.3 Lightweight fusion: from small-step to big-step abstract machine . 58 4.4 Hereditary transition compression ......................... 59 4.5 Summary and conclusion ............................... 61 4.6 The syntactic correspondence in perspective . 61 vii Contents II Publications 65 5 A prequel to reduction semantics 67 5.1 Introduction ....................................... 67 5.2 Arithmetic expressions ................................ 69 5.3 Call-by-value λ-calculus ................................ 77 5.4 Call-by-value λ-calculus with exceptions and context-sensitive contraction rules . 80 5.5 Call-by-value λ-calculus with exceptions and context-insensitive contraction rules . 82 5.6 Case study: JavaScript ................................. 87 5.7 Related work ...................................... 92 5.8 Conclusion and perspectives ............................. 92 6 Normalization functions for Boolean propositional formulas 93 6.1 Introduction ....................................... 93 6.2 Domain of discourse .................................. 94 6.3 Leftmost outermost negational normalization . 97 6.4 Leftmost outermost conjunctive normalization . 113 6.5 Conclusion and perspectives .............................122 7 Storeless call-by-need evaluation 125 7.1 Introduction .......................................125 7.2 The standard call-by-name reduction for the λ-calculus . 127 7.3 The standard call-by-need reduction for the λ-calculus . 128 7.4 Some exegesis .....................................131 7.5 From reduction semantics to abstract machine . 139 7.6 Small-step AMs define relations, big-step AMs define functions . 143 7.7 From abstract machine to evaluation functions . 144 7.8 Deterministic abstract machines define functions . 148 7.9 Conclusion ........................................149 7.A On refunctionalizing and going back to direct style . 149 7.B On the control pattern underlying call by need . 152 8 A synthetic operational account of call-by-need evaluation 157 8.1 Introduction .......................................158 8.2 Call by need vs.
Load more

Recommended publications
  • Bisimulations for Delimited-Control Operators
    Logical Methods in Computer Science Volume 15, Issue 2, 2019, pp. 18:1–18:57 Submitted Apr. 24, 2018 https://lmcs.episciences.org/ Published May 24, 2019 BISIMULATIONS FOR DELIMITED-CONTROL OPERATORS DARIUSZ BIERNACKI a, SERGUE¨I LENGLET b, AND PIOTR POLESIUK a a University of Wroclaw e-mail address: fdabi,[email protected] b Universit´ede Lorraine e-mail address: [email protected] Abstract. We present a comprehensive study of the behavioral theory of an untyped λ-calculus extended with the delimited-control operators shift and reset. To that end, we define a contextual equivalence for this calculus, that we then aim to characterize with coinductively defined relations, called bisimilarities. We consider different styles of bisimilarities (namely applicative, normal-form, and environmental) within a unifying framework, and we give several examples to illustrate their respective strengths and weaknesses. We also discuss how to extend this work to other delimited-control operators. 1. Introduction Delimited-control operators. Control operators for delimited continuations enrich a pro- gramming language with the ability to delimit the current continuation, to capture such a delimited continuation, and to compose delimited continuations. Such operators have been originally proposed independently by Felleisen [26] and by Danvy and Filinski [21], with nu- merous variants designed subsequently [34, 66, 32, 25]. The applications of delimited-control operators range from non-deterministic programming [21, 45], partial evaluation [58, 19], and normalization by evaluation [24] to concurrency [34], mobile code [89], linguistics [84], oper- ating systems [43], and probabilistic programming [44]. Several variants of delimited-control operators are nowadays available in mainstream functional languages such as Haskell [25], OCaml [42], Racket [29], and Scala [76].
    [Show full text]
  • An Operational Foundation for Delimited Continuations in the Cps Hierarchy
    Logical Methods in Computer Science Vol. 1 (2:5) 2005, pp. 1–39 Submitted Apr. 1, 2005 www.lmcs-online.org Published Nov. 8, 2005 AN OPERATIONAL FOUNDATION FOR DELIMITED CONTINUATIONS IN THE CPS HIERARCHY MALGORZATA BIERNACKA, DARIUSZ BIERNACKI, AND OLIVIER DANVY BRICS, Department of Computer Science, University of Aarhus IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark e-mail address: {mbiernac,dabi,danvy}@brics.dk Abstract. We present an abstract machine and a reduction semantics for the lambda- calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation- passing style (CPS); the reduction semantics (i.e., a small-step operational semantics with an explicit representation of evaluation contexts) is constructed from the abstract machine; and the control operators are the shift and reset family. We also present new applications of delimited continuations in the CPS hierarchy: finding list prefixes and normalization by evaluation for a hierarchical language of units and products. 1. Introduction The studies of delimited continuations can be classified in two groups: those that use continuation-passing style (CPS) and those that rely on operational intuitions about con- trol instead. Of the latter, there is a large number proposing a variety of control opera- tors [5,37,40,41,49,52,53,65,70,74,80] which have found applications in models of control, concurrency, and type-directed partial evaluation [8,52,75]. Of the former, there is the work revolving around the family of control operators shift and reset [27–29,32,42,43,55,56,66,80] which have found applications in non-deterministic programming, code generation, par- tial evaluation, normalization by evaluation, computational monads, and mobile comput- ing [6,7,9,17,22,23,33,34,44,46,48,51,57,59,61,72,77–79].
    [Show full text]
  • Continuation Passing Style for Effect Handlers
    Continuation Passing Style for Effect Handlers Daniel Hillerström1, Sam Lindley2, Robert Atkey3, and KC Sivaramakrishnan4 1 The University of Edinburgh, United Kingdom [email protected] 2 The University of Edinburgh, United Kingdom [email protected] 3 University of Strathclyde, United Kingdom [email protected] 4 University of Cambridge, United Kingdom [email protected] Abstract We present Continuation Passing Style (CPS) translations for Plotkin and Pretnar’s effect han- dlers with Hillerström and Lindley’s row-typed fine-grain call-by-value calculus of effect handlers as the source language. CPS translations of handlers are interesting theoretically, to explain the semantics of handlers, and also offer a practical implementation technique that does not require special support in the target language’s runtime. We begin with a first-order CPS translation into untyped lambda calculus which manages a stack of continuations and handlers as a curried sequence of arguments. We then refine the initial CPS translation first by uncurrying it to yield a properly tail-recursive translation and second by making it higher-order in order to contract administrative redexes at translation time. We prove that the higher-order CPS translation simulates effect handler reduction. We have implemented the higher-order CPS translation as a JavaScript backend for the Links programming language. 1998 ACM Subject Classification D.3.3 Language Constructs and Features, F.3.2 Semantics of Programming Languages Keywords and phrases effect handlers, delimited control, continuation passing style Digital Object Identifier 10.4230/LIPIcs.FSCD.2017.18 1 Introduction Algebraic effects, introduced by Plotkin and Power [25], and their handlers, introduced by Plotkin and Pretnar [26], provide a modular foundation for effectful programming.
    [Show full text]
  • Delimited Continuations in Operating Systems
    Delimited continuations in operating systems Oleg Kiselyov1 and Chung-chieh Shan2 1 FNMOC [email protected] 2 Rutgers University [email protected] Abstract. Delimited continuations are the meanings of delimited evalu- ation contexts in programming languages. We show they offer a uniform view of many scenarios that arise in systems programming, such as a re- quest for a system service, an event handler for input/output, a snapshot of a process, a file system being read and updated, and a Web page. Ex- plicitly recognizing these uses of delimited continuations helps us design a system of concurrent, isolated transactions where desirable features such as snapshots, undo, copy-on-write, reconciliation, and interposition fall out by default. It also lets us take advantage of efficient implemen- tation techniques from programming-language research. The Zipper File System prototypes these ideas. 1 Introduction One notion of context that pervades programming-language research is that of evaluation contexts. If one part of a program is currently running (that is, being evaluated), then the rest of the program is expecting the result from that part, typically waiting for it. This rest of the program is the evaluation context of the running part. For example, in the program “1 + 2 × 3”, the evaluation context of the multiplication “2 × 3” is the rest of the program “1 + ”. The meaning of an evaluation context is a function that maps a result value to an answer. For example, the meaning of the evaluation context “1 + ” is the increment function, so it maps the result value 6 to the answer 7.
    [Show full text]
  • Delimited Control with Multiple Prompts in Theory and Practice
    Delimited control with multiple prompts in theory and practice Paul Downen Zena M. Ariola University of Oregon fpdownen,[email protected] 1. Proposal hE[S V ]i 7! hV (λx.hE[x]i)i The versatile and expressive capabilities of delimited control and composable continuations have gained it attention in both the the- #(E[F V ]) 7! #(V (λx.E[x])) ory and practice of functional programming with effects. On the hE[S0 V ]i0 7! V (λx.hE[x]i0) more theoretical side, delimited control may be used as a basis for # (E[F V ]) 7! V (λx.E[x]) explaining and understanding a wide variety of other computational 0 0 effects, like mutable state and exceptions, based on Filinski’s [8, 9] observation that composable continuations can be used to repre- Figure 1. Four different pairs of delimiters and control operators. sent any monadic effect. On the more practical side, forms of de- limited control have been implemented in real-world programming languages [6, 10, 15], and used in the design of libraries like for represents a closed off sub-computation, where the F operator is creating web servers [10]. only capable of capturing the evaluation context 2 × ≤ 10. That However, the design space for adding composable continua- way, the delimiter protects the surrounding context from the control tions to a programming language is vast, and a number of dif- operator, so that even in the larger program ferent definitions of delimited control operators have been pro- if #(2 × (F (λk:M)) ≤ 10) then red else blue posed [3, 4, 7, 12, 21].
    [Show full text]
  • Backpropagation with Continuation Callbacks: Foundations for Efficient
    Backpropagation with Continuation Callbacks: Foundations for Efficient and Expressive Differentiable Programming Fei Wang James Decker Purdue University Purdue University West Lafayette, IN 47906 West Lafayette, IN 47906 [email protected] [email protected] Xilun Wu Grégory Essertel Tiark Rompf Purdue University Purdue University Purdue University West Lafayette, IN 47906 West Lafayette, IN, 47906 West Lafayette, IN, 47906 [email protected] [email protected] [email protected] Abstract Training of deep learning models depends on gradient descent and end-to-end differentiation. Under the slogan of differentiable programming, there is an increas- ing demand for efficient automatic gradient computation for emerging network architectures that incorporate dynamic control flow, especially in NLP. In this paper we propose an implementation of backpropagation using functions with callbacks, where the forward pass is executed as a sequence of function calls, and the backward pass as a corresponding sequence of function returns. A key realization is that this technique of chaining callbacks is well known in the programming languages community as continuation-passing style (CPS). Any program can be converted to this form using standard techniques, and hence, any program can be mechanically converted to compute gradients. Our approach achieves the same flexibility as other reverse-mode automatic differ- entiation (AD) techniques, but it can be implemented without any auxiliary data structures besides the function call stack, and it can easily be combined with graph construction and native code generation techniques through forms of multi-stage programming, leading to a highly efficient implementation that combines the per- formance benefits of define-then-run software frameworks such as TensorFlow with the expressiveness of define-by-run frameworks such as PyTorch.
    [Show full text]
  • A Rational Deconstruction of Landin's J Operator
    BRICS RS-06-4 Danvy & Millikin: A Rational Deconstruction of Landin’s J Operator BRICS Basic Research in Computer Science A Rational Deconstruction of Landin’s J Operator Olivier Danvy Kevin Millikin BRICS Report Series RS-06-4 ISSN 0909-0878 February 2006 Copyright c 2006, Olivier Danvy & Kevin Millikin. BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus IT-parken, Aabogade 34 DK–8200 Aarhus N Denmark Telephone: +45 8942 9300 Telefax: +45 8942 5601 Internet: [email protected] BRICS publications are in general accessible through the World Wide Web and anonymous FTP through these URLs: http://www.brics.dk ftp://ftp.brics.dk This document in subdirectory RS/06/4/ A Rational Deconstruction of Landin’s J Operator∗ Olivier Danvy and Kevin Millikin BRICS† Department of Computer Science University of Aarhus‡ February 28, 2006 Abstract Landin’s J operator was the first control operator for functional languages, and was specified with an extension of the SECD machine. Through a se- ries of meaning-preserving transformations (transformation into continu- ation-passing style (CPS) and defunctionalization) and their left inverses (transformation into direct style and refunctionalization), we present a compositional evaluation function corresponding to this extension of the SECD machine. We then characterize the J operator in terms of CPS and in terms of delimited-control operators in the CPS hierarchy.
    [Show full text]
  • Continuations in Natural Language
    Continuations in Natural Language [Extended Abstract] Chris Barker University of California, San Diego 9500 Gillman Drive La Jolla, CA, USA [email protected] ABSTRACT As diverse as these applications are, they all involve the Computer scientists, logicians and functional programmers design and analysis of artificial languages (i.e., programming have studied continuations in laboratory settings for years. languages and logical languages), as opposed to natural lan- As a result of that work, continuations are now accepted guages (the sort of languages that humans characteristically as an indispensable tool for reasoning about control, order use when communicating with each other). We might won- of evaluation, classical versus intuitionistic proof, and more. der, then, whether continuations are relevant for the study But all of the applications just mentioned concern artifi- of natural languages. This is the master question addressed cial languages; what about natural languages, the languages by this paper: spoken by humans in their daily life? Do natural languages • [Relevance] Are there phenomena in natural language get by without any of the marvelous control operators pro- that can profitably be analyzed using continuations? vided by continuations, or can we find continuations in the wild? This paper argues yes: that an adequate and com- Obviously, I believe that the answer is \yes"! I will try plete analysis of natural language must recognize and rely to persuade you to believe likewise by presenting four case on continuations. In support of this claim, I identify four studies, each of which has an analysis in terms of continua- independent linguistic phenomena for which a simple CPS- tions.
    [Show full text]
  • On the Dynamic Extent of Delimited Continuations
    BRICS RS-05-2 Biernacki & Danvy: On the Dynamic Extent of Delimited Continuations BRICS Basic Research in Computer Science On the Dynamic Extent of Delimited Continuations Dariusz Biernacki Olivier Danvy BRICS Report Series RS-05-2 ISSN 0909-0878 January 2005 Copyright c 2005, Dariusz Biernacki & Olivier Danvy. BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus Ny Munkegade, building 540 DK–8000 Aarhus C Denmark Telephone: +45 8942 3360 Telefax: +45 8942 3255 Internet: [email protected] BRICS publications are in general accessible through the World Wide Web and anonymous FTP through these URLs: http://www.brics.dk ftp://ftp.brics.dk This document in subdirectory RS/05/2/ On the Dynamic Extent of Delimited Continuations Dariusz Biernacki and Olivier Danvy BRICS∗ Department of Computer Science University of Aarhus† January 2005 Abstract We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias ) and the dynamic delimited-control S operator control (alias ). For the last 15 years, this difference has been repeatedly mentioned inF the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum. We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of ‘control queue.’ Keywords Delimited continuations, direct style, continuation-passing style (CPS), CPS transformation, defunctionalization, control operators, shift and reset, control and prompt.
    [Show full text]
  • A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
    BRICS RS-06-15 Biernacki et al.: A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations BRICS Basic Research in Computer Science A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations Dariusz Biernacki Olivier Danvy Kevin Millikin BRICS Report Series RS-06-15 ISSN 0909-0878 October 2006 Copyright c 2006, Dariusz Biernacki & Olivier Danvy & Kevin Millikin. BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus IT-parken, Aabogade 34 DK–8200 Aarhus N Denmark Telephone: +45 8942 9300 Telefax: +45 8942 5601 Internet: [email protected] BRICS publications are in general accessible through the World Wide Web and anonymous FTP through these URLs: http://www.brics.dk ftp://ftp.brics.dk This document in subdirectory RS/06/15/ A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations∗ Dariusz Biernacki,† Olivier Danvy, and Kevin Millikin BRICS‡ Department of Computer Science University of Aarhus§ October 2006 Abstract We put a pre-existing definitional abstract machine for dynamic delimited con- tinuations in defunctionalized form, and we present the consequences of this ad- justment. We first prove the correctness of the adjusted abstract machine. Because it is in defunctionalized form, we can refunctionalize it into a higher-order evalua- tion function. This evaluation function, which is compositional, is in contin- uation+state passing style and threads a trail of delimited continuations and a meta-continuation.
    [Show full text]
  • A Static Simulation of Dynamic Delimited Control
    Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) A static simulation of dynamic delimited control Chung-chieh Shan the date of receipt and acceptance should be inserted later Abstract We present a continuation-passing-style (CPS) transformation for some dynamic delimited-control operators, including Felleisen’s control and prompt, that extends a stan- dard call-by-value CPS transformation. Based on this new transformation, we show how Danvy and Filinski’s static delimited-control operators shift and reset simulate dynamic operators, allaying in passing some skepticism in the literature about the existence of such a simulation. The new CPS transformation and simulation use recursive delimited con- tinuations to avoid undelimited control and the overhead it incurs in implementation and reasoning. Keywords delimited control operators; macro expressibility; continuation-passing style (CPS); shift and reset; control and prompt 1 Introduction Delimited continuations are widely useful: to name a few applications, in backtracking search [11, 23, 59, 76], direct-style representations of monads [37–39], the continuation- passing-style (CPS) transformation itself [22–24], partial evaluation [6, 7, 9, 19, 29, 40, 46, 63, 82], Web interactions [45, 70], mobile code [66, 74, 80], and linguistics [8, 75]. However, the proliferation of delimited-control operators [22–24, 31, 32, 35, 36, 47–49, 71, 76, 77] remains a source of confusion for users and work for implementers. We want to translate control operators to each other so that they may share implementations, programming ex- amples, reasoning principles, and program transformations. In particular, we want to take advantage of CPS as we use, build, and reason about all delimited-control operators, not just shift and reset [22–24].
    [Show full text]
  • Subtyping Delimited Continuations
    Subtyping Delimited Continuations Marek Materzok Dariusz Biernacki Institute of Computer Science Institute of Computer Science University of Wrocław University of Wrocław Wrocław, Poland Wrocław, Poland [email protected] [email protected] Abstract tant role among the most fundamental concepts in the landscape We present a type system with subtyping for first-class delimited of functional programming—a language equipped with shift and continuations that generalizes Danvy and Filinski’s type system for reset is monadically complete, i.e., any computational monad can shift and reset by maintaining explicit information about the types be represented in direct style with the aid of these control op- of contexts in the metacontext. We exploit this generalization by erators [18, 19]. A long list of non-trivial applications of delim- ited continuations includes normalization by evaluation and partial considering the control operators known as shift0 and reset0 that can access arbitrary contexts in the metacontext. We use subtyping evaluation [3, 12, 15], mobile computing [33], linguistics [4], and to control the level of information about the metacontext the ex- operating systems [25] to name but a few. pression actually requires and in particular to coerce pure expres- The intuitive semantics of delimited-control operators such as sions into effectful ones. For this type system we prove strong type shift (S) and reset (hi) can be explained as follows. When the ex- soundness and termination of evaluation and we present a provably pression Sk:e is evaluated, the current—delimited by the nearest correct type reconstruction algorithm. We also introduce two CPS dynamically-enclosing reset—continuation is captured, i.e., it is re- moved and the variable k is bound to it.
    [Show full text]