Reasoning About Deterministic Concurrent Functional I/O-Reference-Cited by-同舟云学术

Reasoning About Deterministic Concurrent Functional I/O

Published:2005 Issue: Volume: Page:177-194
ISSN:0302-9743
Container-title:Implementation and Application of Functional Languages
language:
Short-container-title:

Author:

Dowse Malcolm,Butterfield Andrew,van Eekelen Marko

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11431664_11

Reference14 articles.

1. Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science 6(6), 579–612 (1996)

2. Lecture Notes in Computer Science;A. Butterfield,2002

3. Carter, D.: Deterministic concurrency. Master’s thesis, Department of Computer Science, University of Bristol (September 1994)

4. de Mol, M., van Eekelen, M., Plasmeijer, R.: Sparkle: A functional theorem prover. In: Arts, T., Mohnen, M. (eds.) IFL 2001. LNCS, vol. 2312, p. 55. Springer, Heidelberg (2002)

5. Dowse, M., Butterfield, A., van Eekelen, M., de Mol, M., Plasmeijer, R.: Towards machine verified proofs for I/O. Technical Report NIII-R0415, University of Nijmegen (April 2004)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Beautiful Code, Beautiful Proof?;Lecture Notes in Computer Science;2013

2. A Single-Step Term-Graph Reduction System for Proof Assistants;Applications of Graph Transformations with Industrial Relevance;2008

3. Modelling deterministic concurrent I/O;ACM SIGPLAN Notices;2006-09-16

4. Temporal Properties of Clean Programs Proven in Sparkle-T;Central European Functional Programming School;2006