MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Introduction to functional programming (1988) [1124 citations — 35 self]

Abstract:

Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating e ects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modi cation of a simple evaluator � how monads act as the basis of a datatype of arrays subject to in-place update � and how monads can be used to build parsers. 1

Citations

3859 Design Patterns: Elements of Reusable Object Oriented Software – Gamma, Helm, et al. - 1994
1416 The Definition of Standard ML – MILNER, TOFTE, et al. - 1989
523 Categories for the working mathematician – Lane - 1997
385 Comprehending monads – WADLER - 1992
346 Computational lambda calculus and monads – Moggi - 1989
338 ML for the Working Programmer – Paulson - 1991
326 Introduction to higher order categorical logic – Lambek, Scott - 1986
294 Pizza into Java: Translating theory into practice – Odersky, Wadler - 1997
225 Call-by-name, call-by-value, and the -calculus – Plotkin - 1975
225 Definitional interpreters for higherorder programming languages – Reynolds - 1972
131 The essence of Algol – Reynolds - 1981
119 Abstract Interpretation of Declarative Languages – Abramsky, Hankin - 1987
101 Continuation-passing, closure-passing style – Appel, Jim - 1989
101 Algebraic reconstruction of types and effects – JOUVELOT, GIFFORD - 1991
92 Design of the programming language forsythe – Reynolds - 1996
86 An Overview of Miranda – Turner - 1986
82 Typing first-class continuations in ML – Duba, Harper, et al. - 1991
77 to replace failure by a list of successes – Wadler - 1985
68 Single-threaded polymorphic lambda calculus – Guzm'an, Hudak - 1990
63 editors). Report on the Programming Language Haskell, A Non-strict Purely Functional Language (Version 1.2 – Hudak, Jones, et al. - 1992
62 Abstracting Control, in – Danvy, Filinski - 1990
54 Integrating functional and imperative programming – Gifford, Lucassen - 1986
54 Detecting global variables in denotational specifications – Schmidt - 1985
51 Using category theory to design implicit conversions and generic operators – Reynolds - 1980
45 The essence of functional programming (invited talk – Wadler - 1992
38 A functional theory of exceptions – Spivey - 1990
34 the ultimate imperative – Sussman, Lambda - 1976
32 Assignments for applicative languages – Swarup, Reddy, et al. - 1991
29 Update analysis and the efficient implementation of functional aggregates – Bloss - 1989
27 and Yannis Smaragdakis. Functional programming in C – McNamara - 2000
24 A framework for higher-order functions in C – Läufer - 1995
21 The coherrence of languages with intersection types – Reynolds - 1991
21 A semantic model of reference counting and its abstraction (detailed summary – Hudak - 1986
16 Continuation-based mutable abstract data types, or how to have your state and munge it too – Hudak - 1992
11 Syntactic control of interference, part II – Reynolds - 1989
8 FACT! – the functional side of C++. http://www.fz-juelich.de/zam/FACT – Striegnitz - 2003
7 a continuation extension for – Perry, HopeC - 1987
3 An abstract view of programming languges. Course notes – Moggi
1 Bridging Functional and Object-Oriented Programming” Georgia Tech CoC – Smaragdakis, McNamara
1 A type checker. Chapter 9 of Simon Peyton Jones, The Implementation of Functional Programming Languages – Hancock - 1987
1 there a use for linear logic – Is - 1991
View or Download | Add to My Collection | Correct Errors