December 2005 - Haskell

ANNOUNCE: HSQL 1.7 released
by Krasimir Angelov 16 Dec '05

16 Dec '05

What is new? ~~~~~~~~~~ 1. Driver for Oracle 2. getFieldValueMB is deprecated. Now there is the instance declaration: instance SqlBind a => SqlBind (Maybe a) It allows to use getFieldValue instead of getFieldValueMB. Thanks to Frederik Eaton for this idea. 3. Database.HSQL.SQLite is renamed to Database.HSQL.SQLite2. The trouble was that with Hugs for each module with FFI is generated an extra .dll/.so library. In this case the library is SQLite.dll which on Windows overlaps with the name of the real sqlite.dll library. Home page ~~~~~~~~~ http://htoolkit.sourceforge.net Download from ~~~~~~~~~~~~~ https://sourceforge.net/project/showfiles.php?group_id=65248&package_id=939…

2 2

TFP2006: Second Call for Papers
by Henrik Nilsson 15 Dec '05

15 Dec '05

Dear Colleague, Please find enclosed the second call for papers for Trends in Functional Programming (TFP) 2006. My apologies for duplicate copies. Best regards, /Henrik -- Henrik Nilsson School of Computer Science and Information Technology The University of Nottingham nhn(a)cs.nott.ac.uk This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. TFP 2006 Seventh Symposium on Trends in Functional Programming Nottingham, UK, 19 - 21 April, 2006 http://www.cs.nott.ac.uk/~nhn/TFP2006 Co-located with Types 2006 and Spring School on Datatype-Generic Programming CALL FOR PAPERS The Symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming languages, focusing on providing a broad view of current and future trends in Functional Programming. It aspires to be a lively environment for presenting the latest research results through acceptance by extended abstracts. A formal post-symposium refereeing process then selects the best papers presented at the symposium for publication in a high-profile volume. TFP 2006 is going to be held in Nottingham, UK, 19 - 21 April. Note that this is significantly earlier in the year than past TFPs that generally were held in August - September. TFP 2006 is co-located with Types 2006 (18 - 21 April). The TFP symposium is the successor to the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh, Scotland in 2003, in Munich, Germany in 2004, and in Tallinn, Estonia in 2005 (co-located with ICFP and GPCE). For further general information about TFP, see http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The Symposium recognises that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five categories of paper. High-quality papers are solicited in any of these categories: Research Papers: leading-edge, previously unpublished research work Position Papers: on what new trends should or should not be Project Papers: descriptions of recently started new projects Evaluation Papers: what lessons can be drawn from a finished project Overview Papers: summarising work with respect to a trendy subject Papers must be original, and not submitted for simultaneous publication in any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Also applications of functional programming techniques to other languages may be considered. Papers on the following subject areas are particularly welcome: o dependently typed functional programming o validation and verification of functional programs o debugging for functional languages o functional programming and security o functional programming and mobility o functional programming and formally motivated computing o functional languages for telecommunications applications o functional languages for embedded systems o functional programming applied to global computing o functional GRIDs o functional languages for reasoning about imperative/object- oriented programs o interoperability with imperative programming languages o any new emerging trend in the functional programming area If you are in doubt on whether your paper is within the scope of TFP, please contact the TFP 2006 programme chair, Henrik Nilsson, nhn(a)cs.nott.ac.uk. BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. To acknowledge this, a prize for the best student paper is awarded each year. CO-LOCATION WITH TYPES 2006 AND DATATYPE-GENERIC PROGRAMMING 2006 TFP 2006 is co-located with Types 2006 (to be held 18 - 21 April). To take advantage of the synergies offered by these two complementary events, we will invite a number of joint keynote speakers, hold joint sessions on topics of mutual interest, such as dependently typed functional programming, and run common social events. The schedule will be arranged so that participants may freely move between parallel sessions of the two events. See http://www.cs.nott.ac.uk/types06/ for further details. TFP 2006 and Types 2006 are immediately followed by the Spring School on Datatype-Generic Programming 2006 (24 - 27 April), which should be of direct interest to many of the TFP and Types Participants. See http://www.cs.nott.ac.uk/ssdgp2006/ for further details. SUBMISSION AND LOCAL PROCEEDINGS Acceptance to the symposium is by extended abstracts of between 6 and 10 pages. Accepted abstracts are to be completed to full papers before the symposium for publication in the local symposium proceedings and on-line. Important dates: Deadline for abstract submission: 17 February, 2006 Notification of acceptance: 27 February, 2006 Registration deadline: 17 March, 2006 Camera-ready copy of full paper: 24 March, 2006 The submission must clearly indicate to which category it belongs: research, position, project, evaluation or overview paper. It should also indicate whether the main author or authors are research students. Abstracts and full papers must be written in English. Papers for the symposium proceedings must adhere to the formatting instructions provided on the TFP 2006 site. Papers must not exceed 16 pages; papers in some categories may comprise considerably fewer pages. The papers of the local proceedings will also be made available on-line under the following conditions, with which all authors are asked to agree: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. See the TFP 2006 website for further instructions to authors and details on how to submit. POST SYMPOSIUM REFEREEING AND PUBLICATION In addition to the local symposium proceedings, we intend to continue the TFP tradition of publishing a high-quality subset of contributions in the Intellect series on Trends in Functional Programming (see http://www.intellectbooks.co.uk/series.php?series=1) All TFP authors will be invited to submit revised papers after the symposium. These will will be refereed to normal conference standards, and a subset of the best papers over all categories will be selected for publication. Papers will be judged on their contribution to the research area, with appropriate criteria applied to each category of paper. Papers submitted for publication by Intellect must follow formatting and any other instructions provided by the Programme Chair. For TFP 2005, in order to enhance the quality of student submissions, a process where student papers were given extra feedback was tried out. A similar process might be put in place for this TFP, contingent on the outcome of that trial. ORGANISATION Symposium Chair: Marko van Eekelen, Radboud University Nijmegen, NL Programme Chair: Henrik Nilsson, University of Nottingham, UK Treasurer: Greg Michaelson, Heriot-Watt University, UK Local Arrangements: Joel Wright, University of Nottingham, UK PROGRAMME COMMITTEE: o Kenichi Asai, Ochanomizu University o Gilles Barthes, INRIA, Sophia Antipolis o Olaf Chitil, University of Kent at Canterbury o Catherine Dubois, IIE, Evry o Marko van Eekelen, Radboud Universiteit Nijmegen o Jeremy Gibbons, Oxford University o Kevin Hammond, University of St Andrews o Zoltán Horváth, Eötvös Loránd University o Frank Huch, Christian-Albrechts-University of Kiel o Johan Jeuring, Universiteit Utrecht o Greg Michaelson, Heriot-Watt University o Henrik Nilsson, University of Nottingham o Ricardo Peña, Universidad Complutense de Madrid o Morten Rhiger, Roskilde University o Colin Runciman, University of York o Carsten Schürmann, IT University of Copenhagen o Zhong Shao, Yale University o Phil Trinder, Heriot-Watt University SPONSORS We are actively looking for additional TFP sponsors, who may help to subsidise attendance by research students, for example. If you or your organisation might be willing to sponsor TFP, or if you know someone who might be willing to do so, please do not hesitate to contact the Symposium chair: Marko van Eekelen. Your students will be grateful!

1 0

Second Call For Papers - ICLP 2006
by A Serebrenik 15 Dec '05

15 Dec '05

SECOND CALL FOR PAPERS ICLP'06 22nd International Conference on Logic Programming Seattle, Washington, USA, 17-20 August, 2006 http://www.cs.uky.edu/iclp06/ Part of Fourth Federated Logic Conference, FLoC 2006 http://research.microsoft.com/floc06/ CONFERENCE SCOPE Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: * Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge Representation. * Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. * Environments: Program Analysis, Program Transformation, Validation and Verification, Debugging, Profiling. * Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Programming Techniques. * Alternative Paradigms: Constraint Logic Programming, Abductive Logic Programming, Inductive Logic Programming, Answer-Set Programming. * Applications: Deductive Databases, Data Integration, Software Engineering, Natural Language, Web Tools, Internet Agents, Artificial Intelligence. The three broad categories for submissions are: (1) technical papers, where specific attention will be given to work providing novel integrations of the areas listed above, (2) application papers, where the emphasis will be on their impact on the application domain as opposed to the advancement of the the state-of-the-art of logic programming, and (3) posters, ideal for presenting and discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. In addition to papers and posters, the technical program will include invited talks, advanced tutorials, several workshops and Doctoral Student Consortium. Details, as they become available will be posted at http://www.cs.uky.edu/iclp06/ PAPERS AND POSTERS Papers and posters must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English. Technical papers and application papers must not exceed 15 pages in the Springer LNCS format (cf. http://www.springer.de/comp/lncs/index.html) The limit for posters is 2 pages in that format. The primary means of submission will be electronic. More information on the submission procedure will be available at http://www.cs.uky.edu/iclp06/ PUBLICATION The proceedings of the conference will be published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. SUPPORT SPONSORING AND AWARDS The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two awards for ICLP'06: for the best technical paper and for the best student paper. IMPORTANT DATES Papers Posters Abstract submission deadline 14 February N/A Submission deadline 21 February 14 March Notification of authors 7 April 14 April Camera-ready copy due 2 May 2 May ICLP'2006 ORGANIZATION General Chair: Manuel Hermenegildo (herme(a)fi.upm.es) Program Co-Chairs: Sandro Etalle (s.etalle(a)utwente.nl) Mirek Truszczynski (mirek(a)cs.uky.edu) Workshop Chair: Christian Schulte (schulte(a)imit.kth.se) Doctoral Student Consortium: Enrico Pontelli (epontell(a)cs.nmsu.edu) Publicity Chair: Alexander Serebrenik (a.serebrenik(a)tue.nl) PROGRAM COMMITTEE Maria Alpuente Krzysztof Apt Annalisa Bossi Veronica Dahl Giorgio Delzanno Pierre Deransart Agostino Dovier Thomas Eiter Sandro Etalle, co-chair John Gallagher Michael Gelfond Hai-Feng Guo Manuel Hermenegildo Tomi Janhunen Fangzhen Lin Michael Maher Victor Marek Eric Monfroy Stephen Muggleton Brigitte Pientka Maurizio Proietti I.V. Ramakrishnan Peter van Roy Harald Sondergaard Mirek Truszczynski, co-chair German Vidal Andrei Voronkov Roland Yap CONFERENCE VENUE The conference will be a part of the fourth Federated Logic Conference (FLoC'06) to be held August 10-21, 2006, in Seattle, Washington (http://research.microsoft.com/floc06/) Other participating conferences are: Computer-Aided Verification (CAV), Rewriting Techniques and Applications (RTA), Logic in Computer Science (LICS), Theory and Applications of Satisfiability Testing (SAT), and Int'l Joint Conference on Automated Reasoning (IJCAR). Plenary events involving multiple conferences are planned. WORKSHOPS The ICLP-06 program will include several workshops. They provide a platform for the presentation of preliminary work and novel ideas in a less formal way than the conference itself. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The following workshops will be held in association with the ICLP-06 conference: * International Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS2006) * Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS) * International Workshop on Software Verification and Validation (SVV 2006) * Preferences and Their Applications in Logic Programming Systems Search and Logic: Answer Set Programming and SAT * 16th Workshop on Logic-Based Programming Environments (WLPE 2006) * MVLP'06: International Workshop on Multi-Valued Logic and Logic Programming

1 0

CFP: Workshop on Logics for Resource Bounded Agents
by Carlos Areces 15 Dec '05

15 Dec '05

WORKSHOP ON LOGICS FOR RESOURCE BOUNDED AGENTS http://www.cs.nott.ac.uk/~nza/LRBA06/ 7 - 11 August 2006 organized as part of the European Summer School on Logic, Language and Information (ESSLLI 2006) (http://esslli2006.lcc.uma.es/) 31 July - 11 August, 2005, Malaga, Spain Workshop organizers: Thomas Agotnes (agotnes(a)ii.uib.no) and Natasha Alechina (nza(a)cs.nott.ac.uk) Workshop purpose Logics of knowledge and belief, as well as other attitudes such as desire or intention, have been extensively studied. However, most of the treatments of knowledge and belief make strong and idealised assumptions about the reasoners. For example, traditional epistemic logic say that agents know all logical consequences of their knowledge. Similarly, logics of action and strategic interaction are usually based on game theoretic models which assume perfect rationality. Models based on such assumptions can be used to describe ideal agents without bounds on resources such as time, memory, etc, but they fail to accurately describe non-ideal agents which are computationally bounded. The workshop aims to provide a forum for advanced PhD students and researchers to present and discuss possible solutions to the problem of formally capturing the properties of knowledge, belief, action, etc. of non-idealised resource-bounded agents with colleagues and researchers who work in logic, computer science and other areas represented at ESSLLI. Workshop topics Topics include, but are not limited to, logical models of: - logically non-omniscient agents in general - explicit knowledge and belief - algorithmic knowledge - temporal logics of reasoning - active logics - knowledge and belief of reasoners with bounds on reasoning time - knowledge and belief of reasoners with bounded memory - knowledge and belief of reasoners with other resource bounds (e.g. bandwidth, sensing limitations) - other attitudes, such as desire, intention, etc., under bounded resources - limited awareness - paraconsistent logics - rational choice under bounded resources - games under bounded resources, e.g., - games with bounded recall - resource bounded reasoning about the structure of the game - incomplete information due to bounded resources Workshop details Authors are invited to submit a full paper either describing their published work (which should be instructive and interesting to PhD students working in the field and appropriate for presentation at the Summer School), or new and unpublished work. Submissions should not exceed 15 pages in LaTeX 11pt article style. The following formats are accepted: pdf, ps. Please send your submission electronically to bounded06(a)ii.uib.no. The submissions will be reviewed by the workshop's programme committee and additional reviewers. The accepted papers will appear in the workshop proceedings published by ESSLLI. It is likely that a selection of (revised and expanded) versions of the workshop papers will appear in a special issue of a journal. Workshop format The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consequtive days in the second week of ESSLLI. There will be 2 slots for paper presentation and discussion per session. On the first day the workshop organizers will give an introduction to the topic. Important dates * Submissions: March 8, 2006 * Notification: April 21, 2006 * Final papers for proceedings: May 1, 2006 * Final programme: June 21, 2006 * Workshop dates: 7- 11 August, 2006 Local arrangements All workshop participants including the presenters will be required to register for ESSLLI. The registration fee for authors presenting a paper will correspond to the early student/workshop speaker registration fee. Moreover, a number of fee waiver grants might be made available by the organizing committee on a competitive basis and workshop participants are eligible to apply for those. There will be no reimbursement for travel costs and accomodation. Workshop speakers who have difficulty in finding funding should contact the local organising committee to ask for the possibilities of a grant. Further information: About ESSLLI-2006: http://esslli2006.lcc.uma.es/ About the workshop: http://www.cs.nott.ac.uk/~nza/LRBA06/

1 0

Silly question on interactive import
by Jerzy Karczmarczuk 15 Dec '05

15 Dec '05

Could you remind me what is the easiest way to load interactively a specific module before loading a afile into ghci? For example, I have a file parse.hs with some functions such as isUpper, which belongs to the module Char. I thought that writing :m + Char :l parse would work, but loading destroys the access to the module Char. (:add as well). Well, I won't die if there is no way to do it. But am I obliged to import Char within parse? Of course, interactive import is illegal... Thanks. Jerzy Karczmarczuk

3 5

WxHaskell
by Morkai 15 Dec '05

15 Dec '05

Hi, I'm using GHC 6.4.1 and I've installed WxHaskell 0.9.4 from the batch file. When trying to run the examples in interactive mode I get the following error: *************** Loading package base-1.0 ... linking ... done. Compiling Main ( C:/Programmi/Tony/wxhaskell-0.9.4/samples/wxcore/He lloWorld.hs, interpreted ) C:/Programmi/Tony/wxhaskell-0.9.4/samples/wxcore/HelloWorld.hs:6:0: Failed to load interface for `Graphics.UI.WXCore': Bad interface file: C:\Programmi\Tony\wxhaskell-0.9.4\lib\imports/Graphi cs/UI/WXCore.hi mismatched interface file versions: expected 6041, found 6040 Failed, modules loaded: none. *************** Here the question: Is there some workaround to make WxHaskell running with my sistem (GHC 6.4.1) or I should downgrade to GHC 6.4?

4 5

Announcing hmp3 0.3
by dons＠cse.unsw.edu.au 15 Dec '05

15 Dec '05

A new version of hmp3 has been released, hopefully the last stable release for a while. Pretty much all features are done now. This release features, in particular, improved portability: * a simpler curses binding, requiring only basic XSI curses * thus runs on older OSs (Irix and Solaris at least) * b/w terminals should be handled properly * more state is stored persistently. * the binary size has shrunk Available as a cabalised src tarball, a darcs repo, and binaries for (currently): * Linux/x86 * FreeBSD/x86 * OpenBSD/x86 * OS X/ppc * Irix/mips64 http://www.cse.unsw.edu.au/~dons/hmp3.html Cheers, Don

1 0

[ANNOUNCE]: Ranged Sets
by Paul Johnson 14 Dec '05

14 Dec '05

From the README: Ranged sets allow programming with sets of values that are described by a list of ranges. A value is a member of the set if it lies within one of the ranges. The ranges in a set are ordered and non-overlapping, so the standard set operations can be implemented by merge algorithms in O(n) time. Obviously you can use this for sets of numbers, including things like Double that tend not to fit well into the enumerated membership model of conventional set implementations. But you can also have ranges of strings (or any other list of ordered types). So for example the set of all strings from "bar" to "foo" and "BAR" to "FOO" inclusive would be: strSet = rangedSet [ Range (BoundaryBelow "bar") (BoundaryAbove "foo"), Range (BoundaryBelow "BAR") (BoundaryAbove "FOO")] Note that this set includes "bar1" but not "foo1". I've created a SourceForge project for this, although I hope that once the library matures it will be included in the Base library package. The home page is at https://sourceforge.net/projects/ranged-sets/ I *think* I've also put the source in CVS, although at present the CVS web browser on SourceForge has not caught up with it. Paul.

3 3

PADL Deadline for Reduced Registration rate extended to 20th Dec.
by Logic Programming Rsrch Association 14 Dec '05

14 Dec '05

-------------------------------------------------------------------------------- CALL FOR PARTICIPATION CALL FOR PARTICIPATION [- Deadline for early registration extended to: Dec 20th.] Eighth International Symposium on Practical Aspects of Declarative Languages PADL 06 Charleston Place Hotel Charleston, South Carolina January 9-10, 2006 http://www.cs.brown.edu/people/pvh/PADL06.html Co-located with ACM's Principles of Programming Languages, (POPL Dates: January 11-13, 2006) You are cordially invited to attend the 8th Symposium on Practical Aspects of Declarative Languages to be held in Charleston, SC. PADL has a very interesting program that includes invited speakers as well contributed papers. Contributed papers range over diverse topics: from bioinformatics to music modeling to semantic web. Invited Speakers: Phil Wadler, University of Edinburgh, speaking on Links: Linking Theory to Practice for the Web David Roundy, Cornell University Implementing and verifying the darcs patch formalism Erik Meijer, Microsoft Research (title TBA) Contributed papers: Using CHRs to generate functional test cases for the Java Card Virtual Machine Sandrine-Dominique GOURAUD and Arnaud GOTLIEB. Generic Cut Actions for External Prolog Predicates Tiago Soares, Ricardo Rocha and Michel Ferreira. Controlling search space materialization in a practical declarative debugger Ian MacLarty and Zoltan Somogyi. Automatic Verification of a Model Checker by Reflection Bow-Yaw Wang. Probabilistic-logical Modeling of Music Jon Sneyers, Joost Vennekens and Danny De Schreye. Using Dominators for Solving Constrained Path Problems Luis Quesada, Peter Van Roy, Yves Deville and Raphakl Collet. JQuery: A Generic Code Browser with a Declarative Configuration Language Kris De Volder. A Hybrid BDD and SAT Finite Domain Constraint Solver Peter Hawkins and Peter Stuckey. Adding constraint solving to Mercury Ralph Becket, Maria Garcia de la Banda, Kim Marriott, Zoltan Somogyi, Peter Stuckey and Mark Wallace. Modeling Genome Evolution with a DSEL for Probabilistic Programming Martin Erwig and Steve Kollmansberger. Tabling in Mercury: Design and Implementation Zoltan Somogyi and Konstantinos Sagonas. Translating Description Logic Queries to Prolog Zsolt Nagy, Gergely Lukacsy and Piter Szeredi. Efficient top-down set-sharing analysis using cliques Jorge Navas, Francisco Bueno and Manuel Hermenegildo. Querying Complex Graphs Yanhong A. Liu and Scott D. Stoller. Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs Diptikalyan Saha and C. R. Ramakrishnan.

1 0

Re: Announcing Djinn, new version 2004-12-13
by Roy Dyckhoff 14 Dec '05

14 Dec '05

Chung-chieh Shan wrote: >I wonder why the only Church numerals Djinn found were 0 and 1? > > Djinn> :set +m > Djinn> num ? (a -> a) -> (a -> a) > num :: (a -> a) -> a -> a > num x1 x2 = x1 x2 > -- or > num _ x2 = x2 > >Very cool, in any case. > > Ken My answer would be the same as Lennart's; in detail, the point of this calculus (or, rather, the G4ip calculus on which the implementation is based) is that it is terminating---proofs are of bounded depth. (No loop-checking or tricks like "iterative deepening" are required.) The idea for the calculus goes back not to myself but to Vorob'ev (1950), and was rediscovered around 1988-1990 by several people, notably (and independently) Joerg Hudelmaier (Arch. Math. Logic 1992; JLC 1993), Pat Lincoln et al (LICS 1991) and myself (JSL 1992). I called the calculus "LJT"(the "T" is for terminating) and abandoned this when Herbelin later named two important related calculi "LJT" and "LJQ". "G4ip" is the name used in the Basic Proof Theory book by Troelstra & Schwichtenberg. Roy -- ------------------------------------------------------------------------ Roy Dyckhoff e-mail: rd(a)dcs.st-and.ac.uk (Researcher; Senior Lecturer; Director of Teaching; ...) School of Computer Science University of St Andrews tel: +44-1334-463267 North Haugh, St Andrews, ^fax: +44-1334-463278 Fife, KY16 9SX, Scotland secr: +44-1334-463253 *mob: +44-7985-266847 Home page: http://www.dcs.st-and.ac.uk/~rd * Mobile number is for emergency use only ;-) ^ There's also a personal e-fax number: +44-8707-064-446, which then sends me an e-mail with the fax as an attachment.

1 0