Static typing for a faulty lambda calculus

DOI10.1145/1159803.1159809MaRDI QIDQ5501457zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 3 August 2015

Published in Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1159803.1159809

zbMATH Keywords

fault tolerancelambda calculusreliable computingsoft faultstransient hardware faultstype systemstyped intermediate languages

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Functional programming and lambda calculus (68N18)

Recommendations

• Reasoning about Control Flow in the Presence of Transient Faults
• Faulty Logic: Reasoning about Fault Tolerant Programs
• scientific article; zbMATH DE number 4199936
• Transformation of programs for fault-tolerance
• Lightweight checkpointing for concurrent ML

Cited in

(4)

• Type error slicing in implicitly typed higher-order languages
• Reasoning about Control Flow in the Presence of Transient Faults
• αCheck: A mechanized metatheory model checker
• Modal crash types for intermittent computing

This page was built for publication: Static typing for a faulty lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501457)