Imperative abstractions for functional actions

DOI10.1016/j.jlap.2010.07.015zbMath1205.68115OpenAlexW1971927827MaRDI QIDQ604455

Walter Guttmann

Publication date: 11 November 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.015

zbMATH Keywords

relationslazy evaluationprogram semanticsfoldimperative programminghigher-order proceduresinfinite data structuresnon-strictnessunfold

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Data structures (68P05)

Related Items (2)

Unifying Lazy and Strict Computations ⋮ Infinite executions of lazy and strict computations

Uses Software

• Haskell
• ZRC

Cites Work

• Least reflexive points of relations
• Partiality. I: Embedding relation algebras
• Chain-complete posets and directed sets with applications
• Power domains
• ZRC -- A refinement calculus for \(Z\)
• A relation algebraic model of robust correctness
• An algebraic treatment of procedure refinement to support mechanical verification
• Lazy Relations
• Lazy UTP
• On the power of list iteration
• A categorical model for higher order imperative programming
• Refinement Calculus
• Programming as a Discipline of Mathematical Nature
• The Genuine Sieve of Eratosthenes
• The under-appreciated unfold
• The algebra of stream processing functions
• 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: Imperative abstractions for functional actions