scientific article; zbMATH DE number 3924119
From MaRDI portal
Publication:3698293
zbMATH Open0577.68034MaRDI QIDQ3698293FDOQ3698293
Authors: Laurent Kott 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
functional programmingprogram transformationscorrectness proofprogram schemescorrectness problemunfold/fold technique
Artificial intelligence (68T99) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)
Cited In (22)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations
- Title not available (Why is that?)
- Unfolding rules for GHC programs
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Fold and unfold for program semantics
- The under-appreciated unfold
- Title not available (Why is that?)
- The under-appreciated unfold
- Fold and unfold for program semantics
- Infinite unfolding and transformations of nondeterministic programs
- Automatic Correctness Proofs for Logic Program Transformations
- Unfold/fold transformations of logic programs
- Synthetic programming
- Title not available (Why is that?)
- Rules + strategies for transforming lazy functional logic programs
- A narrowing-based instantiation rule for rewriting-based fold/unfold transformations
- Proving the correctness of unfold/fold program transformations using bisimulation
- The next 700 program transformers
- Program morphisms
- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
- Work it, wrap it, fix it, fold it
- Unfolding for CHR programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698293)
