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

Zhenyu Qian Research Interests Projects Publications Lectures ... Hotlist Research Interests Java security, Java extensions, Java semantics, object-oriented, functional, concurrent, logic programming languages, specification languages, compiler construction, program specification, program construction, program transformation, object-oriented analyse and design, types, lambda-calculus, unification, algebraic semantics, theorem proving systems. I am now working at the Kestrel Institute . Click here to go to my new homepage. Zhenyu Qian, last update June 23, 2000

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

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

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

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). As well as an indispensable reference, On Lisp is a source of software. Its examples form a library of functions and macros that readers will be able to use in their own Lisp programs. Prentice Hall, 1993, 432 pages, paperbound. ISBN 0130305529. New: Download it for free. "The first book that really explains what Lisp is all about." - John Foderaro, Franz Inc. 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. The chapter on object-oriented programming is excellent. The author builds a nice mini-CLOS to teach basic object-oriented techniques, but then wisely switches to real CLOS to cover the more advanced topics."

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

Journal of Functional Programming 1996 January 1996, Volume 6, Number 1 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.

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

Department of Computer Science Organisations Chairs Computer-Science-Library Computer Administration Group Study Information for: Students Pupils Graduates Co-operation Events Computer-Science-Day 2002 Department-Summerparty 2002 Talks Technical Reports ... Jobs Contact Professors Staff Sponsors News Professorship in Computer Science Software for Embedded Systems Media Informatics (in german) Distributed Systems Software and Tools for Computational Engineering Computer-Science-Day 2002 On December 7, the computer science department is celebrating the annual Computer-Science-Day Pathfinder - SUN Software Award 2002 On the occassion of the Computer-Science-Day there's one more a programming-contest. For futher information have a look at the pathfinder -homepage. Computer Administration Group March 1994 last modified: 11/07/2002

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

Journal of Functional Programming 1991 January 1991, Volume 1, Number 1 Henk Barendregt Paul Hudak John Hughes , and Philip Wadler . Editorial. Journal of Functional Programming , 1(1):1-2, January 1991. [ BibTeX entry F. Warren Burton . Encapsulating non-determinacy in an abstract data type with determinate semantics. Journal of Functional Programming , 1(1):3-20, January 1991. Citations. BibTeX entry Carsten K. Gomard and Neil D. Jones . A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming , 1(1):21-69, January 1991. Citations. BibTeX entry Mikael Rittri . Using types as search keys in function libraries. Journal of Functional Programming , 1(1):71-89, January 1991. Citations. BibTeX entry Sebastian Hunt and Chris Hankin . Fixed points and frontiers: a new perspective. Journal of Functional Programming , 1(1):91-120, January 1991. Citations. BibTeX entry Richard S. Bird . Functional pearls: The Minout problem. Journal of Functional Programming , 1(1):121-124, January 1991. [ BibTeX entry April 1991, Volume 1, Number 2 Henk Barendregt . Introduction to generalized type systems. Journal of Functional Programming , 1(2):125-154, April 1991.

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

About Us People Research Grad ... SFU CS Undergrad Wins CRA Seminars and Events Graph Theory of Brian Alspach - May 25-29, 2003 About Us General Contact Info ... MSc/PhD Theses Academic Programs Graduate Studies Undergraduate Studies General Interest Forms Events Library School of Computing Science ... csweb@cs.sfu.ca

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

Programming Languages and Systems Recent Changes Functioanl Programming Group People Useful Links ... Etc. 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 Domestic PLaC Lab at Dongguk Univ. (Prof. Seman Oh) Computer Language Lab at Ewha Womens Univ. PL Lab at Hangyang Univ. (Prof. Kyung-goo Doh) PL Lab at Hongik Real-Time System ans Software Engineering Lab at Konkuk Univ. Thoery and Formal Methods Lab at Korea Univ. (Prof. Jinyoung Choi) Micro-Architecture and System Software Lab at SNU (Prof. Soomook Moon) Parallel Programming Languages and Systems Lab at Sogang Univ. People Choi's collection Starting Points to Useful Links Jon's Functional Languages Page All about FP Wadler's Functional Programming Guide PL links ... John Hughes' guide JFP : HOT Practice and Experience Claus Reinke's FP Newsgroup comp.compilers

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

The University of Adelaide Home Departments Search Computer Science Computer Science provides an understanding of how software combined with hardware can be used to overcome an astonishing range of challenges. Computer Science is the study of humanity's most complex creations. At Adelaide, we confront the challenge of this complexity head-on Information For Students Staff Information About Research Staff Ph.D. Research Training Seminar Programme ... Computing Facilities Department of Computer Science THE UNIVERSITY OF ADELAIDE SA 5005 AUSTRALIA Email: secretary@cs.adelaide.edu.au Telephone: Facsimile: Last Modified 20 Nov 2002 Systems CRICOS Provider Number 00123M Privacy

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

Programming Language Research A collection of information and resources for research in programming language theory, design, implementation, and related areas. Additions and corrections are welcome! What's new Language overviews Research projects Home pages of researchers ... Miscellaneous Subject-Oriented Pages Action semantics Automated deduction Automated reasoning Calculi for Mobile Processes ... Visual programming and program and data visualisation Other Related Pages Functional Languages FAQ The European Association for Programming Languages and Systems The Compiler Connection at NULLSTONE The Teaching About Programming Languages project. Catalog of Compiler Construction Tools ACM SIGPLAN home page AMAST Links (Algebraic Methodology And Software Technology) Archive of comp.compilers The SEL-HPC Article Archive Reading list on parallel languages Mark Leone ( mleone@cs.cmu.edu

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

A Curry-Howard foundation for functional computation with control (1997) (Make Corrections) (35 citations) C.-H. L. Ong, C. A. Stewart Home/Search Context Related View or download: comlab.ox.ac.uk/pub/Docu popl97.ps.gz Cached: PS.gz PS PDF DjVu ... Help From: comlab.ox.ac.uk/ou publications (more) Homepages: C.Ong C.Stewart HPSearch (Update Links) Rate this article: (best) Comment on this article (Enter summary) 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) Context of citations to this paper: More ...programming. Additionally, the following fact is well known: Curry Howard correspondences exist between calculi and classical logics The fact that control operators enable calculi to correspond with classical logics was rst discovered by Grin [10] Proof...

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

General Information: Official Information Page for Computer Science An Overview of Brandeis University Address Information and Directions The Registrar and the Science Library Course Information Projected Course Offerings Webpages of Recently offered Courses Computer Science Bulletin Brandeis Admissions: Undergraduate Admissions Sample 4 year schedules for BS,BA,Minor. Graduate Admissions : MS and PhD programs. Faculty and Research Research Groups Seminars, Conferences and Special Events Faculty last modified 03 July 2002 5/15/2002: These pages are currently in transition In particular, we are currently revising our out-of-date Computer Science Department Brochure . This page is owned by Tim Hickey , please send comments and corrections to him.

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

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

Wolfgang Schreiner Research Institute for Symbolic Computation (RISC-Linz) Johannes Kepler University A-4040 Linz, Austria, Europe Email: Wolfgang.Schreiner@risc.uni-linz.ac.at URL: http://www.risc.uni-linz.ac.at/people/schreine PGP Public Key Bookmarks Home Page at CBL ... Talks Research Parallel and Distributed Computing at RISC-Linz 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.

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

(Full Professor of Computer Science). Leader of the ELP Group Research Activities Selected Publications ( DBLP CCS Bibliographies ) (most papers are available on-line) Teaching Paloma and Claudia's homepage Address Camino de Vera s/n Apdo. 22.012 E-46022 Valencia (Spain) Phone Fax e.mail alpuente@dsic.upv.es ELP GPLIS DSIC ... UPV

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

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 Curry: a proposal for a standard in functional logic programming Mailing list Workshops, Conferences, Journals ... Related subjects Please mail to Michael Hanus if you know relevant information not included here.

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

Bristol CS Index Research Escher 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.

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

Implementation of Functional Languages International Workshop (IFL'96) Gustav-Stresemann-Institut, Bonn-Bad-Godesberg, Germany Monday, Sept 16th - Wednesday, Sept 18th 1996 Workshop program Lecture Notes Proceedings IFL'97 (St Andrews, Scotland) unofficial collection of functional programming links 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 language concepts type checking compilation techniques (abstract) interpretation automatic program generation (abstract) machine architectures array processing concurrent programming and program execution heap management runtime profiling and performance measurements 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

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

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

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.

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 2     21-40 of 104    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20