A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Stackability in the simply-typed call-by-value lambda calculus

1998
*
Science of Computer Programming
*

Hence, we must identify a subset of

doi:10.1016/s0167-6423(96)00040-8
fatcat:n242efhixfbglks2sx2pd3dijq
*the**simply**typed*,*call*-*by*-*value*I-*calculus*, where*the*I-abstraction can serve as*the*block construct for a stack implementation. ...*The*reason: soundness of v-expansion and decunying for*call*-*by*-name. However, q-expansion is unsound for*call*-*by*-*value*. ... Thanks also to Mads Tofte, Mitch Wand, and other attendees of*the*first Atlantique workshop on ...##
###
Page 8758 of Mathematical Reviews Vol. , Issue 99m
[page]

1999
*
Mathematical Reviews
*

*call*-

*by*-

*value*

*lambda*

*calculus*. ... Hence, we must identify a subset of

*the*

*simply*

*typed*,

*call*-

*by*-

*value*/- 68 COMPUTER SCIENCE 8758

*calculus*

*in*which A-abstraction can serve as

*the*block construct for a stack implementation. ...

##
###
Author index of volume 31 (1998)

1998
*
Science of Computer Programming
*

Schmidt,

doi:10.1016/s0167-6423(98)00010-0
fatcat:ftydlqi24va5rkoxsunvpoqrga
*Stackability**in**the**simply*-*typed**call*-*by*-*value**lambda**calculus*Bergstra, J.A. and P. Klint,*The*discrete time TOOLBUS -A software coordination architecture Bit, L.F., see M. ... (1) 3p 45 (1) 47-73 (1) (2-3) 2055229 (2-3) 291-311 (223) 175-177 (2-3) 231-261 (1) (2-3) 291~31: (2-3) 263-289 ( (*The*issue number is given*in*front of*the*page numbers) Andreoli, J.-M., F. ...##
###
Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

1996
*
BRICS Report Series
*

*typed*

*lambda*-

*calculus*. ... </p><p><br />

*The*source language considered

*in*this case study is imperative, block-structured,<br />higher-order,

*call*-

*by*-

*value*, allows subtyping, and obeys<br />stack discipline. ... Many years ago, David Schmidt pointed out to

*the*first author

*the*relevance of constructive

*type*theory for inductively defined domains. ...

##
###
Semantics-based compiling: A case study in type-directed partial evaluation
[chapter]

1996
*
Lecture Notes in Computer Science
*

*in*

*the*manner of denotational semantics; •

*the*output of

*the*generated compiler is three-address code,

*in*

*the*fashion and efficiency of

*the*Dragon Book; •

*the*generated compiler processes several hundred ... Our solution is based on

*type*-directed partial evaluation, where • our compiler generator is expressed

*in*a few lines, and is efficient; • its input is a well-

*typed*, purely functional definitional interpreter ... Many years ago, David Schmidt pointed out to

*the*first author

*the*relevance of constructive

*type*theory for inductively defined domains. ...

##
###
Lambda-dropping

1997
*
Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '97
*

; • for

doi:10.1145/258993.259007
dblp:conf/pepm/DanvyS97
fatcat:e3etskmscvgxteod6wl2jk6ncy
*lambda*-dropping: parameters which are used*in**the*same scope as their definition do not need to be passed along*in*their path. ... Both*lambda*-lifting and*lambda*-dropping thus require one to compute Def/Use paths: • for*lambda*-lifting: each of*the*functions occurring*in**the*path of a free variable is passed this variable as a parameter ... Lawall for sensible and very timely comments, and to Niels Ole Jensen for implementing*lambda*-dropping*in*ML.*The*diagrams were drawn with Kristoffer Rose's X Y -pic package. ...##
###
Control-Flow Analysis of Functional Programs

2007
*
BRICS Report Series
*

*In*this paper we survey control-flow analysis of functional programs

*by*structuring

*the*multitude of formulations and approximations and comparing them. ... Analyses of

*the*control flow of functional programs have been formulated

*in*multiple settings and have led to many different approximations, starting with

*the*seminal works of Jones, Shivers, and Sestoft ... Part of this work was done with

*the*support of

*the*Carlsberg Foundation and an INRIA post-doc grant. ...

##
###
Control-flow analysis of functional programs

2012
*
ACM Computing Surveys
*

*In*this paper, we survey control-flow analysis of functional programs

*by*structuring

*the*multitude of formulations and approximations and comparing them. ... Analyses of

*the*control flow of functional programs have been formulated

*in*multiple settings and have led to many different approximations, starting with

*the*seminal works of Jones, Shivers, and Sestoft ... Part of this work was done with

*the*support of

*the*Carlsberg Foundation and an INRIA post-doc grant. ...

##
###
Page 497 of Mathematical Reviews Vol. , Issue 99a
[page]

1991
*
Mathematical Reviews
*

Schmidt,

*Stackability**in**the**simply*-*typed**call*-*by*-*value**lambda**calculus*(47-73); Nicolas Halbwachs, About synchronous programming and abstract interpretation (75-89); Laurent Mauborgne, Abstract interpretation ... Proceedings of*the*4th International Conference (LPNMR 97) held*in*Dagstuhl, July 28-31, 1997. Edited*by*Jiirgen Dix, Ulrich Furbach and Anil Nerode. Lecture Notes*in*Computer Science, 1265. ...##
###
A Rational Deconstruction of Landin's SECD Machine
[chapter]

2005
*
Lecture Notes in Computer Science
*

Landin's SECD machine was

doi:10.1007/11431664_4
fatcat:5pm6mgbdsbdunlypm4aneygeoa
*the*first abstract machine for*the*λ*calculus*viewed as a programming language. ... function*in**the*form of an abstract machine. ... Acknowledgments*The*rational deconstruction presented here arose because of a discussion with Mayer Goldberg*in*July 2002, at*the*occasion of our joint work on compilation and decompilation [3] . ...##
###
Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

1997
*
BRICS Report Series
*

use occurs

doi:10.7146/brics.v4i6.18785
fatcat:uqo55kxr2bd2rjwc7kwlw6myhe
*in**the*same scope as their<br />definition do not need to be passed along*in**the**call*path). ... (these free variables are then added as parameters to<br />each of*the*functions*in**the**call*path);</p><p>- for*lambda*-dropping: to establish*the*Def/Use path of each parameter<br />(parameters whose ... Lawall for sensible and very timely comments, and to Niels Ole Jensen for implementing*lambda*-dropping*in*ML.*The*diagrams were drawn with Kristoffer Rose's X Y -pic package. ...##
###
Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

1999
*
BRICS Report Series
*

as a parameter;</p><p>- for

doi:10.7146/brics.v6i27.20096
fatcat:bwkchvaribhz3daclqzqkdslhi
*lambda*-dropping: parameters which are used*in**the*same scope<br />as their definition do not need to be passed along*in*their path. ... Both*lambda*-lifting and*lambda*-dropping thus require one to compute Def/Use paths:</p><p><br />- for*lambda*-lifting: each of*the*functions occurring*in**the*path of a<br />free variable is passed this variable ... Lawall for sensible and very timely comments, and to Niels Ole Jensen for implementing*lambda*-dropping*in*ML.*The*diagrams were drawn with Kristoffer Rose's X Y -pic package. ...##
###
Lambda-dropping: transforming recursive equations into programs with block structure

2000
*
Theoretical Computer Science
*

; • for

doi:10.1016/s0304-3975(00)00054-2
fatcat:z5aebuca7jh27ky577qeaghkzy
*lambda*-dropping: parameters which are used*in**the*same scope as their definition do not need to be passed along*in*their path. ... Both*lambda*-lifting and*lambda*-dropping thus require one to compute Def/Use paths: • for*lambda*-lifting: each of*the*functions occurring*in**the*path of a free variable is passed this variable as a parameter ... Lawall for sensible and very timely comments, and to Niels Ole Jensen for implementing*lambda*-dropping*in*ML.*The*diagrams were drawn with Kristoffer Rose's X Y -pic package. ...##
###
Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

1998
*
BRICS Report Series
*

Both

doi:10.7146/brics.v5i54.21959
fatcat:3u3uix3y2ncprju2ilisrsxdl4
*lambda*-lifting and*lambda*-dropping thus require one to compute Def/Use paths:<ul><li>for*lambda*-lifting: each of*the*functions occurring*in**the*path of a free variable is passed this variable as a ... parameter;</li><li>for*lambda*-dropping: parameters which are used*in**the*same scope as their definition do not need to be passed along*in*their path. ... Lawall for sensible and very timely comments, and to Niels Ole Jensen for implementing*lambda*-dropping*in*ML.*The*diagrams were drawn with Kristoffer Rose's X Y -pic package. ...##
###
Lambda-dropping

1997
*
SIGPLAN notices
*

; • for

doi:10.1145/258994.259007
fatcat:wyuul4rvmfdqjc7pyogja7yaem
*lambda*-dropping: parameters which are used*in**the*same scope as their definition do not need to be passed along*in*their path. ... Both*lambda*-lifting and*lambda*-dropping thus require one to compute Def/Use paths: • for*lambda*-lifting: each of*the*functions occurring*in**the*path of a free variable is passed this variable as a parameter ... Lawall for sensible and very timely comments, and to Niels Ole Jensen for implementing*lambda*-dropping*in*ML.*The*diagrams were drawn with Kristoffer Rose's X Y -pic package. ...
« Previous

*Showing results 1 — 15 out of 35 results*