Proving and applying program transformations expressed with second-order patterns
From MaRDI portal
Publication:1251063
DOI10.1007/BF00264598zbMath0389.68008WikidataQ56608660 ScholiaQ56608660MaRDI QIDQ1251063
Publication date: 1978
Published in: Acta Informatica (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Higher-order matching for program transformation, More efficient bottom-up multi-pattern matching in trees, A theory of binding structures and applications to rewriting, A notation for lambda terms. A generalization of environments, Unification under a mixed prefix, A compositional framework for fault tolerance by specification transformation, Third order matching is decidable, Reduction and unification in lambda calculi with a general notion of subtype, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Program development schemata as derived rules, An abstract formalization of correct schemas for program synthesis, On the undecidability of second-order unification, Proving theorems by reuse, Infinite trees in normal form and recursive equations having a unique solution
Uses Software