RE: type class
| How about extending TC with a branch for abstraction: | | TC ::= ... | | /\a. TC -- abstraction | | This is too powerful and will get out of control -- we surely | don't want to give TC the full power of lambda-calculus. So let's impose a | restriction: in /\a.TC, a must occur free in TC *exactly once*. This | way, abstraction can only be used to specify with respect to which | argument a partial application is. (or I think so -- I haven't tried to | prove it.) That's an interesting idea that I've not seen suggested before. Someone should study it! Simon
Re: negative export list
George Russell [EMAIL PROTECTED] writes: As a result, I seldom write "private" functions at top-level, and I think the situation might be true for other functional programmers as well. It isn't true for me. Me neither. I simply disregard the whole export list during development, using a module declaration like module Foo where [...] until things stabilize. (You knew you could do that, right?) -kzm -- If I haven't seen further, it is by standing in the footprints of giants
JFP Special Issue on Haskell
-- CALL FOR PAPERS Journal of Functional Programming Special Issue on Haskell Since its inception in 1987, Haskell has provided a focal point for research in lazy functional programming. During this time the language has continually evolved, as a result of both theoretical advances and practical experience. Haskell has proved to be a powerful tool for many kinds of programming tasks, and applications in industry are beginning to emerge. The recent definition of Haskell 98 provides a long-awaited stable version of the language, but there are many exciting possibilities for future versions of Haskell. The fourth Haskell Workshop was held as part of the PLI 2000 colloquium on Principles, Logics, and Implementations of high-level programming languages in Montreal, 17th September 2000. Previous Haskell Workshops have been held in Paris (1999), Amsterdam (1997) and La Jolla (1995). Following on from these workshops, a special issue of the Journal of Functional Programming will be devoted to Haskell. Possible topics include, but are not limited to: Critiques of Haskell 98; New proposals for Haskell; Applications or case studies; Programming techniques; Reasoning about programs; Semantic issues; Pedagogical issues; Implementation. Contributors to any of the Haskell workshops are invited to submit full papers to the special issue on Haskell, but submission is open to everyone. Submissions should be sent to the guest editor (address below), with a copy to Nasreen Ahmad ([EMAIL PROTECTED]). Submitted articles should be sent in postscript format, preferably gzipped and uuencoded. In addition, please send, as plain text, title, abstract, and contact information. The submission deadline is 1st February 2001. For other submission details, please consult an issue of JFP or see the Journal's web pages. Guest Editor: Graham Hutton School of Computer Science and IT The University of Nottingham Nottingham NG8 1BB United Kingdom [EMAIL PROTECTED] Useful Links: 2000 Haskell Workshop www.cs.nott.ac.uk/~gmh/hw00.html JFP Special Issue on Haskell www.cs.nott.ac.uk/~gmh/jfp.html JFP Home Page www.dcs.gla.ac.uk/jfp --
Re: type class
Simon Peyton-Jones [EMAIL PROTECTED] writes: | How about extending TC with a branch for abstraction: | | TC ::= ... | | /\a. TC -- abstraction | | This is too powerful and will get out of control -- we surely | don't want to give TC the full power of lambda-calculus. So let's impose a | restriction: in /\a.TC, a must occur free in TC *exactly once*. This | way, abstraction can only be used to specify with respect to which | argument a partial application is. (or I think so -- I haven't tried to | prove it.) That's an interesting idea that I've not seen suggested before. Someone should study it! I wonder if the linear logic folks have studied this form of lambda calculus? Carl Witty
TACS 2001 CFP
Preliminary Call for Papers Fourth International Symposium on Theoretical Aspects of Computer Science (TACS 2001) October 29-31, 2001 Tohoku University, Sendai, Japan The TACS Symposium will focus on the theoretical foundations of programming and their applications. The topics of interest include... Theoretical aspects of the design, semantics, analysis, and implementation of programming languages and systems; logics of programs; calculi and models of concurrency and parallel computation; theories of mobile computation and system security; categories and types in computer science; formalisms, methods, and systems for program specification, verification, synthesis, and optimization; constructive, linear, and modal logics in computer science. The scientific program will consist of invited lectures, contributed talks, and demo sessions. A proceedings containing the full papers of the invited and contributed talks will be published by Springer-Verlag as a volume of Lecture Notes in Computer Science. IMPORTANT DATES Submission deadline: April 1, 2001 Notification to authors: June 15, 2001 Deadline for final versions: July 20, 2001 INVITED SPEAKERS Luca Cardelli Microsoft Research Daniel Jackson Massachusetts Institute of Technology Christine Paulin-Mohring Universite Paris Sud INRIA Andrew Pitts University of Cambridge Jon Riecke Lucent Technologies Kazunori Ueda Waseda University CONFERENCE CHAIR: Takayasu Ito Tohoku University PROGRAM CO-CHAIRS: Naoki Kobayashi University of Tokyo [EMAIL PROTECTED] Benjamin Pierce University of Pennsylvania [EMAIL PROTECTED] PROGRAM COMMITTEE: Zena Ariola University of Oregon Cedric FournetMicrosoft Research Jacques Garrigue Kyoto University Masami Hagiya University of Tokyo Robert Harper Carnegie Mellon University Masahito Hasegawa Kyoto University Nevin Heintze Lucent Technologies Martin HofmannEdinburgh University Zhenjiang Hu University of Tokyo Naoki Kobayashi University of Tokyo Martin OderskyEcole Polytechnique Federale de Lausanne Catuscia Palamidessi Pennsylvania State University Benjamin Pierce University of Pennsylvania Francois Pottier INRIA Andre Scedrov University of Pennsylvania Natarajan Shankar SRI International Ian Stark Edinburgh University Makoto TatsutaKyoto University SUBMISSION INFORMATION Authors are invited to submit full papers (up to 6000 words, including figures and bibliographies). Papers must be unpublished and not submitted for publication elsewhere. Submissions should be in Postscript format, on A4 or US letter pages. They must be printable on common printers and viewable with ghostview. The first page of each submission should include the email address, telephone, and fax numbers of the corresponding author. Accepted papers must be presented at the symposium, and the final manuscript must be prepared in the LNCS format. Detailed submission procedure will be announced later at the TACS 2001 web page (http://tacs2001.ito.ecei.tohoku.ac.jp/tacs2001/).
