Geometry.Net - Basic_F: Functional Languages Programming


Home - Basic_F - Functional Languages Programming

e99.com Bookstore

Images

Newsgroups

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

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

Functional Languages Programming: more books (101)

Research Topics in Functional Programming (The UT year of programming series) by David A. Turner, 1990-06
Functional Programming and its Applications: An Advanced Course by P. Henderson, D. A. Turner, 1982-03-31
Purely Functional Data Structures by Chris Okasaki, 1999-07-01
Functional Programming: Practice and Theory by Bruce J. Maclennan, 1990-01-11
Implementation of Functional Languages: 11th International Workshop, IFL'99 Lochem, The Netherlands, September 7-10, 1999 Selected Papers (Lecture Notes in Computer Science)
The Functional Approach to Programming by Guy Cousineau, Michel Mauny, 1998-10-29
Programming Languages: Implementations, Logics and Programs: 7th International Symposium, PLILP '95, Utrecht, The Netherlands, September 20 - 22, 1995. Proceedings (Lecture Notes in Computer Science)
Implementing Functional Languages (Prentice-Hall International Series in Computer Science) by Simon L. Peyton Jones, David R. Lester, 1992-08
Implementation of Functional Languages: 14th International Workshop, IFL 2002, Madrid, Spain, September 16-18, 2002, Revised Papers (Lecture Notes in Computer Science) (Vol 2670)
Computational Semantics with Functional Programming by Jan van Eijck, Christina Unger, 2010-11-01
Programming Languages: An Active Learning Approach by Kent D. Lee, 2010-11-02
Implementation of Functional Languages: 15th International Workshop, IFL 2003, Edinburgh, UK, September 8-11, 2003. Revised Papers (Lecture Notes in Computer Science)
Implementation of Functional Languages: 13th International Workshop, IFL 2001 Stockholm, Sweden, September 24-26, 2001 Selected Papers (Lecture Notes in Computer Science)
Arrays, Functional Languages and Parallel Systems

lists with details

Re: On Functional Languages For Symbolic Programming By Robert H. Lewis
Re on functional languages for symbolic programming by Robert H.Lewis. reply to this message post a message on a new topic Back
http://mathforum.org/epigone/sci.math.symbolic/lixdruntwim/ecrqoawpo2rd@legacy
Functional Programming At The University Of Bristol
to improve support for program debugging and proof. One problem is to work out howto make best use of the purely declarative nature of functional languages.
http://www.cs.bris.ac.uk/~ian/Functional/

Extractions: Bristol CS Index The Brisk project is concerned with increasing the expressive power of functional languages so that they can be used to implement complex and reactive `systems' programs more easily. Our current aim is to develop a Haskell compiler which provides a deterministic form of concurrency, a modular approach to linking Haskell with C, dynamic linking and some other features which increase expressiveness without losing any of the mathematical purity of the language. The Brisk compiler is nearing its first serious release. We then want to investigate its applications; we have designs, and in some cases prototypes, for an X window interface, a development environment, a process manager, and a distributed programming environment. A second strand of research is to improve support for program debugging and proof. One problem is to work out how to make best use of the purely declarative nature of functional languages. A style of logic needs to be developed which takes maximum advantage of the potential simplicity of using denotational semantics alone, without resorting to operational semantics, and which provides support for purely declarative debugging and proof. This logic then needs to be packaged in a practical system which is attractive to working programmers. The Brisk compiler may also provide a platform on which to base this research. Ian Holyer ian@cs.bris.ac.uk
Functional Programming
Compiler Optimisation. Since functional programming languages are based on mathematicalconcepts, they are amenable to formal analysis and manipulation.
http://www-i2.informatik.rwth-aachen.de/Forschung/FP/

Extractions: Aachen University of Technology Dept. of CS Lehrstuhl für Informatik II Research Since functional programming languages are based on mathematical concepts, they are amenable to formal analysis and manipulation. Especially pure functional languages, i.e. those without side effects, do not have a fixed execution model. Hence the efficiency of program execution can be considerably improved by program transformations or modifications of the execution model using information gained by static analysis of programs. Our current main focus is on automatic transformations for optimising programs, especially with respect to time consumption. The goal is to build a large system for optimising functional programs, which consists of a variable number of arbitrarily combineable transformation modules. This system shall itself be implemented in a functional programming language. In order to avoid building a completely new system from scratch we decided to base our work on the Glasgow Haskell Compiler. This compiler is heavily based on the ``compilation by transformation'' paradigm and it has furthermore been designed with the goal that other people can modify and extend it - especially with new optimising transformations. Since the development of the Glasgow Haskell Compiler is a long-term project undertaken by a team, the compiler is also quite well documented. Finally, it is a widely-used compiler for a standard language. Hence we can easily test our transformations with real-world programs and the transformations may even eventually become part of the Glasgow Haskell compiler and thus find their way from theory into practical use.
Advanced Functional Programming
17 42. Exposes the advantages of functional programming languages. functionalprogramming languages and Computer Architecutre, June 1995, pages 86-95.
http://www-i2.informatik.rwth-aachen.de/Forschung/FP/Haskell/learning.html

Extractions: Abstract: This paper explores how certain ideas in object oriented languages have their correspondents in functional languages. In particular we look at the analogue of the iterators of the C++ standard template library. We also give an example of the use of constructor classes which feature in Haskell 1.3 and Gofer. Monadic I/O in Haskell 1.3 by Andrew Gordon and Kevin Hammond. Abstract: We describe the design and use of monadic I/O in Haskell 1.3, the latest revision of the lazy functional programming language Haskell. Haskell 1.3 standardises the monadic I/O mechanisms now available in many Haskell systems. The new facilities allow fairly sophisticated text-based application programs to be written portably in Haskell. The standard provides implementors with a flexible framework for extending Haskell to incorporate new language features. Apart from the use of monads, the main advances over the previous standard are: character I/O based on handles (analogous to ANSI C file pointers), an error handling mechanism, terminal interrupt handling and a POSIX interface. Apart from a tutorial description of the new facilities we include a worked example: a derived monad for combinator parsing.
CHARMING PYTHON 13 (20000155) Functional Programming In Python
http//www.cs.nott.ac.uk/~gmh//faq.html functionallanguages /a /a The authorhas found it much easier to get a grasp of functional programming via the
http://gnosis.cx/publish/programming/charming_python_13.txt
ECS EPrints Service - 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: university A-Z sotONLINE home Research ... Members Area Harrison, R. 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. Archive Staff Only: edit this record EPrints Home Browse EPrints Search EPrints ... home
ECS EPrints Service - 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/

Extractions: university A-Z sotONLINE home Research ... Members Area Harrison, R. Parallel programming with pure functional languages . In Proceedings of Research directions in high-level parallel programming languages , pages , Eds. Full text of this item is not available. Archive Staff Only: edit this record EPrints Home Browse EPrints Search EPrints ... home
BYTE.com
Beyond Lisp, some new functional programming languages are starting toemerge after the ongoing research of the eighties. Dick Pountain
http://www.byte.com/art/9408/sec11/art1.htm

Extractions: Text only August 1994 Core Technologies / Functional Programming Comes of Age Dick Pountain The idea of functional programmingnamely, that mathematical specifications should be executed directly as computer programshas been around since the dawn of modern computing. Lisp, the grandparent of functional languages, emerged soon after FORTRAN made its debut in the mid-1950s; in fact, FORTRAN pioneer John Backus devoted most of his subsequent career to studying functional programming systems. What's kept FPLs (functional programming languages) out of the mainstream thus far has always been their desperately slow performance and memory greed when compared to imperative languages such as Pascal and C. Only now, following a decade of crucial research breakthroughs, are we seeing the arrival of industrial-strength FPLs that can compete with C in both time and space efficiency. What is it about FPLs that makes people persevere in this El Dorado quest? In a word, provability. Pure functional programs possess the mathematical property of referential transparency, which roughly means that the same expression always represents the same value. This transparency enables you to reason about program execution, and hence to mathematically prove a program's correctness. The possibility of writing provably correct programs (rather than spending your time picking out bugs) could revolutionize the economics of software production.
Programming Language - Wikipedia, The Free Encyclopedia
the type system of the programming language; the design can be further subdividedinto languages with manifest where each variable and function declaration has
http://en.wikipedia.org/wiki/Programming_language

Extractions: User:K.lee/Programming_language_rewrite has been proposed. Please council it when you plan to rewrite the article entirely. A programming language or computer language is a standardized communication technique for expressing instructions to a computer . It is a set of syntactic and semantic rules used to define computer programs . A language enables a programmer to precisely specify what data a computer will act upon, how these data will be stored/transmitted, and precisely what actions to take under various circumstances. Table of contents 1 Introduction edit A primary purpose of programming languages is to enable programmers to express their intent for a computation more easily than they could with a lower-level language or machine code . For this reason, programming languages are generally designed to use a higher-level syntax, which can be easily communicated and understood by human programmers. Programming languages are important tools for helping software engineers write better programs faster. Understanding programming languages is crucial for those engaged in computer science because today, all types of computation are done with computer languages.
Functional Programming Using Caml Light
functional programming using Caml Light. This text is an introduction to functionalprogramming in general and the Caml Light language in particular.
http://caml.inria.fr/tutorial/

Extractions: 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 3) Basic concepts 4) Basic types 5) Lists 6) User-defined types 8) Escaping from computations: exceptions 8.1) Exceptions
Why Functional Programming Matters
programs). Since modularity is the key to successful programming, functionallanguages are vitally important to the real world. The
http://www.md.chalmers.se/~rjmh/Papers/whyfp.html

Extractions: This paper dates from 1984, and circulated as a Chalmers memo for many years. Slightly revised versions appeared in 1989 and 1990 in the Computer Journal and the Year of Programming. This version is based on the original Chalmers memo nroff source, lightly edited for LaTeX and to bring it closer to the published versions. Please excuse the slightly old-fashioned type-setting, and the fact that the examples are not in Haskell! As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can be re-used to reduce future programming costs. Conventional languages place conceptual limits on the way problems can be modularised. Functional languages push those limits back. In this paper we show that two features of functional languages in particular, higher-order functions and lazy evaluation, can contribute greatly to modularity. As examples, we manipulate lists and trees, program several numerical algorithms, and implement the alpha-beta heuristic (an algorithm from Artificial Intelligence used in game-playing programs). Since modularity is the key to successful programming, functional languages are vitally important to the real world. The paper is available as postscript and pdf , and here is a bibtex entry. There is even a
The Miranda Programming Language
and looping are not even provided within the language, and therefore all programshave to 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:
SS > Factoids > Programming Languages
Lisp correctly, you can grok all programming styles with it Recursion will be yourfriend, function references your is to create a custom language, solve the
http://www-users.cs.york.ac.uk/~susan/cyc/p/prog.htm

Extractions: home factoids A B C D ... Z For those who think the world begins and end with C++, or with Java, here is a very incomplete list of programming languages: just the ones I've heard of, or been told about (not including assembly languages, or special purpose 'little languages' like yacc or nroff Ada the language was commissioned by the US Department of Defense in the 1980s as the language to be used for all its software. Descended from Pascal , with support for structuring via the package The PL/I of the 1980s.
Functional Programming
basic values. A functionalprogrammingLanguage is a language that supportsand encourages programming in a functional style. See also
http://c2.com/cgi/wiki?FunctionalProgramming
Functional Language Programming
functional Language programming. Course Outline Computer Jargon DictionaryFrequently Asked Questions (FAQ) Archive Smithsonian Computer
http://www.cs.trinity.edu/About/The_Courses/cs316/
Wouter's Programming Language Page
PIG (oct 2000) PIG is an antifunctional programming language , an experimentto see how far one can get in a language which only has global state (in the
http://wouter.fov120.com/proglang/

Extractions: This page basically gives a historical overview of all the programming languages I have designed (and sometimes implemented) over the years. Some of them, notably E False Bla Aardappel and SHEEP have their own pages. (REVERSE chronological) CryScript (aka DOG) (nov 2002) Wortel (sept 2002) Unifies coroutines, functions and classes into a single small construct. NVNSRRML (feb 2002) "Non Verbose Non Semantically Redundant Readable Markup Language", i.e. the antithesis to XML. Also featuring ENVNSRRML (Executable NVNSRRML), a macro / document processing / transformation / programming language. MOLE (dec 2001) COW (june 2001) COW is another "environment" language like Bla, but is much more radical in unifying all possible programming language constructs into one (the environment). Extremely tiny language definition covers classes, objects, modules, functions/methods function-environments, scopes, (recursive) lambda's, tuples, lists, arrays, monitors, futures, bags etc. etc. ] (dec 2000) An investigation into the interactions between linearity and lazyness, and possible optimisations.
Functional Programming From FOLDOC
Free Online Dictionary of Computing. functional programming. programming (FP)A program in a functional language consists of a set of (possibly recursive
http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?functional programming
Functional Language From FOLDOC
database « functional dependency « functionality « functional language » functionalprogram » functional programming » functional programming language.
http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?functional language
Embedded.com - Changing Networks Need Functional Languages
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
GIML: Introduction To Functional Programming
A functional language like ML offers all of the features that we havecome to expect from a modern programming language. Objects
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 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

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