Data structures and program transformation

DOI10.1016/0167-6423(90)90023-7MaRDI QIDQ749197zbMATH OpenOpenAlexFDO

Authors Grant Malcolm

Publication date 1990

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(90)90023-7

zbMATH Keywords

data structuresfunctional programmingprogram transformations

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3970091
• scientific article; zbMATH DE number 2084336
• Point-free program transformation
• scientific article; zbMATH DE number 3845032
• Structuring FP-style functional programs

Cited in

(42)

• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
• Factorising folds for faster functions
• Classical (co)recursion: Mechanics
• Libraries for generic programming in Haskell
• Categorical fixed point calculus
• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
• Process Calculi à la Bird-Meertens
• Inductive data types for predicate transformers
• Data structures of programming languages as realization of the nominative data
• A `division' transformation for program and data structures and the structure clash problem
• Folding over neural networks
• Datatype laws without signatures
• Least and greatest fixed points in intuitionistic natural deduction
• Generic recursive lens combinators and their calculation laws
• When is a function a fold or an unfold?
• Isomorphic data type transformations
• The derivation of on-line algorithms, with an application to finding palindromes
• Fantastic morphisms and where to find them. A guide to recursion schemes
• scientific article; zbMATH DE number 2084336 (Why is no real title available?)
• Fusion of recursive programs with computational effects
• The Mechanical Transformation of Data Types
• Constructing language processors with algebra combinators
• Datatype-generic termination proofs
• A Groupoid of Isomorphic Data Transformations
• Algebraic dynamical systems in machine learning
• Recursive coalgebras from comonads
• Paramorphisms
• scientific article; zbMATH DE number 3970091 (Why is no real title available?)
• Strongly typed rewriting for coupled software transformation
• Programming Languages and Systems
• A hidden agenda
• scientific article; zbMATH DE number 3845032 (Why is no real title available?)
• Unifying structured recursion schemes. An extended study
• Categories, relations and dynamic programming
• From Coinductive Proofs to Exact Real Arithmetic
• POPLMark reloaded: mechanizing proofs by logical relations
• ``Everything is everything revisited: shapeshifting data types with isomorphisms and hylomorphisms
• Polytypic data conversion programs
• Calculate categorically!
• Set notation as a language to specify data transformation programs
• Generic functional programming with types and relations
• The formalism underlying EASYMAP: A precompiler for refinement-based exploration of hierarchical data organizations

This page was built for publication: Data structures and program transformation

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