Data structures and program transformation
From MaRDI portal
Publication:749197
DOI10.1016/0167-6423(90)90023-7zbMath0712.68014OpenAlexW2116908067MaRDI QIDQ749197
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
Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01)
Related Items
Generic recursive lens combinators and their calculation laws, Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper), Categorical fixed point calculus, Categories, relations and dynamic programming, Constructing language processors with algebra combinators, Folding over neural networks, Classical (co)recursion: Mechanics, POPLMark reloaded: Mechanizing proofs by logical relations, Fantastic morphisms and where to find them. A guide to recursion schemes, Algebraic dynamical systems in machine learning, Unifying structured recursion schemes, Generic functional programming with types and relations, Datatype laws without signatures, Inductive data types for predicate transformers, Paramorphisms, Process Calculi à la Bird-Meertens, When is a function a fold or an unfold?, Calculate categorically!, Fusion of recursive programs with computational effects, Recursive coalgebras from comonads, Least and greatest fixed points in intuitionistic natural deduction, Factorising folds for faster functions, Datatype-generic termination proofs, From Coinductive Proofs to Exact Real Arithmetic, Libraries for Generic Programming in Haskell, A hidden agenda, A type- and scope-safe universe of syntaxes with binding: their semantics and proofs, The derivation of on-line algorithms, with an application to finding palindromes
