21. LAMP — Research It smoothly integrates features of objectoriented and functional languages. Programming Language Abstractions for Mobile Code (Micheloud, Mihaylov). http://lamp.epfl.ch/research/

Ecole polytechnique fédérale de Lausanne Programming Methods Laboratory Research français english EPFL LAMP Research Summary Homepage Staff Research Publications Teaching Research topics Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. Programming Language Abstractions for Mobile Code (Micheloud, Mihaylov). A Nominal Theory for Objects with Dependent Types, see ECOOP paper (Cremet, Odersky, Röckl, Zenger). Local Type Inference (Altherr, Odersky, Zenger). Language Abstractions for Semi-Structured Data (Burak, Cremet, Odersky, Zenger, with Benjamin Pierce). An Axiomatization of Transactions (Cremet, Odersky, with Andrew Black and Rachid Guerraoui). Unanticipated Extensibility of Software Components (Zenger). GJ , an extension of the Java programming language with generic types (Odersky). Functional Nets , a uniform foundation for programming based on join-calculus Funnel is a small programming language based on Functional Nets (Odersky, Schinz).

22. Coq - Wikipedia, The Free Encyclopedia Science software stubs Interactive theorem proving software Free theorem provers Dependently typed formal languages OCaml software Functional languages Programming languages http://en.wikipedia.org/wiki/Coq

Coq From Wikipedia, the free encyclopedia Jump to: navigation search Coq Paradigm Functional Stable release 8.3 (October 2010 ; 31 days ago Typing discipline static strong Influenced by ML and Standard ML Influenced Agda OS Cross-platform License ... LGPL Usual file extensions .v Website Coq website An interactive proof session in CoqIDE, showing the proof script on the left and the proof state on the right. In computer science Coq is an interactive theorem prover . It allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification. Coq works within the theory of the calculus of inductive constructions , a derivative of the calculus of constructions . Coq is not an automated theorem prover but includes automatic theorem proving tactics and various decision procedures. Coq implements a dependently typed functional programming language It is developed in France , in the TypiCal (ex-LogiCal) project, jointly operated by INRIA École Polytechnique Paris-Sud 11 University and CNRS . There was also formerly a group at École Normale Supérieure de Lyon . The team leader is Senior Scientist Benjamin Werner . Coq is implemented in Objective Caml The word coq means " cock " (rooster) in French , and stems from a tradition of naming French research development tools with animal names. It is also a reference to

23. Martin�Odersky It smoothly integrates features of objectoriented and functional languages. Programming Language Abstractions for Mobile Code. Composing services, using staging and data binding. http://people.epfl.ch/martin.odersky

EPFL people@EPFL login Full Professor IC IC-SIN SIN-ENS Martin Odersky Programming Methods Laboratory 1 Professor PhD (ETHZ, 1989) birth date: 05.09.1958 nationality: German web site: http://lampwww.epfl.ch/~odersky/ msgto('martin.odersky','') office(s): phone(s): [+41 21 69] 36863,35202 OTHER PUBLICATION Conference papers Technical reports Journal papers CURRENT WORK Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. Programming Language Abstractions for Mobile Code Composing services, using staging and data binding Reproducible Concurrent Programs through Software Transactions Pluggable Type Systems Martin Odersky's research is sponsored by the Swiss National Science Foundation, the European Commission, and the Hasler Foundation. BIOGRAPHY Martin Odersky heads the programming research group at EPFL. His research interests cover fundamental as well as applied aspects of programming languages. They include semantics, type systems, programming language design, and compiler construction. The main focus if his work lies in the integration of object-oriented and functional programming. His research thesis is that the two paradigms are just two sides of the same coin and should be unified as much as possible. To prove this he has experimented a number of language designs, from Pizza to GJ to Functional Nets. He has also influenced the development of Java as a co-designer of Java generics and as the original author of the current javac reference compiler. His current work concentrates on the Scala programming language, which unifies FP and OOP, while staying completely interoperable with Java and .NET.

24. Hope (programming Language) - Wikipedia, The Free Encyclopedia Hope is a small functional programming language developed in the 1970s at Functional languages Programming language topic stubs http://en.wikipedia.org/wiki/Hope_(programming_language)

Hope (programming language) From Wikipedia, the free encyclopedia Jump to: navigation search Hope is a small functional programming language developed in the 1970s at Edinburgh University . It predates Miranda and Haskell and is contemporaneous with ML (also developed at Edinburgh). It is notable for being the first language with call-by-pattern evaluation and algebraic data types . Hope is an important language in the development of functional programming. The name may have been derived from Hope Park Square in Edinburgh, at one time the location of the Department of Artificial Intelligence. A Hope tutorial by Roger Bailey was featured in the August 1985 issue of Byte on declarative programming A factorial program in Hope is Unlike in Haskell , changing the order of the clauses would not change the meaning of the program, because Hope's pattern matching always favors more specific patterns over less specific ones. Another way in which Hope differs from Haskell and ML is that explicit type declarations in Hope are required: There is no option to use a type-inference algorithm in Hope. The first implementation of Hope was strict , but since that one there have been lazy versions and strict versions with lazy constructors (the language described in has a lazy constructor for lists only).

25. CiteULike: A Critique Of Abelson And Sussman Or Why Calculating Is Better Than S tarampam's tags for this article. functional languages programming; There are no reviews yet http://www.citeulike.org/user/tarampam/article/72198

Search all the public and authenticated articles in CiteULike. Enter a search phrase. You can also specify a CiteULike article id ( a DOI ( doi:10.1234/12345678 or a PubMed Id ( pmid:12345678 Click Help for advanced usage. CiteULike tarampam's CiteULike Search Register Log in Home ... Research Fields NEW Help/FAQ Discussion Contact Us Library ... Recommendations NEW Neighbours Watchlist CiteULike is a free online bibliography manager. Register and you can start organising your references online. Tags A critique of Abelson and Sussman or why calculating is better than scheming by: P. Wadler RIS Export as RIS which can be imported into most citation managers BibTeX Export as BibTeX which can be imported into most citation/bibliography managers PDF Export formatted citations as PDF RTF Export formatted citations as RTF which can be imported into most word processors Delicious Export in format suitable for direct import into delicious.com. Setup a permanent sync to delicious) Formatted Text Export formatted citations as plain text To insert individual citation into a bibliography in a word-processor, select your preferred citation style below and drag-and-drop it into the document. SIGPLAN Not.

26. DBLP Record 'journals/lisp/LoidlRSHHKLMPPPT03' Steffen Priebe and {\'A}lvaro J. Reb{\'o}n Portillo and Philip W. Trinder}, title = {Comparing Parallel Functional Languages Programming and http://dblp.uni-trier.de/rec/bibtex/journals/lisp/LoidlRSHHKLMPPPT03

DBLP Record ' journals/lisp/LoidlRSHHKLMPPPT03 BibTeX DBLP Home Conferences Journals ... Author 2005-11-30 by Michael Ley ley@uni-trier.de

27. Computer Science @ UC Davis | Course Descriptions The Lambda calculus as the basis of the definition and implementation of functional languages ; Programming Languages and the Lambda Calculus http://www.cs.ucdavis.edu/courses/exp_course_desc/240.html

@import url("../../css/csstylev3.css"); Site Map College of Engineering UC Davis MyUCDavis ... INDUSTRIAL AFFILIATES ECS 240 PROGRAMMING LANGUAGES (4) II Lecture: 3 hours Discussion: 1 hour Prerequisite: Courses ECS 140A ECS 142 Grading: Letter; problem sets (10%), project (30%), midterm (20%), final (40%) Catalog Description: Advanced topics in programming languages, including formal syntax and semantics, the relation between formal semantics and verification, and an introduction to the lambda calculus. Additional topics will include language design principles, alternative programming language, in-depth semantic theory and models of language implementation. Expanded Course Description: Lectures provide an introduction to the theoretical side of the study of computer programming languages, including language definition methods and the lambda calculus. The usefulness of advanced language features in appropriate programming applications is also discussed, with examples. The project gives students an opportunity to experiment with defining and prototyping a programming language. The lectures topics include the following, not necessarily listed in chronological order:

28. Programming In The Large: The Algebraic-Functional Language Opal 2alpha Programming in the Large The AlgebraicFunctional Language Opal 2alpha http://wotan.liu.edu/docis/dbl/iflifl/1997__322_PITLTA.htm

The Digital Librarian's Digital Library search D O CIS  Do cuments in  C omputing and I nformation  S cience Home Journals and Conference Proceedings Implementation of Functional Languages Programming in the Large: The Algebraic-Functional Language Opal 2alpha Klaus Didrich, Wolfgang Grieskamp, Christian Maeder, Peter Pepper Journal Title: Implementation of Functional Languages Date: 1997 For further information about this item go to: http://link.springer.de/link/service/series/0558/bibs/1467/14670322.htm This data comes from DBLP This page is maintained by Angela Cornwell and Thomas Krichel It was last updated on 2006-04-12

29. High-level Abstractions For Parallel Functional Programming Hammond , S. Horiguchi , U. Klusik , R. Loogen , G. J. Michaelson , R. Pe a , S. Priebe , J. Reb n , P. W. Trinder, Comparing Parallel Functional Languages Programming and http://portal.acm.org/citation.cfm?id=925038

30. Functional Languages - When To Use? - Stack Overflow There's more and more attention on languages such as Haskell and F and although I can see the parallelisation benefits where processing large amounts of data, I cannot see where a http://stackoverflow.com/questions/171719/functional-languages-when-to-use

31. The Genesis Of F Programming in F tends to be more objectoriented than in other functional languages. Programming also tends to be more flexible. F embraces .NET techniques such as dynamic http://www.apress.com/resource/bookfile/3853

%PDF-1.6 %�������������������������������� 1 obj 8v�� b3U1u�G��M iiMbZSsZ�~�x=a�-� <�Ǭ�A����w�"���x�,�-��i ��,�d���T <]`��o�krPA����x(�4S�au1"� > endobj 3 obj > stream H��R[�BA �,`����X��X�B,` �d <^ +����U Ef����-�4xm��# ���c�٩�̘� ��:���m�G�=����z� <�X������N �$_����Y��4Ŀ�cF#��ȩ�m�������������l����=J�)k�Ub�y�� �H~���k �L�.�� �3V� <�o ^'V�2�b�O�Կb�u�������.�;w�Ǐ����g%К�>����Jp�Z �k-J��R�Խ�"Ƃ���l e�,/��e٠/��_�;~Gc:3D���i�թA~���j� J��A� �mN�� <�F�*�j�?�t�`��SH���� ��Մ4#CoA�����ҥ�qԭ�sY%Dq�p���+�O���n�W��"�!�Z�/��ʉ���ETDVp��((Vwl@z �% <���4���J���e�-�媨� m ) > endobj 6 obj > endobj 7 obj > endobj 8 obj <���G�Z�[��Է�@ө� <�U�� <�;��.�m0������䅊l������Izs���,�� <��d'� S��뾢:�[*J�/�`��f�čNh�4��5������m�2@r��y�s����"r#�C�� �1�t4R#%�B�q���ha��A���%�x��W#�5u�k�E�K��ck$�W��3Xg�X̽f-;����k(2��餗�� S�� T��[�*���B�З��������Jy�7�+�96��I���*S�N�S <�y�t�J��� �g�C��E�����g8Wܨ4� > endobj 10 obj > endobj 12 obj <���]�aQ]W л5�d� ��M>]�8s���g[�����hI���IR��F��M��Ўj2WU�ͳ��1a�v(> > endobj 14 obj > endobj 15 obj < /CropBox [ 612 792 ] /MediaBox [ 612 792 ] /Rotate /Thumb 53 R /Resources < /Font > /ProcSet [ /PDF /Text /ImageB /ImageC /ImageI ] /Properties > /ExtGState > >> /Parent 30 R /Contents 18 R /Type /Page >> endobj 16 obj > endobj 17 obj 0y�®J�V�k ��մ�?������

32. DBLife: Ricardo Pena Comparing Parallel Functional Languages Programming and Performance. HansWolfgang Loidl, Fernando Rubio, Norman Scaife, Kevin Hammond, Susumu Horiguchi, Ulrike Klusik, Rita http://dblife.cs.wisc.edu/person/Ricardo_Pena

33. Research Papers/Parallelism And Concurrency - HaskellWiki Comparing Parallel Functional Languages Programming and Performance Loidl HW. Rubio F. Scaife N. Hammond K. Horiguchi S. Klusik U. Loogen R. Michaelson G.J. Pena R. Priebe S http://haskell.org/haskellwiki/Research_papers/Parallelism_and_concurrency

34. Glasgow Parallel Haskell Papers Comparing Parallel Functional Languages Programming and Performance J. of Higherorder and Symbolic Computation, 2003 Thread Migration in a Parallel Graph Reducer http://www.macs.hw.ac.uk/~dsg/gph/papers/

This page is a collection of publications in the area of parallel functional programming written by the Glasgow Parallel Haskell group. The links below take you to abstracts, BibTeX, and PostScript for each paper. An out-of-date BibTeX bibliography for the papers up to 2000 is also available. Recent papers , including those on architecture independence , and are available. Implementation Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs In IEEE Transactions on Parallel and Distributed Systems. To appear. Supporting High-Level Grid Parallel Programming: the Design and Implementation of Grid-GUM2 Proc. of the All Hands Meeting 2007 (AHM2007), Sept 2007. SymGrid: a Framework for Symbolic Computation on the Grid Proc. EuroPar'07, August 2007. Managing Heterogeneity in a Grid Parallel Haskell In Scalable Computing: Practice and Experience, Vol. 7, No. 3, pp. 9-26. May 2005. Comparing Parallel Functional Languages: Programming and Performance J. of Higher-order and Symbolic Computation Thread Migration in a Parallel Graph Reducer IFL The Virtual Shared Memory Performance of a Parallel Graph Reducer CCGrid/DSM Load Balancing in a Parallel Graph Reducer SFP The Multi-Architecture Performance of the Parallel Functional Language GPH Europar GpH and Eden: Comparing Two Parallel Functional Languages on a Beowulf Cluster SFP GUM: a Portable Parallel Implementation of Haskell PLDI Making a Packet: Cost-Effective Communication for a Parallel Graph Reducer IFL

35. Kovalchuk Kirill Experience Basic knowledge of optimization algorithms development and functional languages programming Location University Technologies Lisp http://blog.kovalchuk.in/

36. Programme & Unit Catalogues - University Of Bath Typed lambda calculus and type inference. Combinatory logic. Lazy functional languages. Programming in a functional style. Other calculi. http://www.bath.ac.uk/catalogues/2007-2008/cm/CM20167.htm

Skip to content UoB home a-z contact ... Useful contacts Department of Computer Science, Unit Catalogue 2007/08 CM20167 Programming III: functional programming Credits: Level: Intermediate Semester: Assessment: CW 25%, EX 75% Requisites: Before taking this unit you must (take CM10134 and take CM10135) or take CM10140 (or equivalent approved by Director of Studies). Aims: To illustrate how the logical and semantic foundations of programming languages are translated into usable programming languages. To give students practical experience of using a functional programming language. Learning Outcomes: 1) To recognise the connections between mathematical logic and the development of programming languages; 2) To use the notion of reduction in the lambda calculus; 3) To be able to explain how the lambda calculus provides a foundation for the functional family of programming languages; 4) To be able to demonstrate practical competence with the Lisp family of languages, typed functional languages and lazy functional languages; 5) To be able to explain the key features of such languages.

37. Kovalchuk Kirill Experience Basic knowledge of optimization algorithms development and functional languages programming Location University Technologies Lisp http://blog.kovalchuk.in/2010/03/test2.html

skip to main skip to sidebar Kovalchuk Kirill About ... Contacts 20 January 2003 CPU scheduling and optimization Algorithm for scheduling N tasks (jobs) between M processors. Each task has a duration (in units of work). Every process can handle one unit of work. Experience: Basic knowledge of optimization algorithms development and functional languages programming Location: University Technologies: Lisp Newer Post Older Post Home PROJECTS SCHEDULE January Bookanythinghttp://bookanything.com An application... January CPU scheduling and optimizationAlgorithm for sched... ... Neuro-netNeuro-network for hand-writing text recog... PRINTABLE CV - click here to download

38. High-Level Architecture Independence Via Parallel Graph Reduction Comparing Parallel Functional Languages Programming and Performance . Higherorder and Symbolic Computation, 16(3)203-251, 2003. ps.gz; H-W. Loidl, P.W. Trinder, and C. Butz. http://www.macs.hw.ac.uk/~dsg/gph/arch-indep.html

High-Level Architecture Independence via Parallel Graph Reduction Summary State Download Documentation ... Links Project Summary Title: High-Level Architecture Independence via Parallel Graph Reduction Investigator: Hans-Wolfgang Loidl Grant no.: APART fellowship 624 Institution: Dept of Computing and Elec Eng, Heriot-Watt University Duration: Funding Body: Austrian Academy of Sciences The long-term aim of my research is to make the computational power of multi-processor systems available to non-specialists in parallel programming. The specific goal of my fellowship is to develop a system for high-level parallel computation, demonstrating reasonable performance across a range of parallel architectures with no or minimal program changes . To achieve these I focus on the development of systems for parallel computation using a minimal parallel extension of the standard functional language Haskell, GpH. The language is implemented on a parallel graph reduction machine, GUM, that abstracts over most architecture-dependent aspects of the execution. Austrian Academy of Sciences State of the Project Implementation The current version of GpH is part of the CVS repository for the Glasgow Haskell Compiler (GHC) and can be checked out from there. Go to the

39. The Nice User's Manual Parametric classes are like templates in C++, or similar constructs in various functional languages. Programming with parametric classes is sometimes called generic http://nice.sourceforge.net/manual.html

The Nice user's manual Daniel Bonniot Bryn Keller Francis Barber Table of Contents Foreword 1. Philosophy 2. Packages The ... Abstract Interfaces List of Tables Operators List of Examples Class definition and creations using the automatic constructor Class definition and creations using custom constructors Class initializers Simple Java Collection ... Abstract Interfaces Foreword This manual describes the Nice programming language. It is currently under redaction, which means that many aspects of the language are absent from it, or that some sections are mostly empty. During this time, it is recommended to read also the Nice tutorial , which contains lots of additional information. Both documents currently assume some knowledge of Java, or at least of an object oriented language. The authors of this manual are Bryn Keller and Daniel Bonniot, with contributions from Francis Barber. Chapter�1.�Philosophy A language that doesn't affect the way you think about programming, is not worth knowing. Alan J. Perlis

40. Cornell College - Catalogue (2002-2004) Alternative programming paradigms, including functional languages. Programming examples from selected languages. Prerequisites CSC 213 and 218. http://cornellcollege.edu/catalogue/2002/node74.html

Quick Links... Supporting Cornell Student Organizations Calendar Cornell Directory Site Map Residence Life Career Services Registrar Next: Economics and Business (ECB) Up: Courses of Instruction Previous: Classical Studies (CLS) Computer Science (CSC) Tony deLaubenfels (chair), Leon Tabak The technology of computing has developed with unprecedented speed and offers the prospect of continued rapid advance. Few technologies have so quickly become so pervasive. Few have so profoundly changed science, business and industry, and government. Some understanding of the potential and limitations of computing is essential to anyone who wishes to understand modern society. Design, experiment, and analysis: these skills make the computer scientist part engineer, part scientist, and part mathematician. The student of computer science learns how to effectively communicate with teammates and clients to define problems and their solutions. Students learn how to divide a complex problem into pieces of manageable size, to organize and relate the pieces of information that describe the problem, and to order the steps of the solution. The study of computer science serves to increase a student's awareness of the necessity of constructing a hierarchy of abstractions as a means of building and understanding complex machines, the designer's need to give balanced consideration to competing goals, e.g., minimizing cost while maximizing computational speed, and the relationship between software and hardware.

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 46    Back | 1  | 2  | 3  | Next 20