Axioms for strict and lazy functional programs

DOI10.1016/j.apal.2004.10.013zbMath1067.68045OpenAlexW1979928188MaRDI QIDQ1772783

Robert F. Stärk

Publication date: 21 April 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.10.013

zbMATH Keywords

Functional programmingCall-by-name evaluationCall-by-value evaluationContext lemmaMonotonicity of evaluation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• ML
• Haskell
• Miranda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Fully abstract models of typed \(\lambda\)-calculi
• Formalizing non-termination of recursive programs
• A first order logic of effects
• A logic for Miranda, revisited
• Proving congruence of bisimulation in functional programming languages
• Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
• Abstract State Machines
• Evolving Algebras 1993: Lipari Guide
• Programming with variable functions

This page was built for publication: Axioms for strict and lazy functional programs