Transparent fault tolerance for scalable functional computation
From MaRDI portal
Publication:5371963
DOI10.1017/S095679681600006XzbMATH Open1420.68026OpenAlexW2254546900MaRDI QIDQ5371963FDOQ5371963
Authors:
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s095679681600006x
Recommendations
- scientific article; zbMATH DE number 1033646
- scientific article; zbMATH DE number 1863327
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Optimal fault-tolerant computing on multiprocessor systems
- Fault-tolerant functional reactive programming (extended version)
- Fault-tolerant distributed computing
Reliability, testing and fault tolerance of networks and computer systems (68M15) Functional programming and lambda calculus (68N18)
Cites Work
- Title not available (Why is that?)
- Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
- Time, clocks, and the ordering of events in a distributed system
- The n-Queens Problem
- MULTILISP: a language for concurrent symbolic computation
- Parallel functional programming in Eden
- Sign changes in sums of the Liouville function
- Single Assignment C: efficient support for high-level array operations in a functional setting
- Title not available (Why is that?)
- Freeze after writing, quasi-deterministic parallel programming with LVars
- Fault tolerance via idempotence
- Runtime support for multicore Haskell
- Transparent fault tolerance for scalable functional computation
Cited In (5)
Uses Software
This page was built for publication: Transparent fault tolerance for scalable functional computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371963)
