NDLI: Improving binding times without explicit CPS-conversion

Please wait, while we are loading the content...

Volume VIII

Volume VII

Volume VI

Volume V

Volume V, Issue 4, Oct. 1992

Volume V, Issue 3, July-Sept. 1992

Volume V, Issue 2, April-June 1992

Volume V, Issue 1, Jan. 1992

Improving binding times without explicit CPS-conversion

Safe fusion of functional expressions

Compiling lazy pattern matching

Caching considerations for generational garbage collection

Improving the performance of SML garbage collection using application-specific virtual memory management

Polymorphic type reconstruction for garbage collection without tags

Projective ML

Parsers in ML

Interactive modular programming in Scheme

Finiteness conditions for fixed point iteration

A syntactic approach to fixed point computation on finite domains

Abstract interpretation in weak powerdomains

A precise relationship between the deductive power of forward and backward strictness analysis

Proving memory management invariants for a language based on linear logic

Proving the correctness of storage representations

On extending computational adequacy by data abstraction

Parametric type classes

A calculus for overloaded functions with subtyping

Type inference in the presence of overloading, subtyping and recursive types

Global tagging optimization by type inference

Analysis of recursive types in Lisp-like languages

Taming the Y operator

The Python compiler for CMU Common Lisp

Integrating the Scheme and C languages

WCL

Tachyon Common Lisp

A confluent calculus of Macro expansion and evaluation

Reasoning about programs in continuation-passing style.

Back to direct style II

Dynamic program parallelization

Global analysis for partitioning non-strict programs into sequential threads

Fast parallel implementation of lazy languages—the EQUALS experience

A foundation for an efficient multi-threaded scheme system

Improving binding times without explicit CPS-conversion

Content Provider	ACM Digital Library
Author	Bondorf, Anders
Abstract	A major obstacle in partial evaluation (program specialization) is the need for binding time improvements. By reorganizing a source program, the residual programs obtained by specializing the source program may be improved: more computations can be done statically, that is, at specialization time.One well-known effective reorganization is (manual or automatic) conversion into continuation passing style (cps). This conversion allows data consumers to be propagated through frozen expressions to the data producers. In this paper we show how such improvements can be obtained without affecting the source program: by writing the program specializer itself in cps; traditionally, specialization has been formulated in direct style.The advantages of avoiding cps-converting source programs are: (1) no cps-conversion phase is needed; (2) the generated residual programs are not in cps; (3) since no source level continuations are added, there is no overhead of manipulating closure representations in the generating extensions (e.g. compilers) obtained by self-application; (4) manual “binding time debugging” is easier since binding time analysis is done on a non-converted program.We have implemented a cps-based program specializer; it is integrated in the partial evaluator Similix 4.0. Using a cps-specializer, partially static data structures can be handled safely in a straightforward way. The difficulty is to ensure automatically that residual expressions that become part of a partially static data structure are neither duplicated nor discarded. This is achieved by binding such residual expressions in automatically inserted frozen let-expressions; cps is needed to propagate operations on the partially static data structure through these frozen let-expressions. Based on this idea, we have implemented an extension of Similix 4.0 that handles partially static data structures.
Starting Page	1
Ending Page	10
Page Count	10
File Format	PDF
ISSN	10453563
DOI	10.1145/141478.141483
Journal	ACM SIGPLAN Lisp Pointers (LIPO)
Volume Number	V
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improving binding times without explicit CPS-conversion

Explicit polymorphism and CPS conversion (1993)

Explicit polymorphism and cps conversion (1993).

Explicit polymorphism and CPS conversion

Behavioral synergy without explicit integration

Syntactic accidents in program analysis:on the impact of the CPS transformation

Mobile Robot Self-Localization without Explicit Landmarks

Possibilities Without Possible Worlds/Histories

Improving round-trip time estimates in reliable transport protocols

Improving binding times without explicit CPS-conversion

Similar Documents

Improving binding times without explicit CPS-conversion

Explicit polymorphism and CPS conversion (1993)

Explicit polymorphism and cps conversion (1993).

Explicit polymorphism and CPS conversion

Behavioral synergy without explicit integration

Syntactic accidents in program analysis:on the impact of the CPS transformation

Mobile Robot Self-Localization without Explicit Landmarks

Possibilities Without Possible Worlds/Histories

Improving round-trip time estimates in reliable transport protocols

Improving binding times without explicit CPS-conversion