81. The Optimal Implementation Of Functional Programming Languages - Cambridge Unive Home Catalogue The Optimal Implementation of functional programming languages.Related Areas The Optimal Implementation of functional programming languages. http://books.cambridge.org/0521621127.htm

Home Catalogue Related Areas: Computer Sciences Cambridge Tracts in Theoretical Computer Science New titles Email For updates on new titles in: Computer Sciences The Optimal Implementation of Functional Programming Languages Andrea Asperti, Stefano Guerrini In stock Contents 1. Introduction; 2. Optimal reduction; 3. The full algorithm; 4. Optimal reductions and linear logic; 5. Zig-zag; 6. Paths; 7. Read-back; 8. Other translations in sharing graphs; 9. Safe nodes; 10. Complexity; 11. Functional programming; 12. Source language; Bibliography; Index. Cambridge University Press 2001. Security Order by phone (+44 (0)1223 326050) or fax (+44 (0)1223 326111).

82. This Page From Brad Appleton's Software Engineering & Computing Links Has Moved is a general purpose, higher order, pure and lazy functional programming languagefor the in the spirit of other modern lazy functional languages like Haskell http://www.enteract.com/~bradapp/links/prog-langs.html

http://www.bradapp.net/links/prog-langs.html Redirecting you automatically ... if you are not redirected within 5 seconds - please Click here

83. Exception Handlers In Functional Programming Languages August 1993 (Vol. 19, No. 8). pp. 826834 ExceptionHandlers in functional programming languages. PDF. http://www.computer.org/tse/ts1993/e0826abs.htm

August 1993 (Vol. 19, No. 8) p p. 826-834 Exception Handlers in Functional Programming Languages R.  Govindarajan Constructs for expressing exception handling can greatly help to avoid clutter in code by allowing the programmer to separate the code to handle unusual situations from the code for the normal case. The author proposes a new approach to embed exception handlers in functional languages. The proposed approach discards the conventional view of treating exceptions, as a means of effecting a control transfer; instead, exceptions are used to change the state of an object. The two types of exceptions, terminate and resume, are treated differently. A terminate exception, when raised, is viewed as shielding the input object. On the other hand, a resume exception designates the input object as curable and requires the immediate application of a handler function. This approach enables the clean semantics of functions raising exceptions without associating any implementation restriction and without loss of the referential transparency and the commutativity properties of functions. Index Terms- functional programming; exception handling; programmer; functional languages; terminate; resume; input object; implementation restriction; referential transparency; commutativity properties; exception handling; functional programming; high level languages; programming theory The full text of IEEE Transactions on Software Engineering is available to members of the IEEE Computer Society

84. Functional Programming Languages functional programming languages. A functional or applicative language isone in which the computational model is that of expression evaluation. http://homepages.feis.herts.ac.uk/~msc_fl/fl-node52.html

Department of Computer Science Next: Basic components Up: A functional programming language: Previous: A functional programming language: Functional programming languages A functional or applicative language is one in which the computational model is that of expression evaluation. This is not like a procedural language (such as C, Basic, Cobol or Ada) where the computational principle is changing the contents of stored values (called ``variables''). Functional languages have no storage, no statements. In functional languages no value can ever be changed, new values can only be built from existing ones without changing them, this is what happens when expressions are evaluated. If a procedural language like Modula-2 or Ada was stripped of all its statements, its variables, its arrays it would be close to a functional language, but a very weak one. Useful functional languages must have much richer expressions and data constructors to allow them to describe non-trivial computations. So a functional program only consists of declarations, definitions of functions, data types, constants and just one expression to be evaluated calling the defined functions with actual arguments (known as applying functions to arguments), its result is the result of the program

85. Functional Programming Using Caml Light 1) Introduction. I) functional programming. 2) functional languages 2.1)History of functional languages; 2.2) The ML family; 2.3) The Miranda family. http://caml.inria.fr/tutorial/

Functional programming using Caml Light This text is an introduction to functional programming in general and the Caml Light language in particular. The table of contents is shown below. You can retrieve and view individual chapters (in DVI). The whole manual is also available in PDF DVI and Postscript 1) Introduction I) Functional programming 2) Functional languages 2.1) History of functional languages 2.2) The ML family 2.3) The Miranda family 3) Basic concepts 3.1) Toplevel loop 3.2) Evaluation: from expressions to values 3.3) Types 3.4) Functions 3.5) Definitions 3.6) Partial applications 4) Basic types 4.1) Numbers 4.2) Boolean values 4.3) Strings and characters 4.4) Tuples 4.5) Patterns and pattern-matching 4.6) Functions 5) Lists 5.1) Building lists 5.2) Extracting elements from lists: pattern-matching 5.3) Functions over lists 6) User-defined types 6.1) Product types 6.2) Sum types 6.3) Summary II) Caml Light specifics 7) Mutable data structures 7.1) User-defined mutable data structures 7.3) Arrays 7.5) Polymorphism and mutable data structures 8) Escaping from computations: exceptions 8.1) Exceptions

86. Programming Languages Bookshelf of introductory textbooks on Haskell and functional programming in general; Introductionto programming languages by Anthony A. Aaby (overview of http://www.tcs.informatik.uni-muenchen.de/~hwloidl/prg-lang.html

Progamming Languages This page collects links and other information about programming languages, mainly declarative ones. Course notes for a few lectures on functional languages are available: Web pages on programming languages in general: Prging Lang research Web page @ CMU Virtual Library @ Imperial College, London Catalog of compilers, interpreters, and other language tools The Haskell Bookshelf of introductory textbooks on Haskell and Functional Programming in general Designing and Building Parallel Programs Concepts and Tools for Parallel Software Engineering , Ian T. Foster, Addison Wesley, Reading, MA, 1995. (a good introductory textbook on parallel programming) Programming Language Review (a comprehensive page with links to more detailed language info) Introduction to Programming Languages by Anthony A. Aaby (overview of different classes of languages) Functional Languages: The Haskell family: Haskell, a lazy purely functional programming language ( Haskell Home Page Glasgow Haskell compiler GHC User's Guide ). GHC implements Haskell 1.2 (GHC 0.xx) and Haskell 1.4 (2.xx).

87. Computer Languages Page Index at top of page functional languages Archive on functional languages A J. Farrell'sfunctional programming Page Index at top http://www.csci.csusb.edu/dick/languages.html

Dick Botting 's Language Links Page Index General Internet Resources for Programing etc. Ada Algol 60 C: syntax and FAQ and Planet Source Code C++ COBOL (Old) ECMAscript - scripts sent over WWW to be executed by browser. Eiffel FORTH Graphical and/or Visual Programming ici ... Javascript - scripts sent over WWW to be executed by browser. LISP MATHS Notation for mathematics in ASCII ML - Meta-Language Pascal (Old) Perl PHP - Allows commands to be scripted inside WWW pages for execution on server(Mon, 15 Nov 1999 ) se.www.sites.html: Web-enabled RDBMS on Linux (11 Feb 1997 19:19:56 GMT) Prolog Scheme Paper on Scripting Languages SmallTalk UML the Unified Modelling Language UNIX Bourne Shell Visual Basic: See Planet Source Code VRML XML Z syntax and links Pointers to Other Languages If it isn't in this index, please use your browsers search function/menu/key to search for the language you are interested in inside this page. Also See: Sample MATHS definitions of Languages and descriptions of Software Engineering Methods General Internet Resources for Programing etc. Languages at dmoz.org

88. Language A Purely functional Language Haskell is a polymorphicly typed, lazy, purely functionallanguage, quite different from most other programming languages. http://www.ddj.com/articles/2000/0013/language.htm

more search A RTICLES C ... ADVERTISE WITH DDJ GO TO... AI Algorithms Basic Benchmarking/Testing C/C++ Programming Communications/Networking Computer Security Data Compression Database Development Distributed Computing Graphics Programming Java Linux Patterns/OOD Perl Python-URL! Real-Time Computing Scientific Computing Scripting/Alt. Languages Tcl-URL! UNIX XML and Web Services To buy one (or more) of the following articles, click here Overview of the BETA Programming Language by Ole Lehrmann Madsen BETA is a modern object-oriented language from the Scandinavian school of object-orientation, from which the first object-oriented language, Simula, was developed. BETA supports the object-oriented perspective on programming and contains comprehensive facilities for procedural and functional programming. BETA has powerful abstraction mechanisms for supporting identification of objects, classification and composition. BETA is a strongly typed language like Simula, Eiffel and C++, with most type checking being carried out at compile time. It is well known that it is not possible to obtain all type checking at compile time without sacrificing the expressiveness of the language. BETA has an optimum balance between compiletime type checking and runtime type checking. Lisp: Good News, Bad News, How to Win Big

89. Programming Languages - Dr. Salih Yurttas programming languages design principles, implementationconstructs dr. salih yurttas functional languages http://faculty.cs.tamu.edu/yurttas/PL/FL/

programming languages - design principles, implementation constructs dr. salih yurttas functional languages Lisp Miranda Haskell

90. Implementation Of Functional Languages (IFL'98) related to the implementation of functional or functionbased languages. generation;(abstract) machine architectures; concurrent programming and program http://www.cs.ucl.ac.uk/staff/c.clack/ifl98/

91. DePaul University Eventhandling); No assignment (useful in thread-safe programming).Modern OO programming languages have a lot of functional features. http://www.depaul.edu/~jriely/csc447win2003/lectures/class-05-009.html

92. Chilli's Virtual Home: Research Despite growing up with imperative programming languages, I have, after an intermezzowith logic and functional logic programming, come to the conclusion that http://www.cse.unsw.edu.au/~chak/research.html

R ESEARCH I am generally interested in declarative programming languages, parallel and distributed computing, and in compiler construction. Recently, I also had a closer look at operating systems. I am a member of the PLS research group Functional Programming Despite growing up with imperative programming languages, I have, after an intermezzo with logic and functional logic programming, come to the conclusion that the most promising sort of high-level languages are functional languages. In particular, I have become rather fond of the non-strict, purely functional language Haskell (it is so nice that there is even a poem about it). I have come to this conclusion by both seeing the conceptual benefits of programming languages that allow for rather rigorous mathematical reasoning and having written a lot of code in functional languages. For me, functional programming just works. It is certainly a question of application area, but when I don't need a systems programming language, such as C, I get the best results with the least amount of work by using functional programming. For the last two years, I have put substantial work into foreign language interfacing for Haskell. The major results so far are the

93. Journal Of Functional And Logic Programming Electronic journal.Category Science Math Logic and Foundations Publications Journals...... The Journal expects articles ranging from the theoretical foundations of functionaland logic programming up to the application of such languages ``in the real http://danae.uni-muenster.de/lehre/kuchen/JFLP/

The Journal of Functional and Logic Programming An Electronic Journal published by the European Association for Programming Languages and Systems (EAPLS) ISSN 1080-5230 (Volumes 1995-2000 were published by The MIT Press The Journal of Functional and Logic Programming (JFLP) is an electronic journal which covers a broad scope of topics from functional and logic programming. It is especially concerned with the integration of the functional and logic paradigms as well as their common foundations. The Journal expects articles ranging from the theoretical foundations of functional and logic programming up to the application of such languages ``in the real world''. All articles are published electronically using the facilities of the Internet, in order to enable fast and easy access from all over the world. Before articles can be published, they have to pass a standard peer reviewing. If you have questions about the Journal , its contents, or distribution, or if you encounter any problems, e.g. when trying to submit a paper, feel free to send an email News A new special issue on Functional Logic Programming appeared in March 2002.

94. Functional Programming functional programming. v Imperative languages. ¯ Based on von Neumanarchitecture. ¯ Efficiency is primary concern, not the suitability http://homepage.cs.uri.edu/courses/csc301sec2/_lectures/Functional_Programming/F

Functional Programming v Imperative Languages Based on von Neuman architecture Efficiency is primary concern, not the suitability of a language for software development v Functional Languages Sometime called applicative languages because the programmer Òapplies functions to parameters.Ó Based on mathematical functions Objective is to mimic mathematical functions as close as possible Mathematical Function A mapping of the members of one set (the domain set) to a second set (the range set) Closer to user, independent of hardware Based on a solid theoretical basis that is closer to the user, and relatively unconcerned with the architecture of the machines on which programs will run v Implementation Differences Imperative Implementations Results of operations are stored in ÒvariablesÓ which represent specific memory locations. Management of variables is a primary concern Programmer or system must store intermediate results Generates complexity unrelated to application or problem Can generate side-effects based on memory state Functional Implementations ÒVariablesÓ are not necessary if purely functional Referential Transparency Evaluation of a function always produces the same result given the same parameters. (no side-effects)

95. Functional Programming Languages functional programming languages. Dr. Beryl Hoffman. Reading AssignmentSethi Ch. 10. A functional programming language is based http://phoenix.marymount.edu/~bhoffman/CS210/funct.html

Functional Programming Languages Dr. Beryl Hoffman Reading Assignment: Sethi Ch. 10. A functional programming language is based on the evaluation of expressions built out of function calls that resemble pure mathematical functions. Its goal is not to mimic the underlying machine for the sake of efficiency but to strive for mathematical elegance. In a pure functional language : the value of an expression (or a function call) depends only on the values of its subexpressions (or the arguments in a function call). This means functions/expressions cannot have side-effects . They cannot change any values in other functions. This means no assignment statements, no global variables, no pointers, no call-by-reference, etc. The following function calls are always equivalent in a functional language, but not in an imperative language in which f(x) may have the side effects of changing the value of x (say if x is a global variable): f(x) + f(x) 2*f(x) Most Functional languages are not completely pure. For example, Lisp is a functional language which is not pure because it contains assignment and global variables, but it does not have pointers or call-by-reference. Functional languages usually use function calls instead of assignment whenever a new value is needed and recursion instead of loops. Functional languages support

96. ECSEL Course: Programming Languages And Systems The schedule will be determined later. Literature. Simon L. Peyton JonesTheImplementation of functional programming languages, Prentice Hall 1987. http://www.ida.liu.se/~nahsh/Ecsel-kurser/SpecStudy/SpecStudy-CompFunc.html

ECSEL Graduate Courses Compiling Functional Languages Course type Specialized study Periodicity Every 2 years. Prerequisites Basic familiarity with a modern functional language such as ML or Haskell. Some knowledge of denotational semantics, e.g. from Pteori I. (A general understanding of compiler implementation, corresponding to an undergraduate course in compiler construction, is taken for granted.) Goal The course gives a basic understanding of methods for implementing strict and lazy functional languages. Contents This course is a project course. You are required to implement a compiler for a small functional language, and to document your effort in the form of a written report. 3 to 5 credits are awarded depending on what you choose to implement. (See project requirements Two introductory lectures will be given. In addition there will be to give you some extra support. These will also provide an opportunity for the course participants to share implementation experiences with each other. Note that the format of the course is somewhat different from the description in IDA's "course catalogue" 96/97. Further Information The course is planned for Mid-Late Spring 1997. The schedule will be determined later.

97. The Foundations & Methods Group Functional Programming Between us we are interested in aspects of functional programming that range efficiencyand complexity issues in implementations of real functional languages). http://www.cs.tcd.ie/research_groups/fmg/functional_programming/

Functional Programming There is an active interest in functional programming within the FMG . Between us we are interested in aspects of functional programming that range from theoretical aspects (such as using refinement to produce programs from specifications) to knotty implementation issues (such as how to measure and quantify efficiency and complexity issues in implementations of real functional languages). The primary functional language that we work in here is Clean , although you will also find us working in languages like Haskell or SML , and between us we know more than a smattering of many of the functional languages that are in circulation (although there is some lisp and scheme knowledge in the group we don't usually consider impure languages to be functional, at least in the way that interests us). While most members of the group have some interest in functional programming the core of the functional programming sub-group is: Andrew Butterfield Hugh Gibbons Glenn Strong Richard Hayes ... Back to the FMG page Modified: "20020809:1223 IST" by Malcolm Tyrrell

98. Catalog Of Compilers: Functional Languages Expanded Its key innovation, algebraic data types and pattern matching, has sincebecome a fixture in all modern functional programming languages. http://www.idiom.com/free-compilers/ECATEGORY/function-1.html

category: functional languages Description: someone have a good one-liner? ed Language: Hope Package: Version: Parts: Author: Location: ftp://brolga.cc.uq.oz.au/pub/hope/ ftp://ftp-ala.doc.ic.ac.uk/pub/papers/R.Paterson/hope.tar.gz http://www-ala.doc.ic.ac.uk/~rap/Hope/ Description: It's a fairly old functional language, its predecessor NPL having grown out of Burstall and Darlington's work on program transformation in the late 70s. Its key innovation, algebraic data types and pattern matching, has since become a fixture in all modern functional programming languages. When it was created (around 1980) it had adopted the key innovation of the language ML (also developed at Edinburgh), namely polymorphic types, which are also now a standard feature in FPLs. In my [ rap's ed ] opinion, Hope's advantage over most other FPLs is its small size and simplicity. I think that makes it the ideal vehicle for learning functional programming. I also find it handy for prototyping various ideas, and sometimes I fiddle with the interpreter to add experimental features. References: http://santos.doc.ic.ac.uk/~rap/Hope/

99. Programming Language And Compiler Conferences programming languages; IFL Workshop on the Implementation of Functionallanguages; ILPS'97 International Logic programming Symposium; ILPS http://www.cs.cmu.edu/afs/cs.cmu.edu/user/mleone/web/language/conferences.html

Programming Language and Compiler Conferences Programming language conferences, symposia, workshops, etc. Related Pages ACM SIGPLAN Conferences and Workshops The WWW Virtual Library's list of Programming Language Conferences Logic-related conferences The Fraunhofer Institute's conference announcements in programming languages and logic DIKU's list of PL conferences Jerry Roth's list of Upcoming Compiler and Parallel Computing Conferences Dale Miller's conferences list Resources for conference and workshop organizers Conferences and Workshops AADEBUG'97 : Workshop on Automated Debugging Workshop on Automated Analysis of Software Advanced Functional Programming Techniques : First International Spring School ALP '96 : Algebraic and Logic Programming ASPLOS : Architectural Support for Programming Languages and Operating Systems BCTCS : British Colloquium for Theoretical Computer Science SBLP : Brazillian Symposium on Programming Languages CAAP : Colloquium on Trees in Algebra and Programming CADE-13 Workshop on Proof Search in Type-Theoretic Languages CC : International Conference on Compiler Construction CTCS'97 : Category Theory and Computer Science CW'97 : Workshop on Continuations DSL : Conference on Domain-Specific Languages ECOOP : European Conference on Object-Oriented Programming ELP : Workshop on Extensions of Logic Programming ESOP : European Symposium on Programming euroFORTH : European Forth Conference Euro-Par'97 Workshop on Symbolic Computation FLoC'96 : Federated Logic Conference FOOL : Workshop on Foundations of Object-Oriented Languages

100. TOC On the relation between functional and data parallel programming languagesPer Hammarlund, Björn Lisper Pages 210 219 full text, http://portal.acm.org/toc.cfm?id=165180&coll=portal&dl=ACM&type=proceeding&CFID=

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 5     81-100 of 104    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20