Computing in unpredictable environments: Semantics, reduction strategies, and program transformations

DOI10.1007/3-540-61064-2_36OpenAlexW1564137655MaRDI QIDQ5878908

Björn Lisper

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_36

zbMATH Keywords

formal semanticsprogram transformationsrecursive program schemesnondeterminismreduction systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of a first-order functional language with sharing
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• The lambda calculus, its syntax and semantics
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• LCF considered as a programming language
• Proving and applying program transformations expressed with second-order patterns
• Referential transparency, definiteness and unfoldability
• Transfinite reductions in orthogonal term rewriting systems
• Infinite trees in normal form and recursive equations having a unique solution
• Operational and Semantic Equivalence Between Recursive Programs
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A Transformation System for Developing Recursive Programs
• Initial Algebra Semantics and Continuous Algebras

This page was built for publication: Computing in unpredictable environments: Semantics, reduction strategies, and program transformations