4 research outputs found

    Compilation of extended recursion in call-by-value functional languages

    Get PDF
    This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place update of memory blocks, and prove the translation to be correct.Comment: 62 pages, uses pi

    Recursive monadic bindings

    No full text

    Perceiving ‘capability’ within dynamic capabilities: the role of owner-manager self-efficacy

    Get PDF
    This article combines two popular, yet separate concepts, dynamic capabilities and self-efficacy. Both are concerned with ability / capability and offer potentially valuable synergies. As such, our in-depth qualitative study based in three micro-enterprises in the United Kingdom (UK), investigated, ‘what role(s) may owner-manager perceived self-efficacy play as a micro-foundation of dynamic capabilities in micro-enterprises?’ Our findings show that perceived self-efficacy can influence dynamic capability enactment in multifaceted ways and even suggest that in some cases, perceived self-efficacy is a crucial component of dynamic capabilities, without which there may be no such capability. These insights help open up the black box of dynamic capabilities by contributing important knowledge to the growing body of research into the micro-foundations of such capabilities. Furthermore, our study illuminates the importance of idiosyncratic micro-foundations of dynamic capabilities in micro-enterprises and expands extant knowledge of the potential effects of self-efficacy in the small business and entrepreneurship domain

    Mixin Modules and Computational Effects

    No full text
    We define a calculus for investigating the interactions between mixin modules and computational effects, by combining the purely functional mixin calculus CMS with a monadic metalanguage supporting the two separate notions of simplification (local rewrite rules) and computation (global evaluation able to modify the store). This distinction is important for smoothly integrating the CMS rules (which are all local) with the rules dealing with the imperative features. In our calculus mixins..
    corecore