See this document in CiteSeerX!

A Partial Rehabilitation of Side-Effecting I/O: Non-Determinism in Non-Strict Functional Languages (1996)  (Make Corrections)  
Manfred Schmidt-Schauß



  Home/Search   Context   Related

 
View or download:
ki.informatik.unifran...NDFP96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ki.informatik.unifran...articles (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We investigate the extension of non-strict functional languages like Haskell or Clean by a non-deterministic interaction with the external world. Using call-by-need and a natural semantics which describes the reduction of graphs, this can be done such that the Church-Rosser Theorems 1 and 2 hold. Our operational semantics is a base to recognise which particular equivalencies are preserved by program transformations. The amount of sequentialisation may be smaller than that enforced by other... (Update)

Active bibliography (related documents):   More   All
0.9:   A Non-Deterministic Call-by-Need Lambda Calculus - Kutzner, Schmidt-Schauß (1998)   (Correct)
0.2:   First Year Report - Goodman (1998)   (Correct)
0.2:   M. Dowse, A. Butterfield, M. van Eekelen , M. de Mol , R.. - Nijmegen Institute For   (Correct)

Similar documents based on text:   More   All
0.2:   A Decision Algorithm for Stratified Context Unification - Schmidt-Schauß (2001)   (Correct)
0.2:   Decidability of Bounded Second Order Unification - Schmidt-Schauß   (Correct)
0.2:   A Free Logical Foundation for Nonstrict Functions - Gumb, Lambert   (Correct)

BibTeX entry:   (Update)

@misc{ schmidt-schau-partial,
  author = "Manfred Schmidt-Schauß",
  title = "A Partial Rehabilitation of Side-Effecting I/O: Non-Determinism in Non-Strict
    Functional Languages",
  url = "citeseer.ist.psu.edu/93377.html" }
Citations (may not include all citations):
809   A theory of type polymorphism in programming (context) - Milner - 1978
333   Introduction to Functional Programming (context) - Bird, Wadler - 1988
254   Comprehending monads - Wadler - 1990
244   Imperative functional programming - Jones, Wadler - 1993
210   Its Syntax and Semantics (context) - Barendregt, Calculus - 1984
169   A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
138   Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, van Eekelen - 1993
114   A natural semantics for lazy evaluation - Launchbury - 1993
109   The Implementation of Functional Programming Languages (context) - Jones - 1987
102   Term graph rewriting (context) - Barendregt, van Eekelen et al. - 1987
75   Concurrent Clean - Nocker, Smetsers et al. - 1991
66   Efficient compilation of lazy evaluation - Johnsson - 1984
59   A compiler for Lazy ML (context) - Augustsson - 1984
38   functional programming and Input/Output (context) - Gordon - 1994
32   Single-threaded polymorphic lambda-calculus (context) - Guzman, Hudak - 1990
23   Expressing and reasoning about non-deterministic functional .. (context) - Hughes, O'Donnell - 1989
20   Linearity and laziness - Wakeling, Runciman - 1991
17   Guaranteeing safe destructive updates through a type system .. - Smetsers, Barendsen et al. - 1993
17   Guaranteeing safe destructive updates through a type system .. - Smetsers, Barendsen et al. - 1993
17   Interactive functional programs: models (context) - Achten - 1996
13   Optimal reductions in weak--calculus with shared environment.. (context) - Yoshida - 1993
12   An adequate operational semantics of sharing in lazy evaluat.. (context) - Purushothaman, Seaman - 1992
11   Compilation by transformation in the Glasgow Haskell Compile.. - Jones, Santos - 1994
7   An infinitary church-rosser property for non-collapsing orth.. (context) - Kennaway, Sleep et al. - 1993
4   Constrained Lambda Calculus (context) - Mandel - 1995
4   Natural expert: A commercial functional programming environm.. - Hutchison, Neuhaus et al. - 1996
4   Concurrent clean: Version (context) - Plasmeijer, van Eekelen - 1995
4   Nondeterministic functional programming with sets (context) - Hughes, 'Donnell - 1990
1   External function calls in a functional language (context) - Schmidt-Schauss - 1991
1   structures: Extending a parallel non-strict functional langu.. (context) - Barth, Nikhil et al. - 1991
1   Peyton Jones [ed (context) - Hudak, Simon
1   A non-strict purely functional language (context) - Boutel, Fairbairn et al. - 1992
1   On input and output in functional languages (context) - Jones, Sinclair - 1991

Documents on the same site (http://www.ki.informatik.uni-frankfurt.de/papers/articles.html):   More
Tinte: developing a prototype for typesetting music in Clean - a.. - Panitz   (Correct)
The G#-machine: Efficient strictness analysis in Haskell - Schütz (1995)   (Correct)
Efficient Strictness Analysis of Haskell in Haskell.. - Schütz..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC