Daniel Eli Rabin  Home/Search
Context Related
| pictographer.com/dan...Rabinthesis.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pictographer.com/danrabin...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Calculi for Functional Programming Languages with Assignment Daniel Eli Rabin 1996 Pure functional programming and imperative programming appear to be contradictory approaches to the design of programming languages. Pure functional programming insists that variables have unchanging bindings and that these bindings may be substituted freely for occurrences of the variables. Imperative programming, however, relies for its computational power on the alteration of variable bindings by the action... (Update)
Context of citations to this paper: More
...that express state dependence. These additional type parameters represent a conceptual overhead which we would like to avoid. Rabin [Rab96] attempts to combine the features of ilc and state threads though he did not consider type reconstruction issues. Huang and Reddy...
.... encapsulate effects for ILC [SRI91] and var [ORH93, CO94] are now known to rely on conditions that are not invariant under reduction [Rab96] A final blow is the failed proof of subject reduction for monadic state by Launchbury and Sabry [LS97] To gain some intuition about...
Cited by: More
Monadic Encapsulation of Effects: A Revised Approach (Extended .. - Moggi, Sabry (1999) (Correct)
Monadic Encapsulation in ML - Semmelroth, Sabry (1999) (Correct)
Monadic State: Axiomatization and Type Safety - John Launchbury (1997) (Correct)
Active bibliography (related documents): More All
0.6: Type Reconstruction for Syntactic Control of Interference, Part 2 - Yang, Huang (Correct)
0.3: Names and Higher-Order Functions - Stark (1995) (Correct)
0.3: Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (Correct)
Similar documents based on text: More All
0.1: Bibliography of Yale's Functional Programming Research Group (aka.. - Hudak (1994) (Correct)
0.1: Rabin Measures - Klarlund, Kozen (1995) (Correct)
0.1: The Rabin Index and Chain automata, with.. - Krishnan, Puri.. (Correct)
Related documents from co-citation: More All
5: Syntactic control of interference (context) - Reynolds - 1989
5: A type system for a lambda calculus with assignments (context) - Chen, Odersky - 1994
5: Assignments for applicative languages (context) - Swarup, Reddy et al. - 1991
BibTeX entry: (Update)
D. Rabin. Calculi for Functional Programming Languages with Assignment. PhD thesis, Yale University, 1996. http://citeseer.ist.psu.edu/rabin96calculi.html More
@misc{ rabin96calculi,
author = "D. Rabin",
title = "Calculi for Functional Programming Languages with Assignment",
text = "D. Rabin. Calculi for Functional Programming Languages with Assignment.
PhD thesis, Yale University, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/rabin96calculi.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
729 The Lambda Calculus: its Syntax and Semantics (context) - Barendregt - 1984
474 Term rewriting systems - Klop - 1992
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
369 Information and Computation (context) - Moggi, computation - 1991
343 Principal type schemes for functional programs (context) - Damas, Milner - 1982
325 Towards a theory of type structure (context) - Reynolds - 1974
291 Computational lambda-calculus and monads - Moggi - 1989
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
254 Revised 4 report on the algorithmic language Scheme - Clinger, Rees - 1991
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
244 Imperative functional programming - Jones, Wadler - 1993
218 The mechanical evaluation of expressions (context) - Landin - 1964
215 Theoretical Computer Science (context) - Girard - 1987
215 Theoretical Computer Science (context) - Lafont, abstract - 1988
183 Report on the programming language Haskell: a non-strict (context) - Hudak, Jones et al. - 1992
169 The call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
160 The principal type scheme of an object in combinatory logic (context) - Hindley - 1969
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
137 Laboratory for Foundations of Computer Science (context) - Milner, p-calculus et al. - 1991
101 Lazy functional state threads - Launchbury, Jones - 1994
99 Polymorphic effect systems (context) - Lucassen, Gifford - 1988
92 Subtyping recursive types - Amadio, Cardelli - 1991
81 The theory and practice of first-class prompts (context) - Felleisen - 1988
76 Control operators (context) - Felleisen, Friedman - 1986
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
71 Lambda calculus schemata - Fischer - 1972
69 Revised report on the algorithmic language ALGOL (context) - Naur, Backus et al. - 1963
51 the expressive power of programming languages - Felleisen - 1991
47 volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
46 SIMULA Begin (context) - Birtwistle, Dahl et al. - 1973
38 and the lambda calculus (context) - Odersky, Rabin et al. - 1993
32 Single-threaded polymorphic lambda calculus (context) - Guzman, Hudak - 1990
29 Inferring the equivalence of functional programs that mutate.. - Mason, Talcott - 1992
29 Syntactic control of interference revisited - O'Hearn, Power et al. - 1995
24 A functional theory of local names - Odersky - 1994
23 Lazy imperative programming - Launchbury - 1993
17 Lisp and Symbolic Computation (context) - Fischer, schemata - 1993
16 A calculus for assignments in higher-order languages (context) - Felleisen - 1987
14 the expressiveness of purely functional I/O systems - Hudak, Sundaresh - 1988
13 fifteen years later (context) - Girard, variable - 1990
13 Report on the algorithmic language ALGOL (context) - Naur, Backus et al. - 1960
13 Syntactic detection of single-threading using continuations - Fradet - 1991
11 Center for the Study of Language and Information (context) - Mason, of et al. - 1986
10 A type system for a lambda calculus with assignment (context) - Chen, Odersky - 1993
9 A syntactic theory of local names (context) - Odersky - 1993
9 How to make destructive updates less destructive - Odersky - 1991
8 volume 6 of Annals of Mathematics Studies (context) - Church, of - 1951
6 Reasoning about continuations with control effects (context) - Jouvelot, Gifford - 1989
6 Research Report YALEU/DCS/RR (context) - Odersky, Rabin et al. - 1993
6 Research Report YALEU/DCS/RR (context) - Odersky, Rabin et al. - 1992
5 Equivalence in functional languages with side effects (context) - Mason, Talcott - 1991
4 Research Report YALEU/DCS/RR (context) - Hudak, datatypes - 1992
4 A syntactic method for proving observational equivalences - Odersky - 1993
3 Department of Computer Science (context) - Reddy, logic et al. - 1993
2 Type reconstruction for SCI (context) - Huang, Reddy - 1995
1 Syntactic control (context) - Reynolds - 1978
1 Domesticating imperative constructs so that they can live in.. (context) - Graham, Kock - 1991
1 Dis- tinguished Dissertations in Computer Science (context) - Gordon, Input - 1994
1 Acceptors as values: Functional programming in classical lin.. (context) - Reddy - 1991
1 On expressing the mutation of state in a functional programm.. (context) - Guzman - 1993
The graph only includes citing articles where the year of publication is known.
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