Continuation-Based Program Transformation Strategies

DOI10.1145/322169.322183zbMath0429.68028OpenAlexW2050584095WikidataQ56170163 ScholiaQ56170163MaRDI QIDQ3867165

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

optimizationrecursiongeneralizationcontinuationsprogram manipulationprogram transformation strategiessubgoal induction

Mathematics Subject Classification ID

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

Related Items (15)

A syntactic theory of sequential control ⋮ Existential continuation ⋮ A geometric interpretation of LD-resolution ⋮ Final algebra semantics and data type extensions ⋮ Functional un\(|\)unparsing ⋮ Constraint-based correctness proofs for logic program transformations ⋮ Conversion to tail recursion in term rewriting ⋮ Obtaining lazy evaluation with continuations in SCHEME ⋮ Une charpente de semi-unification ⋮ On the expansion of non-linear functions ⋮ Manipulating accumulative functions by swapping call-time and return-time computations ⋮ A static simulation of dynamic delimited control ⋮ Synthetic programming ⋮ On the dynamic extent of delimited continuations ⋮ A Rewriting Logic Approach to Operational Semantics (Extended Abstract)

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