Computing in unpredictable environments: semantics, reduction strategies, and program transformations
From MaRDI portal
Publication:1389440
DOI10.1016/S0304-3975(97)00084-4zbMath0893.68095OpenAlexW2029770167MaRDI QIDQ1389440
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
Uses Software
Cites Work
- 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
- The chemical abstract machine
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Proving and applying program transformations expressed with second-order patterns
- Combinatory reduction systems: Introduction and survey
- Referential transparency, definiteness and unfoldability
- LEAN: An intermediate language based on graph rewriting
- Transfinite reductions in orthogonal term rewriting systems
- Infinite trees in normal form and recursive equations having a unique solution
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- A Transformation System for Developing Recursive Programs
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Initial Algebra Semantics and Continuous Algebras
- Approximate Reduction and Lambda Calculus Models
- Explicit substitutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing in unpredictable environments: semantics, reduction strategies, and program transformations
