Geometry.Net - Basic_F: Functional Languages Programming

Zhenyu Qian
Universit¤t Bremen Java security, extensions, and semantics; object-oriented, functional, concurrent, logic programming languages; specification languages; compiler construction; program specification, construction and transformation; object-oriented analyis and design; types; lambda-calculus; unification; algebraic semantics; and theorem proving systems.
http://www.informatik.uni-bremen.de/~qian/qian.html
Why Functional Programming Matters
John Hughes paper, dates from 1984, circulated as a Chalmers memo.Category Computers programming languages functional programs). Since modularity is the key to successful programming, functionallanguages are vitally important to the real world. The
http://www.math.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
On Lisp
By Paul Graham (1994) is a comprehensive study of advanced Lisp techniques, with bottomup programming as the unifying theme. It gives the first complete description of macros and macro applications. The book also covers important subjects related to bottom-up programming, including functional programming, rapid prototyping, interactive development, and embedded languages.Download as PDF.
http://www.paulgraham.com/onlisp.html

Extractions: On Lisp is a comprehensive study of advanced Lisp techniques, with bottom-up programming as the unifying theme. It gives the first complete description of macros and macro applications. The book also covers important subjects related to bottom-up programming, including functional programming, rapid prototyping, interactive development, and embedded languages. The final chapter takes a deeper look at object-oriented programming than previous Lisp books, showing the step-by-step construction of a working model of the Common Lisp Object System (CLOS). On Lisp draws the reader in from the very first sentence. The author's writing style is clear and articulate, but comfortably informal. The subject matter is important, and has not been adequately treated in previous books. The chapters on macros present important material that is virtually unique to this book.
Journal Of Functional Programming -- 1996
Empirical and analytic study of stack versus heap cost for languages with closures Journal of functional programming , 6(1)47-74, January 1996.
http://www.dcs.gla.ac.uk/jfp/bibliography/jfp96.html

Extractions: R. Bird O. De Moor , and P. Hoogendijk . Generic functional programming with types and relations - Journal of Functional Programming , 6(1):1-28, January 1996. Abstract, References, and Citations. BibTeX entry Pieter H. Hartel and Hugh Glaser . The resource constrained shortest path problem implemented in a lazy functional language - Journal of Functional Programming , 6(1):29-45, January 1996. Abstract. BibTeX entry Andrew W. Appel and Zhong Shao . Empirical and analytic study of stack versus heap cost for languages with closures - Journal of Functional Programming , 6(1):47-74, January 1996. Abstract, References, and Citations. BibTeX entry Geoffrey Burn and Daniel Le Metayer . Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis - Journal of Functional Programming , 6(1):75-109, January 1996. Abstract, References, and Citations. BibTeX entry John Greiner . Weak polymorphism can be sound - Journal of Functional Programming , 6(1):111-141, January 1996.
Department Of Computer Science
Department of Computer Science. Areas of research include deduction, knowledge representation, integration of functional and logic programming languages, software construction, distributed systems, knowledgebased systems, logic and complexity theory.
http://www.informatik.rwth-aachen.de/index.eng.html
Journal Of Functional Programming -- 1991
Ian Mason and Carolyn Talcott. Equivalence in functional languages with effects.Journal of functional programming , 1(3)287327, July 1991. Citations.
http://www.dcs.gla.ac.uk/jfp/bibliography/jfp91.html
School Of Computing Science At SFU
School of Computing Science. Research labs focus on algorithms and optimization, systems science, computational epidemiology, computer vision, database systems, graphics and multimedia, hardware design, software agents, intelligent software and systems, knowledge representation, logic and functional programming, medical computing, natural language processing, parallel and distributed computing, mathematical sciences, programming languages, simulating and exploring ecosystem dynamics, and distance learning.
http://www.cs.sfu.ca/
Programming Languages And Systems
a collection of links relating to FPCategory Computers programming languages functional Goffin Distributed Haskell, Parallel and Distributed programming in Haskell; NepalNested Data Parallel languages. DSP functional DSP (A personal project, _
http://compiler.kaist.ac.kr/~khchoi/fp.html

Extractions: Functional Programming Group Amsterdam Univ. Cambridge Univ. (Computer Lab) Carnegie Mellon Univ. Chalmers Univ. ... Lande at IRISA Kent Univ. at Canterbury Kyuto Univ. Manchester Computer Science ... Nottingham Univ. : Languages and Programming Oxford PRG Hardware Compilation Group Algebra of Programming ... Logic and Foundations of Programming at QMW Rice Univ. : The Programming Language Team St Andrews Univ. Stanford Univ. : Theory Computer Systems Lab Stanford Research Institute Suny Stony Brook ... Microsoft Research
Computer Science
Department of Computer Science. Research areas include computer networks and communications, computer vision, distributed systems, logic and knowledge representation, numerical analysis and numerical linear algebra, parallel and functional programming, persistent object systems, and programming languages.
http://www.cs.adelaide.edu.au/

Extractions: Computer Science provides an understanding of how software combined with hardware can be used to overcome an astonishing range of challenges. Information For Students Staff Information About Research Staff Ph.D. Research Training Seminar Programme ... Computing Facilities Department of Computer Science
Resources For Programming Language Research
A collection of information and resources for research in programming language theory, design, implementa Category Computers programming Compilers Theory Other Related Pages. functional languages FAQ; The European Associationfor programming languages and Systems; The Compiler Connection
http://www.cs.cmu.edu/afs/cs.cmu.edu/user/mleone/web/language-research.html
A Curry-Howard Foundation For Functional Computation With Control - Ong, Stewart
Article by C.H. L. Ong and C. A. Stewart which presents a call-by-name variant of Parigot's lambda-mu calculus. The calculus is proposed as a foundation for first-class continuations and statically scoped exceptions in functional programming languages.
http://citeseer.nj.nec.com/ong97curryhoward.html

Extractions: Abstract: We introduce the type theory ¯ v , a call-by-value variant of Parigot's ¯-calculus, as a Curry-Howard representation theory of classical propositional proofs. The associated rewrite system is Church-Rosser and strongly normalizing, and definitional equality of the type theory is consistent, compatible with cut, congruent and decidable. The attendant call-by-value programming language ¯pcf v is obtained from ¯ v by augmenting it by basic arithmetic, conditionals and fixpoints. We study the... (Update)
Brandeis University CS Web Pages
Particular research projects study topics in combinatorics, case based reasoning, computational linguistics, coding theory and data compression, connectionism and neural networks, constraint programming languages, distributed object storage systems, functional programming, logic programming, massively parallel computation, networking, robotics, type theory and constructive logic.
http://www.cs.brandeis.edu/
Results
TsungMin Kuo , Prateek Mishra Proceedings of the fourth international conferenceon functional programming languages and computer architecture November 1990, 77
http://portal.acm.org/results.cfm?query=Applicative (functional) languages
Wolfgang Schreiner
Johannes Kepler University Parallel and distributed computing, generic programming, semantics of programming languages, parallel functional languages, symbolic and algebraic computation.
http://www.risc.uni-linz.ac.at/people/schreine/

Extractions: Symbolic Programming at RISC-Linz ... Brokering Distributed Mathematical Services The goal of this project is the development of a framework for brokering mathematical services that are distributed among networked servers. The foundation of this framework is a language for describing the mathematical problems solved by the services. Distributed Maple Distributed Maple is a system for writing parallel programs in the computer algebra system Maple based on a communication and scheduling mechanism implemented in Java. Integrating Temporal Specifications as Runtime Assertions into Parallel Debugging Tools This project pursues the integration of formal methods with tools for the debugging of parallel message passing programs. The idea is to generate from temporal logic specifications executable assertions that can be checked in the various states of parallel program execution. Distributed Constraint Solving for Functional Logic Programming I am the technical leader of a research project on the development of a distributed constraint solving system based on a functional logic language.
Alpuente
Technical University of Valencia, Spain Logic programming semantics, extensions and applications integration of functional and logic programming languages, abstract interpretation, program manipulation.
http://www.dsic.upv.es/users/elp/alpuente.html
Functional Logic Programming
Michael Hanus's pages on amalgamating functional and logic programming.Category Computers programming Logicbased functional Logic programming paradigms, namely functional programming and logic programming. In comparisonwith pure functional languages, functional logic languages have more
http://www.informatik.uni-kiel.de/~mh/FLP/

Extractions: Functional Logic Programming Functional logic programming aims to amalgamate the most important declarative programming paradigms, namely functional programming and logic programming . In comparison with pure functional languages, functional logic languages have more expressive power due to the availability of features like function inversion, partial data structures, existential variables, and non-deterministic search. In comparison with pure logic languages, functional logic languages have a more efficient operational behavior since functions provide for more efficient evaluation strategies (lazy evaluation, deterministic reductions) than predicates. Early research in this area has been concentrated on the definition and improvement of appropriate execution principles for functional logic languages. In recent years efficient implementations of these execution principles have been developed. You can look into a survey of this area. Languages, Implementations
Escher
Declarative, generalpurpose language, merges best features of functional and logic languages. Has types and modules, higher-order and meta-programming facilities, declarative input/output. Set of system modules provides many operations on standard data types integers, lists, characters, strings, sets, programs.
http://www.cs.bris.ac.uk/~jwl/escher.html

Extractions: Bristol CS Index Research Escher is a declarative, general-purpose programming language that integrates the best features of both functional and logic programming languages. It has types and modules, higher-order and meta-programming facilities, concurrency, and declarative input/output. Escher also has a collection of system modules, providing numerous operations on standard data types such as integers, lists, characters, strings, sets, and programs. The main design aim is to combine in a practical and comprehensive way the best ideas of existing functional and logic languages, such as Haskell and So far, the design of the language has been completed and work is well advanced on the design and implementation of a suitable abstract machine for the language in close collaboration with the BRISK Project for which a similar abstract machine is needed. Current work also includes the design and implementation of suitable meta-programming facilities. The main intended applications of Escher in the near future are to machine learning. These applications are being developed in the context of higher-order inductive declarative programming in the machine learning project. Currently, a generalised decision-tree learning algorithm is being developed and applications of this to suitable industrial and commercial problems are planned.
Implementation Of Functional Languages (IFL'96)
but not exclusively to the implementation of functional or functionbased languages. arrayprocessing; concurrent programming and program execution; heap
http://www.informatik.uni-kiel.de/inf/Kluge/calendar/ifl96.html

Extractions: Implementation of Functional Languages International Workshop (IFL'96) Gustav-Stresemann-Institut, Bonn-Bad-Godesberg, Germany Monday, Sept 16th - Wednesday, Sept 18th 1996 Workshop Topics The workshop is intended to provide a forum for researchers who wish to present and discuss new ideas and concepts, work in progress, preliminary results etc. related primarily but not exclusively to the implementation of functional or function-based languages. A not necessarily exhaustive list of topics includes but contributions on applications of functional programming, e.g., in teaching, or on theoretical work in any of the above areas are also welcome. Previous IFL workshops Bastad Norwich 1993 Nijmegen 1992 Aachen 1991 Southampton 1990 Nijmegen 1989 Nijmegen
The Aldor Programming Language
A functional programming language in which types are first class values. Normal functions returning types reproduce the features of template classes of other languages. This site points to numerous projects around the world based on Aldor.
http://www.aldor.org/
Functional Programming
Optimisation,Language Design,Promoting functional programmingCategory Computers programming languages functional Research 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.

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

21-40 of 104 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20