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

DOI10.1016/S0304-3975(97)00084-4MaRDI QIDQ1389440zbMATH OpenOpenAlexFDO

Authors Björn Lisper

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00084-4

zbMATH Keywords

nondeterminismformal semanticsprogram transformationsrecursive program schemesreduction systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
• On Programming under Uncertainty
• A framework to measure the robustness of programs in the unpredictable environment
• Theory and practice of uncertain programming
• scientific article; zbMATH DE number 4037175
• scientific article; zbMATH DE number 4043254
• scientific article; zbMATH DE number 404586
• Reasoning about programs by exploiting the environment
• A consistent semantics of self-adjusting computation
• A Consistent Semantics of Self-adjusting Computation

Cites work

• scientific article; zbMATH DE number 3907750 (Why is no real title available?)
• scientific article; zbMATH DE number 3924117 (Why is no real title available?)
• scientific article; zbMATH DE number 3924119 (Why is no real title available?)
• scientific article; zbMATH DE number 3988695 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 576277 (Why is no real title available?)
• scientific article; zbMATH DE number 1142319 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• Approximate Reduction and Lambda Calculus Models
• Combinatory reduction systems: Introduction and survey
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Explicit substitutions
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras
• LEAN: An intermediate language based on graph rewriting
• Properties of a first-order functional language with sharing
• Proving and applying program transformations expressed with second-order patterns
• Referential transparency, definiteness and unfoldability
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• The chemical abstract machine
• The lambda calculus, its syntax and semantics
• Transfinite reductions in orthogonal term rewriting systems

Cited in

(1)

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

Describes a project that uses

Uses Software

• Erlang
• Haskell

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

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