On conservativity of concurrent Haskell

The calculus CHF models Concurrent Haskell extended by concurrent, implicit futures. It is a process calculus with concurrent threads, monadic concurrent evaluation, and includes a pure functional lambda-calculus which c
The calculus CHF models Concurrent Haskell extended by concurrent, implicit futures. It is a process calculus with concurrent threads, monadic concurrent evaluation, and includes a pure functional lambda-calculus which comprises data constructors, case-expressions, letrec-expressions, and Haskell’s seq. Futures can be implemented in Concurrent Haskell using the primitive unsafeInterleaveIO, which is available in most implementations of Haskell. Our main result is conservativity of CHF, that is, all equivalences of pure functional expressions are also valid in CHF. This implies that compiler optimizations and transformations from pure Haskell remain valid in Concurrent Haskell even if it is extended by futures. We also show that this is no longer valid if Concurrent Haskell is extended by the arbitrary use of unsafeInterleaveIO.
show moreshow less

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
Metadaten
Author:David Sabel, Manfred Schmidt-Schauß
URN:urn:nbn:de:hebis:30:3-242523
URL:http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank-47.pdf
Parent Title (German):Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 47
Series (Serial Number):Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (47)
Publisher:Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology
Place of publication:Frankfurt [am Main]
Document Type:Working Paper
Language:English
Date of Publication (online):2011/10/17
Date of first Publication:2011/10/17
Publishing Institution:Univ.-Bibliothek Frankfurt am Main
Release Date:2012/02/07
SWD-Keyword:Formale Semantik; Funktionale Programmierung; Lambda-Kalkül; Nebenläufigkeit
Issue:Version: 17. Oktober 2011
Pagenumber:27
First Page:1
Last Page:27
HeBIS PPN:289451833
Institutes:Informatik
Dewey Decimal Classification:004 Datenverarbeitung; Informatik
Sammlungen:Universitätspublikationen
Licence (German):License LogoCreative Commons - Namensnennung-Keine Bearbeitung

$Rev: 11761 $