Proving Properties of Lazy Functional Programs with Sparkle

DOI10.1007/978-3-540-88059-2_2zbMath1170.68420OpenAlexW2100685418MaRDI QIDQ3599177

R. Plasmeijer, Marko van Eekelen, Maarten de Mol

Publication date: 3 February 2009

Published in: Central European Functional Programming School (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88059-2_2

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Uses Software

• Coq
• Isabelle
• CLEAN
• Sparkle
• evt

Cites Work

• Edinburgh LCF. A mechanized logic of computation
• Proof Tool Support for Explicit Strictness
• Logic and Computation
• Algorithm + strategy = parallelism
• Fast and loose reasoning is morally correct
• Reasoning About Deterministic Concurrent Functional I/O
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proving Properties of Lazy Functional Programs with Sparkle