Geometry.Net - Basic_F: Functional Languages Programming

Parallel Programming Using Functional Languages - Roe (ResearchIndex)
1995 8 Parallel Implementations of functional programming languages(context) Jones - 1989 BibTeX entry (Update) Paul Roe.
http://citeseer.nj.nec.com/roe91parallel.html

Extractions: Abstract: simulation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 213 8.6 Debugging : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 227 8.7 Summary : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 234 8.8 Conclusions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 235 9 Further work 237 9.1 Expressing parallelism and parallel algorithms : : : : : : : : : : : : : : : : : : : : 237 9.2... (Update)
PLI 2002: ICFP
The 2002 International Conference on functional programming covers the entire spectrum of functional programming, from practice to theory, and from established functional programming languages (Scheme, ML, Haskell) to novel language designs and to the functional aspects of objectoriented or concurrent languages. October 4-6, 2002 Pittsburgh, PA, USA.
http://icfp2002.cs.brown.edu/

Extractions: Affiliated with PLI 2002 The ICFP conference provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of functional programming, from practice to theory, and from established functional programming languages (Scheme, ML, Haskell) to novel language designs and to the functional aspects of object-oriented or concurrent languages. Related Events PPDP GPCE (GCSE/SAIG) Workshops What are the Accepted Papers? Please see the separate page What about Hotel and Registration Information? You will find that on the PLI home page Was There a Programming Contest? Yes! The contest ran from 12:00 Noon Pacific Standard Time on Friday August 30, 2002, until 12:00 Noon Monday September 2, 2002. The contest has its own Web page What Kind of Material Appears in ICFP? The call for papers provides information on the kinds of papers sought by the conference.
Benchmarking Implementations Of Functional Languages With "Pseudoknot", A Float-
In Proceedings of the Conference on functional programming languages and ComputerArchitecture, June 1993, pages 341349. ACM Press, New York, NY, 1993.
http://citeseer.nj.nec.com/4555.html

Extractions: Abstract: Over 25 implementations of different functional languages are benchmarked using the same program, a floatingpoint intensive application taken from molecular biology. The principal aspects studied are compile time and 1 Dept. of Computer Systems, Univ. of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands, e-mail: pieter@fwi.uva.nl 2 D'epart. d'informatique et r.o., Univ. de Montr'eal, succursale centre-ville, Montr'eal H3C 3J7, Canada, e-mail: feeley@iro.umontreal.ca 3 Informatik,... (Update)
Functional Programming Languages
7. functional programming languages. 7.1. 7.7. Other functional languages. FP wasone of the earliest functional programming languages, created by John Backus.
http://cbbrowne.com/info/functional.html

Extractions: From the comp.lang.functional FAQ comes the following: "Functional programming is a style of programming that emphasizes the evaluation of expressions, rather than execution of commands. The expressions in these language are formed by using functions to combine basic values. A functional language is a language that supports and encourages programming in a functional style. " In an imperative language, one might describe an algorithm for adding values together to get a sum thus:
GIML: Introduction To Functional Programming
Why functional programming. functional languages such as ML, Hope and Lisp allowus to develop programs which will submit logical analysis relatively easily.
http://www.dcs.napier.ac.uk/course-notes/sml/introfp.htm

Extractions: The functional language community is excessively dour. The functional ascetics forbid themselves facilities which less pious programmers regard as standard . When using functional languages we do away with notions such as variables and reassignments. This allows us to define programs which may be subjected to analysis much more easily. When a value is assigned it does not change during the execution of the program. This property is referential transparency. There is no state corresponding to the global variables of a traditional language or the instances of objects in an object oriented language. When a definition is made it sticks. Reassignment does not take place. Getting used to this and finding alternatives the traditional structures such as loops which require reassignment is one of the hardest tasks for a programmer "converting" from a traditional language. The line x := x+1; may appear in a 3rd generation language and is understood to indicate that 'box' or 'location' referred to as 'x' has its contents incremented at this stage. We do not admit such concepts. 'x' is 'x' and 'x+1' is one more than x; the one may not be changed into the other. A program without a state is a simpler thing - it is easier to write the code and easier to reason about the code once written. It is harder to write poor code. Functional languages are considered, by their devotees, to be higher level than third generation languages. Functional languages are regarded as declarative rather than imperative. Ordinary third generation languages such as Pascal, C (including flavours such as C++) and assembly instruct the computer on how to solve a problem. A declarative language is one which the programmer declares what the problem is; the execution of the program is a low level concern. This is an attitude shared with the logic language community (Prolog people).
A BRIEF SURVEY OF FUNCTIONAL PROGRAMMING LANGUAGES
A Brief Survey of functional programming languages. Disclaimer we make no claimswhatever that this page is complete or even correct in all regards.
http://www.idt.mdh.se/kurser/cd5100/ht02/history.html

Extractions: Latest update August 13, 2002 To avoid spam, all mail addresses on this page have the ""@ replaced by "#". : we make no claims whatever that this page is complete or even correct in all regards. It is simply a compilation of notes, links, and other information that I have gathered, for the purpose of providing my functional programming students with some historical context. Please mail reports on any bugs you find! Functional programming draws heavily from the Lambda Calculus. The Lambda Calculus is really a branch of logic, developed in the 20's and 30's. It was developed by logicians who wanted to explore how to define functions formally and how to use this formalism as a foundation for mathematics. The Lambda Calculus is an extremely simple formal language of functions. It is surprisingly powerful - much of mathematics can be defined in it! The first developments were by Schönfinkel (1924), and Curry (1930): they defined a variation called combinatory logic. Church (1932/1933) then defined the first version of the actual Lambda Calculus. These early logicians had no intention to define any programming languages. (There weren't even any computers then!) Much later, functional programming was invented. McCarthy defined the first versions of LISP around 1960. This is the first "real" functional programming language. See McCarthy's own
Advanced Functional Languages
to know some functional programming beforehand. Similarly, it is an advantage butnot required to have knowledge of formal semantics for programming languages.
http://www.idt.mdh.se/phd/courses/haskell/

Extractions: Latest update Sep 7, 2000 Fall 2000 (and onwards) Advanced Functional Languages is a 5 cu Ph.D. level course at the Dept. of Computer Engineering (IDt) Mälardalen University . The course leader is Björn Lisper , e-mail bjorn.lisper@mdh.se , phone 021-151709. The topic of this course is, more concretely, Haskell . This is a purely functional language with such features as higher order functions, lazy evaluation, an advanced type system, and features to include state and explicit sequencing without violating the pure functional semantics. Why do I bother to give a course on this topic? One reason is that languages in this class are powerful programming tools for applications which include symbolic computing and require elaborate, dynamic data structures: examples are compilers and program analysis tools. Another reason is that functional programs expose all the inherent parallelism in the implemented algorithm: thus, they are good for specifying computational tasks which may be implemented with a certain degree of parallelism. A third reason is their modeling capability : due to their level of abstraction, functional programs could be seen not only as pieces of software but also as specifications of other kinds of systems, like hardware systems on different level of abstraction, or co-designed hardware/software systems. Finally, they typically have a
Embedded.com - Changing Networks Need Functional Languages
Article at Embedded.com.Category Computers programming Erlang Articles News and Media It's favored by educational professionals who teach the fundamentals of programmingusing functional languages such as Caml, Scheme, Opal, and Haskell.
http://www.embedded.com/story/OEG20011130S0065

Extractions: The continuing perturbations in the net-centric computing environment are evident in the nature of the programming decisions that face developers, who are still sorting out the complexities and opportunities that new languages such as Java and C-sharp have introduced. However, more programming decisions have yet to be made. My feeling when I wrote
The Miranda Programming Language
Overview of the language, areas of application and some sample programs.Category Computers programming languages Miranda Purely functional Pure functional languages perform all computation using function haveto strictly adhere to the functional approach of programming.
http://www.engin.umd.umich.edu/CIS/course.des/cis400/miranda/miranda.html

Extractions: TM Click below to go directly to a specific section: History Significant Language Features Areas of Application Sample Programs ... Acknowledgments Miranda was developed in 1985-86 by David Turner, and is now currently being marketed by Research Software Ltd. of England. Miranda was the successor of the functional languages SASL and KRC. With Miranda, the main goal was to produce a commercial version of a standard non-strict purely functional language. To make Miranda commercially viable, the development environment had to be made very flexible and easy-to-use. Miranda, A Non-Strict Purely Functional Language Non-Strict: In Non-Strict functional languages, the arguments to a function are not evaluated until they are actually required within the functions being called. Therefore, any parameter can be passed to a function and until it is needed in that function, this parameter is not evaluated. This is also known as lazy evaluation, and the main advantage of using this method is that it allows for passing infinite element data structures to a function. Purely Functional:
Linux Center: Functional Languages (LISP, Scheme, ML...)
Main Index Development programming languages functional languages(LISP, Scheme, ML ) 76 % Alegro Common LISP Commercial
http://www.portalux.com/development/languages/functional/

Extractions: More info, add feedback (0 comments so far) - Rate it: good average bad DrScheme : DrScheme is a graphical development environment for Scheme. DrScheme's features include: Source text highlighting of syntax errors. Source text highlighting of run-time errors. Support for multiple levels of Scheme from ``beginner'' to ``advanced''. Interactive and graphical static analysis. An object system. A toolbox of simple drawing commands suitable for simple drawing. An advanced graphical user interface (GUI) library.
Mathematical Programming With Functional Languages
functional programming languages such as Haskell allow numerical algorithms to beexpressed in a concise, machineindependent manner that closely reflects the
http://www.oslo.sintef.no/SciTools96/Contrib/angus/
ECS EPrints Database - Parallel Programming With Pure Functional Languages
Parallel programming with pure functional languages. Harrison, R.(1991) Parallel programming with pure functional languages. In
http://eprints.ecs.soton.ac.uk/archive/00003170/
ECS EPrints Database - Object-oriented Programming With Functional Languages
Objectoriented programming with functional languages. Harrison, R. (1993) Object-orientedprogramming with functional languages. Technical Report, Dept.
http://eprints.ecs.soton.ac.uk/archive/00003196/

Extractions: Electronics and Computer Science EPrints Service ECS Home EPrints Home Browse EPrints Search EPrints ... Help Harrison, R. (1993) Object-oriented programming with functional languages. Technical Report, Dept. of Electr. and Comp. Sci, Univ. of Southampton, UK. Full text of this item is not available. Authors: R. Harrison
ICFP Programming Contest
The webpage for the 1999 ICFP functional programming Contest.Category Computers programming Contests programs? Perhaps it's just the case that functional programming languagesattract better programmers than other languages and
http://www.cs.virginia.edu/~jks6b/icfp/

Extractions: The contest is over, and the Judges have posted final results Final results will be made public at the awards presentations , at ICFP on Tuesday, September 28, at 12:14 PM local (French) time, and not before . The results will be posted to the web site sometime thereafter. Convinced your favorite functional programming language provides unbeatable productivity? Do functional languages lead to better and faster programs? Perhaps it's just the case that functional programming languages attract better programmers than other languages... and you and your friends are the best of the best. If so, we've provided you the opportunity to prove it! We are pleased to announce the 1999 ICFP Programming Contest to be held in conjunction with ICFP'99 . All programmers are invited to enter the contest, either individually or in teams; we especially encourage students to enter. We've designed the programming contest for direct, head-to-head comparison of language technology and programming skill. We have a range of prizes for the winners: cash awards, famous texts on functional languages donated and autographed by the authors, and, of course, unlimited bragging rights.
CSE502 Functional Programming
functional programming languages are known for their increased productivity andreliability, due in part to the higher levels of abstraction provided by
http://www.cse.ogi.edu/courses/CSE502/

Extractions: 2001-2002 academic year Distance Learning ... Online registration 3 credits Functional languages are probably the most expressive programming languages that exist, yet they have a clean mathematical foundation. This means they may be used either as powerful programming languages in their own right (for rapid prototyping or scripting, for example), or as a means for exploring the fundamentals of more complex concepts in other languages (such as visitor patterns, function pointers, exceptions, and so on). If you have not been exposed to functional languages before, this course will radically change the way you think about programs. Description
Launchbury: Functional Programming
Lazy functional State Threads. John Launchbury and Simon Peyton Jones, ProcACM programming languages Design and Implementation, Orlando, 1994.
http://www.cse.ogi.edu/~jl/biblio-functional.html

Extractions: John Launchbury and Amr Sabry, Submitted to ICFP 97. Type safety of imperative programs is an area fraught with difficulty and requiring great care. The ML solution to the problem, originally involving imperative type variables, has recently been simplified to the syntactic-value restriction. In Haskell, the problem is addressed in a rather different way using explicit monadic state. We present an operational semantics for state in Haskell and the first full proof of type safety. We demonstrate that the semantic notion of value provided by the explicit monadic types is sufficient to avoid any problems with generalization. John Launchbury and Ross Paterson, Proc European Symposium on Programming, Linkoping, 1996. In lazy functional languages, bottom is typically an element of every type. While such "pointedness" provides great flexibility, it also comes at a cost. In this paper we explore the consequences of allowing unpointed types in a lazy functional language like Haskell. We use the type (and class) system to keep track of pointedness (and hence recursion also), and show the consequences for parametricity and for controlling evaluation order and unboxing. John Launchbury and Tim Sheard, Proc ACM Functional Programming and Computer Architecture, 1995.
Functional Programming From FOLDOC
functional programming. programming (FP) A program in a functional language consistsof a set of functional languages are one kind of declarative language.
http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?functional programming
Comparative Programming Languages
languages; Systems programming languages; Modules, classes and abstractdata types; functional and logic languages; Conclusions. Types
http://www.cs.stir.ac.uk/~rgc/cpl/

Extractions: Information ( USA Europe, Middle East, Africa ) from Addison Wesley Longman and Pearson Education is available. This page is being developed incrementally. So, do return to see what additions have been made. There are links to supplementary information from the Table of Contents This book considers the principal programming language concepts and how they are dealt with in object-oriented languages such as Java and Delphi, in traditional procedural languages such as Pascal, C and Fortran, in hybrid object-oriented or object-based languages such as C++ and Ada 95, in functional languages such as ML and in logic languages like Prolog. The approach is to find common ground between languages and to identify the underlying principles. Although the top-level organisation of a program written in an object-oriented language is different from that of one written in a procedural language, their underlying principles are the same. Similarly, although the approach of logic languages and functional languages is different from that of procedural and object-oriented languages, there are many areas of similarity, and seeing these helps us to understand the differences better. There have been major developments in programming languages and their use since the second edition was published in 1993 and the changes in the new edition reflect this. Although object orientation was a major paradigm in 1993, object-oriented languages had not achieved the central position that they enjoy today. Secondly, features to support Graphical User Interfaces (GUIs) have only recently become an integral part of language design. This has meant that topics such as event-driven programming have moved from being advanced to being taught in introductory courses.
York Functional Programming Group
functional programming research group at Yale University.Category Computers programming languages functional Research Applying functional languages to real programming tasks. Apart from theFLARE project, we have also looked at extensions and generalisations
http://www.cs.york.ac.uk/fp/

Extractions: F UNCTIONAL P ROGRAMMING R ESEARCH G ROUP The Functional Programming (FP) research group in the Department of Computer Science at the University of York , UK, is small but well established. We are interested in a wide range of topics in FP but specialise in software technology. Projects already undertaken range from formal reasoning about programs, through novel implementation methods, profiling and tracing tools, to application studies and experiments with variants of functional programming for relational, embedded, and interactive computing. The FP group is also a part of the more broadly-based Programming Languages and Systems research group at York. Among our current and past interests are: Reducing the amount of memory functional programs require. This includes profiling mechanisms, compiler technology for heap and code compression, and garbage collection techniques. Applying functional languages to real programming tasks. Apart from the
Extensions And Generalisations Of Functional Programming
The two most successful types of declarative programming languageto date are functional and logic programming languages. In many
http://www.cs.york.ac.uk/fp/extend.html

Extractions: Few functional languages allow the expression of solutions to embedded control problems. We have an experimental system for programming embedded applications, using a process extension of the functional language Gofer. A variant of the Embedded Gofer system supports another current investigation: the use of functional languages to program graphical interaction. There is plenty of scope for future research into extensions of functional languages to include parallel processes. Functional languages and graphical user interfaces - a review , Rob Noble and Colin Runciman, Tech Report YCS 223, 1994.

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

41-60 of 104 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20