Constructively characterizing fold and unfold

DOI10.1007/978-3-540-25938-1_11MaRDI QIDQ5713936zbMATH OpenOpenAlexFDO

Authors Tjark Weber, James Caldwell

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98080

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• When is a function a fold or an unfold?
• Fold and unfold for program semantics
• Fold and unfold for program semantics
• Theory and applications of inverting functions as folds
• How powerful are folding/unfolding transformations?

Cited in

(13)

• Constructions preserving evasiveness and collapsibility
• Theory and applications of inverting functions as folds
• Eureka definitions for free! Disagreement points for fold/unfold transformations
• Safe folding/unfolding with conditional narrowing
• Inverting functions as folds
• When is a function a fold or an unfold?
• A tutorial on the universality and expressiveness of fold
• Coroutining folds with hyperfunctions
• Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
• The under-appreciated unfold
• Fold and unfold for program semantics
• Fold and unfold for program semantics
• Folding left and right matters: Direct style, accumulators, and continuations

Describes a project that uses

Uses Software

• Nuprl

This page was built for publication: Constructively characterizing fold and unfold

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