Continuation-Based Program Transformation Strategies

DOI10.1145/322169.322183MaRDI QIDQ3867165zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mitchell Wand

Publication date 1980

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322169.322183

zbMATH Keywords

continuationsgeneralizationoptimizationprogram manipulationprogram transformation strategiesrecursionsubgoal induction

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(16)

• On the dynamic extent of delimited continuations
• A syntactic theory of sequential control
• Existential continuation
• Final algebra semantics and data type extensions
• On the expansion of non-linear functions
• Functional un\(|\)unparsing
• Constraint-based correctness proofs for logic program transformations
• Conversion to tail recursion in term rewriting
• A static simulation of dynamic delimited control
• A rewriting logic approach to operational semantics (extended abstract)
• Une charpente de semi-unification
• Manipulating accumulative functions by swapping call-time and return-time computations
• A geometric interpretation of LD-resolution
• Tail recursion modulo context: an equational approach (extended version)
• Synthetic programming
• Obtaining lazy evaluation with continuations in SCHEME

This page was built for publication: Continuation-Based Program Transformation Strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3867165)