Imperative abstractions for functional actions
DOI10.1016/J.JLAP.2010.07.015zbMATH Open1205.68115OpenAlexW1971927827MaRDI QIDQ604455FDOQ604455
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
relationsprogram semanticsfoldimperative programminglazy evaluationhigher-order proceduresinfinite data structuresnon-strictnessunfold
Data structures (68P05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)
Cites Work
- Refinement Calculus
- Chain-complete posets and directed sets with applications
- Unifying theories for logic programming
- Programming as a Discipline of Mathematical Nature
- Partiality. I: Embedding relation algebras
- Power domains
- ZRC -- A refinement calculus for \(Z\)
- The algebra of stream processing functions
- 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
- The Genuine Sieve of Eratosthenes
- The under-appreciated unfold
- Least reflexive points of relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Imperative abstractions for functional actions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604455)
