Reasoning about deterministic concurrent functional i/o

Authors:
Malcolm Dowse;Andrew Butterfield;Marko van Eekelen
Affiliations:
Trinity College Dublin, Ireland;Trinity College Dublin, Ireland;University of Nijmegen, The Netherlands
Venue:
IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Year:
2004

Citing 6
Cited 4

Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An operational semantics for I/O in a lazy functional language

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Concurrent Haskell

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent Monadic Interfacing

IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Proving Correctness of Programs with IO - A Paradigm Comparison

IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Proving make correct: I/O proofs in Haskell and clean

IFL'02 Proceedings of the 14th international conference on Implementation of functional languages

Modelling deterministic concurrent I/O

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A Single-Step Term-Graph Reduction System for Proof Assistants

Applications of Graph Transformations with Industrial Relevance
Automatic verification for interactive graphical programs

Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Proof tool support for explicit strictness

IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops a language for reasoning about concurrent functional I/O. We assume that the API is specified as state-transformers on a single world state. We then prove that under certain conditions evaluation in this language is deterministic, and give some examples. All properties were machine-verified using the Sparkle proof-assistant and using Core-Clean as a meta-language.