81. 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

Re: on functional languages for symbolic programming by Robert H. Lewis reply to this message post a message on a new topic Back to messages on this topic Back to sci.math.symbolic Subject: Re: on functional languages for symbolic programming Author: rlewis@fordham.edu Date: The Math Forum

82. 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/

Bristol CS Index Functional Programming Research 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. Staff and Research students Ian Holyer ian@cs.bris.ac.uk

83. 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/

Aachen University of Technology Dept. of CS Lehrstuhl für Informatik II Research Functional Programming Contents Objectives Working Group: Implementation of Functional Languages Present Results Links to Functional Programming ... Type Theory Objectives Compiler Optimisation 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.

84. 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

Aachen Univ. of Technology Dept. of CS Research FP ... Haskell Learning Haskell and Advanced Functional Programming Motivation for Using Haskell Why Functional Programming Matters by John Hughes , The Computer Journal, Vol. 32, No. 2, 1989, pp. 98 - 107. Also in: David A. Turner (ed.): Research Topics in Functional Programming, Addison-Wesley, 1990, pp. 17 - 42. Exposes the advantages of functional programming languages. Demonstrates how higher-order functions and lazy evaluation enable new forms of modularization of programs. Higher-order + Polymorphic = Reusable by Simon Thompson . Unpublished, May 1997. 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. Using Monads 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.

85. 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

if : break else: if : return 1 else: return while_FP = lambda: (

86. 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/

university A-Z sotONLINE home Research ... Members Area Object-oriented programming with functional languages 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. EPrint Type Technical Report Research Group Declarative Systems and Software Engineering Research Group Deposited On 03 May 2000 by Gutteridge, Christopher ID Code Old DB key Performance Indicator EZ~01~01~06 Authors R. Harrison Archive Staff Only: edit this record EPrints Home Browse EPrints Search EPrints ... home

87. 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/

university A-Z sotONLINE home Research ... Members Area Parallel programming with pure functional languages 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. EPrint Type Conference or Workshop Item Research Group Declarative Systems and Software Engineering Research Group Deposited On 03 May 2000 by Gutteridge, Christopher ID Code Old DB key Performance Indicator EZ~01~01~04 Authors R. Harrison Editors Archive Staff Only: edit this record EPrints Home Browse EPrints Search EPrints ... home

88. 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

Search BYTE.com Write to Byte Editorial Calendar Categories Previous Editions Columns Features Print Archives About Us Byte Editorial Staff Advertise with Byte Privacy Policy Free E-mail Newsletter from BYTE.com Byte.com Update Text only Functional Programming Comes of Age August 1994 Core Technologies / Functional Programming Comes of Age Beyond Lisp, some new functional programming languages are starting to emerge after the ongoing research of the eighties 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.

89. 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

Programming language From Wikipedia, the free encyclopedia. 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 2 Features of a programming language 2.1 Data and data structures 2.2 Instruction and control flow ... edit Introduction 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.

90. 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/

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

91. 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

Why Functional Programming Matters John Hughes 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! Abstract 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

92. 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

TM The Miranda Programming Language Click below to go directly to a specific section: History Significant Language Features Areas of Application Sample Programs ... Acknowledgments History 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. Significant Language Features 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: Pure functional languages perform all computation using function application. "Side-effect" features such as destructive assignments and looping are not even provided within the language, and therefore all programs have to strictly adhere to the functional approach of programming.

93. 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

home factoids programming languages 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 The Language List is much more comprehensive, with over 2000 entries! The Jargon File is a great source for computing terms. Remember, no matter which language you choose, you can always Shoot Yourself In The Foot . It's just so much easier in some than in others. And, of course, Real Programmers Don't Use PASCAL Ada after Ada, Countess Lovelace , a friend of Charles Babbage , and claimed by some to be the first computer programmer. 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.

94. 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

95. 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/

Functional Language Programming Course Outline Computer Jargon Dictionary Frequently Asked Questions (FAQ) Archive Smithsonian Computer History ... Computers and Mathematical Notation by Kenneth E. Iverson Math for the Layman by Kenneth E. Iverson The J Vocabulary Class newsgroup tu.csci2322 Terminal Session on this Machine Gambit Scheme Manual SCM Documentation SCM Manual GUILE Information SLIB Manual Hobbit Documentation. Revised^4 Report on the Algorithmic Language Scheme Imagine Laboratory Problem 1 Laboratory Problem 2 ... Comments or Suggestions

96. 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/

Programming Language Design and Implementation 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.

97. 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

98. 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

99. 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

Select Site Below Commsdesign My-ESM (EBN) EEdesign eeProductCenter EETimes Embedded Planet Analog Silicon Strategies Google Search 8-bit MCUs feature low power consumption and small footprint Designed for everyday consumer applications, the Philips LPC900 family of microcontrollers boasts two analog to digital converters. MATLAB 7 extends scope of technical computing New version offers built-in support for integer and single-precision floating-point math, as well as language features for managing and analyzing larger data sets. More Product News SpiceVision ported to 64-bit platforms Concept Engineering has enhanced its SpiceVision PRO circuit analysis tool to run on 64-bit platforms. Velocity to expand European network Focus EDL has been appointed to be the exclusive UK representative and distributor for Velocity Semiconductor's 32-bit, network-enabled MCU. More News From Europe A list of upcoming NetSeminars, plus a link to the archive Accurate High-speed SONET/SDH Jitter Measurement Simulating and Modeling A/D Converters to Simplify System Design ST7MC family from ST: Optimized MCUs for Brushless DC and AC Induction Motors ... Agilent eSeminar- Innovative Signal Analysis Techniques to Maximize System Performance June 23/04 11AM PT EE TIMES NETWORK Online Editions EE TIMES EE TIMES ASIA EE TIMES CHINA EE TIMES FRANCE ... EE TIMES UK Web Sites Career Center CommsDesign Microwave Engineering ... Deepchip.com

100. 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

GIML: Introduction to Functional Programming The functional language community 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

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