Igal was a volunteer and core contributor for a large number of projects and groups in the Portland tech scene. He helped create Calagator, our community calendar, and became one of its core maintainers. He coordinated a number of user groups for several years, including pdxruby, pdxfunc, and pdxdevops. He was one of the founding committee members for Open Source Bridge, spending long nights to develop our OpenConferenceWare software in time to launch the conference. He hosted some of the most enlightening and entertaining BarCamp Portland and WhereCampPDX sessions on topics like Trains!, Strange Maps, Things that Hover, and more. He was also a skilled photographer and friend to all cats.

We have set up koshevoy.net to help our community celebrate Igal’s life. Please share memories, photos or words of remembrance, and read what others have shared. We have also created a Facebook page, and on Twitter we request that you use the hashtag #igalko or his twitter handle @igalko.

Levent Erkok will be giving an informal talk on the SBV library that he's been working on for quite some time now (https://hackage.haskell.org/package/sbv), and a possible brief intro to SAT/SMT solving.

http://groups.google.com/group/pdxfunc

With OSCON in town this week, bringing to town many from the functional programming community among others, we thought it would be a good idea to hold a casual functional programming meetup. There's no agenda and no talks, but there will be beer and good conversation.

We'll be meeting up on the patio at Green Dragon. If you're just visiting and are worried you won't recognize the geeks when you get there (we're usually easy enough to spot), feel free to ping people on the PDXFunc mailing list (https://groups.google.com/forum/#!forum/pdxfunc) or on IRC at #pdxfunc.

Title: Adventures in Foreign Function Interfaces

Speaker: Joel Stanley

        Galois, Inc.

Date: Tuesday, August 19th, 10.30am

Location: Galois, Inc.

        421 SW 6th Ave. Suite 300
        (3rd floor of the Commonwealth Building)
        Portland, Oregon

Abstract:

In-process integration and data exchange between multiple language
runtimes is a classic software engineering challenge.  This talk
describes our experiences in building an open-source tool for
generating an "FFI bridge" between Poly/ML and OCaml, via the common
C FFI provided by both language's runtimes.

The first intended use of this tool is to programmatically generate
a bridge between Isabelle (on the Poly/ML side) and Intel's Decision
Procedure Toolkit API (on the OCaml side).

About the Galois Tech Talks.

Galois (http://galois.com) has been holding weekly technical
seminars for several years on topics from functional programming,
formal methods, compiler and language design, to cryptography, and
operating system construction, with talks by many figures from the
programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping
a note to <[email protected]> is appreciated, but not required.
If you're interested in giving a talk, we're always looking for new
speakers. 

Just a quick note about next week's Galois Tech Talk. Now that Galois has completed its move into downtown Portland, and a shiny new, centrally located, office space, we're opening up our tech talk series a bit more widely. If you're in Portland, and interested in functional programming and formal methods, drop by!

TITLE: Stream Fusion for Haskell Arrays

speaker: Don Stewart DATE: Tuesday, July 15th, 10.30am sharp.

LOCATION:
Galois, Inc. 421 SW 6th Ave. Suite 300 (3rd floor of the Commonwealth Building) Portland, Oregon

ABSTRACT:

Arrays have traditionally been an awkward data structure for Haskell programmers. Despite the large number of array libraries available, they have remained relatively awkward to use in comparison to the rich suite of purely functional data structures, such as fingertrees or finite maps. Arrays have simply not been first class citizens in the language.

In this talk we'll begin with a survey of the more than a dozen array types available, including some new matrix libraries developed in the past year. I'll then describe a new efficient, pure, and flexible array library for Haskell with a list like interface, based on work in the Data Parallel Haskell project, that employs stream fusion to dramatically reduce the cost of pure arrays. The implementation will be presented from the ground up, along with a discussion of the entire compilation process of the library, from source to assembly.

ABOUT THE GALOIS TECH TALKS:

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, Don's always looking for new speakers.

Title: GpuGen: Bringing the Power of GPUs into the Haskell World

Speaker: Sean Lee

       Programming Languages & Systems
       UNSW, Sydney

Date: Tuesday, September 2nd.

       10.30am

Location: Galois, Inc.

       421 SW 6th Ave. Suite 300
       (3rd floor of the Commonwealth Building)
       Portland, Oregon

Abstract:

For the last decade, the performance of GPUs has out-grown CPUs, and their programmability has also improved to the level where they can be used fo general-purpose computations. Nonetheless, GPU programming is still limited only to those who understand the hardware architecture and the parallel processing. This is because the current GPU programming systems are based on the specialized parallel processing model, and require low-level attention in many aspects such as thread launching and synchronization.

The need for a programming system which provides a high-level abstraction layer on top of the GPU programming systems without losing the performance gain arises to facilitate the use of GPUs. Instead of writing a programming system from the scratch, the development of a Haskell extension has been chosen as the ideal approach, since the Haskell community has already accumulated a significant amount of research and resources for Nested Data Parallelism, which could be adopted to provide a high-level abstraction on GPU programming and even to broaden the applicability of GPU programming. In addition, the Foreign Function Interface of Haskell is sufficient to be the communication medium to the GPU.

GpuGen is what connects these two dots: GPUs and Haskell. It compiles the collective data operations such as scan, fold, map, etc, which incur most computation cost, to the GPU. The design of the system, the structure of the GpuGen compiler, and the current development status are to be discussed in the talk.

Biographical details:

Sean Lee is a PhD candidate at the UNSW, Sydney, working in the Programming Languages & Systems Group. This summer he's been interning at Nvidia in Santa Clara, working on programming GPUs with Haskell.

About the Galois Tech Talks.

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

TITLE: Pretty-Printing a Really Long Formula (or, "What a Mathematician Could Learn from Haskell")

SPEAKER: Lee Pike, R&D Engineering, Galois, Inc.

DATE: Tuesday, September 9th. 10.30am

LOCATION:
Galois, Inc. 421 SW 6th Ave. Suite 300 (3rd floor of the Commonwealth Building) Portland, Oregon

ABSTRACT:

To the typical engineer or evaluator, mathematics can be scary, logic can be scarier, and really long specifications can simply be overwhelming. This talk is about the problem of the visual presentation of formal specifications clearly and concisely. We take as our initial inspiration Leslie Lamport's brief paper, "How to Write a Long Formula" and "How to Write a Proof" in which he proposes methods for writing the long and tedious formulas and proofs that appear in formal specification and verification.

I will describe the problem and present one particular solution, as implemented in a simple pretty-printer I've written (in Haskell), that uses indentation and labels to more easily visually parse long formulas. Ultimately, I propose a "HOL Normal Form" for presenting specifications, much like BNF is used for presenting language definitions.

BIOGRAPHICAL DETAILS:

http://galois.com/company/people/lee_pike/

ABOUT THE GALOIS TECH TALKS.

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

Duncan Coutts, from Well-Typed (http://well-typed.com), will be giving a tech talk tomorrow about the technical direction of Cabal, Haskell package infrastructure, and the problems of managing very large amounts of Haskell code.

...

TITLE: The Future of Cabal -- "A language for build systems" and "Constraint solving problems in package deployment"

SPEAKER: Duncan Coutts, Well-Typed, LLP

DATE: Tuesday, Oct 7, 2008 10.30am

LOCATION: Galois, Inc. 421 SW 6th Ave. Suite 300 (3rd floor of the Commonwealth Building) Portland, Oregon

ABSTRACT:

This will be an informal talk and discussion on two topics:

1. A language for build systems

Build systems are easy to start but hard to get right. We'll take the view of a language designer and look at where our current tools fall down in terms of safety/correctness and expressiveness.

We'll then consider some very early ideas about what a build system language should look like and what properties it should have. Currently this takes the form of a design for a build DSL embedded in Haskell.

1. Constraint solving problems in package deployment

We are all familiar, at least peripherally, with package systems. Every Linux distribution has a notion of packages and most have high level tools to automate the installation of packages and all their dependencies. What is not immediately obvious is that the problem of resolving a consistent set of dependencies is hard, indeed it is NP-complete. It is possible to encode 3-SAT or Sudoku as a query on a specially crafted package repository.

We will look at this problem in a bit more detail and ask if the right approach might be to apply our knowledge about constraint solving rather than the current ad-hoc solvers that most real systems use. My hope is to provoke a discussion about the problem.

We can concentrate on one topic or the other depending on peoples interest.

ABOUT THE GALOIS TECH TALKS:

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

Title: Theorem Proving for Verification

Speaker: John Harrison

        Principal Engineer
        Intel

Date: Tuesday, September 16th.

        10.30am

Location: Galois, Inc.

        421 SW 6th Ave. Suite 300
        (3rd floor of the Commonwealth Building)
        Portland, Oregon

Abstract:

The theorem proving approach to verification involves modelling a system in a rich formalism such as higher-order logic or set theory, then performing a human-driven interactive correctness proof using a proof assistant. In a striking contrast, techniques like model checking, by limiting the user to a less expressive formalism (propositional logic, CTL etc.), can offer completely automated decision methods, making them substantially easier to use and often more productive.

With this in mind, why should one be interested in the theorem proving approach? In this tutorial I will explain some of the advantages of theorem proving, showing situations where the generality of theorem proving is beneficial, allowing us to tackle domains that are beyond the scope of automated methods or providing other important advantages. I will talk about the state of the art in theorem proving systems and and give a little demonstration to give an impression of what it's like to work with such a system.

Biographical details:

John Harrison has worked in formal verification and automated theorem proving since 1990, when he joined Mike Gordon's "Hardware Verification Group" (HVG) at the University of Cambridge Computer Laboratory. As well as working on the development of the HOL theorem prover, he developed a particular interest in the formalization of real analysis and its application to formal verification of floating-point hardware. His PhD in this area, "Theorem Proving with the Real Numbers", written under Mike Gordon's supervision, won a UK Distinguished Dissertation award and was published as a book. He also redesigned HOL from scratch, resulting in an alternative version called HOL Light. After completing his PhD research in 1995, John Harrison spent a very enjoyable year at Abo Akademi University and Turku Centre for Computer Science (TUCS) in Turku, Finland, where he was a member of Ralph Back's Programming Methods Research Group. Among other activities, he championed the "declarative" proofs of the Mizar system and showed how these could be integrated into other theorem-provers, work subsequently taken up in DECLARE, Isar and other systems.

John Harrison then returned to Cambridge and worked on a formal model of floating-point arithmetic and its application to the verification of some realistic algorithms for transcendental functions. This work attracted the attention of Intel, and in 1998 John Harrison joined the company as a Senior Software Engineer (now Principal Engineer) specializing in the design and formal verification of mathematical algorithms. He has formally verified and in many cases designed or redesigned numerous algorithms for mathematical functions including division, square root and transcendental functions.

In his limited spare time over the past 10 years, John Harrison has been working on a book giving a comprehensive introduction to automated theorem proving.  (http://www.cambridge.org/9780521899574)

About the Galois Tech Talks.

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to <[email protected]> is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

Next week's tech talk, a special treat, with Jason Dagit (aka. lispy on

haskell) dropping by to talk about using GADTs to clean up darcs' patch

theory implementation.

TITLE: Type Correct Changes A Safe Approach to Version Control Implementation

speaker: Jason Dagit

LOCATION: Galois, Inc. 421 SW 6th Ave. Suite 300 (3rd floor of the Commonwealth Building) Portland, Oregon

ABSTRACT:

This will be a talk about Darcs and type safe manipulations of changes:

Darcs is based on a data model, known as Patch Theory, that sets it apart from other version control systems. The power of this data model is that it allows Darcs to manage significant complexity with a relatively straightforward user interface.

We show that Generalized Algebraic Data Types (GADTs) can be used to express several fundamental invariants and properties derived from Patch Theory. This gives our compiler, GHC, a way to statically enforce our adherence to the essential rules of our data model.

Finally, we examine how these techniques can improve the quality of the darcs codebase in practice.

PRESENTER:

Jason Dagit graduated from Oregon State University with B.S. degrees in Computer Science and Mathematics. He is currently employed at PTV America while completing his Masters degree at Oregon State under co-advisors Dr. David Roundy and Dr. Martin Erwig. During his time in graduate school he has studied both usability and programming languages. He participated in the 2007 Google Summer of Code where he worked under Dr. Roundy to improve Darcs conflict handling.

ABOUT THE GALOIS TECH TALKS:

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

Title: Left-fold enumerators

        Towards a safe, expressive and efficient I/O interface for Haskell

Speaker: Johan Tibell

        Software Engineer
        Google

Date: Monday, September 15th.

        1pm

Location: Galois, Inc.

        421 SW 6th Ave. Suite 300
        (3rd floor of the Commonwealth Building)
        Portland, Oregon

Abstract:

I will describe a programming style for I/O operations that is based on left-fold enumerators. This style of programming is more expressive than imperative style I/O represented by the Unix functions read and write, and safer than lazy I/O using streams. Left-fold enumerators offers both high-performance using block based I/O and safety in terms of error handling and resource usage. I will demonstrate Hyena, a web server prototype written in Haskell, as an example of left-fold enumerator style of programming.

This talk is intended as a starting point for further discussions on what would be a good interface for I/O rather than a presentation of finished research.

About the Galois Tech Talks.

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to  is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

Title: Bluespec: Advanced Modeling, Design and Verification using High-Level Synthesis Speaker: Rishiyur Nikhil CTO, Bluespec, Inc. Date: Thursday, October 2nd. 10.30am Location: Galois, Inc., 421 SW 6th Ave. Suite 300, (3rd floor of the Commonwealth Building)

ABSTRACT:

Over the past few years, several projects in major companies have been adopting BSV (Bluespec SystemVerilog) as their next-generation tool of choice for IP design, modeling (for both architecture exploration and early software development), and verification enviroments.

The reason for choosing BSV is its unique combination of:

(1) excellent computation model for expressing complex concurrency and communication, based on atomic transactions and atomic transactional inter-module methods

(2) very high level of abstraction and parameterization (principally inspired by Haskell)

(3) full synthesizability, enabling execution on FPGAs, obtaining better performance (3 to 4 orders of magnitude) and scalability than software simulation at comparable levels of detail.

In this presentation, I will provide a brief technical overview of BSV (points 1-3 above), and describe several customer projects using BSV. I will also briefly contrast BSV with other approaches to High Level Synthesis (particularly those based on C/C++/SystemC).

BIOGRAPHY:

Rishiyur S. Nikhil is co-founder and CTO of Bluespec, Inc., which develops tools that dramatically improve correctness, productivity, reuse and maintainability in the design, modeling and verification of digital designs (ASICs and FPGAs). The core technologies consist of a language, BSV (Bluespec SystemVerilog), which enables very abstract source descriptions based on scalable atomic transactions and extreme parameterization, and tools for high-quality synthesis of BSV into RTL. Earlier, from 2000 to 2003, he led a team inside Sandburst Corp. (later acquired by Broadcom) developing Bluespec technology and contributing to 10Gb/s enterprise network chip models, designs and design tools.

From 1991 to 2000 he was at Cambridge Research Laboratory (DEC/Compaq), including one and a half years as Acting Director. From 1984 to 1991 he was a professor of Computer Science and Engineering at MIT. He has led research teams, published widely, and holds several patents in functional programming, dataflow and multithreaded architectures, parallel processing, compiling, and EDA. He is a member of ACM and IFIP WG 2.8 on Functional Programming, and a Senior Member of IEEE. He received his Ph.D. and M.S.E.E. in Computer and Information Sciences from the Univ. of Pennsylvania, and his B.Tech in EE from IIT Kanpur.

ABOUT THE GALOIS TECH TALKS:

Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

HacPDX is an opportunity to join Portland Haskell hackers in building and improving Hackage libraries and tools. If you've never been, Hackathons are typically not only a good opportunity for experienced devs to work together but also a great way for newcomers to get involved in the community.

Visit this website for complete details: http://www.haskell.org/haskellwiki/HacPDX

Room: Portland State University, The Vanport Room (rm 338), Smith Memorial Student Union. The building is at Harrison and Broadway; enter via door on Harrison and take stairs to 3rd floor.

Content: Series of presentations by distinguished members of the FP community from around the world:

• Algebra of Programming using Dependent Types. Shin-Cheng Mu (Academia Sinica)
• Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. Lars Birkedal (IT University of Copenhagen)
• A Compiler on a Page. Kristoffer Rose (IBM Thomas J. Watson Research Center)
• A Proof Theory for Compilation. Atsushi Ohori (Tohoku University)
• Data Parallelism in Haskell. Manuel Chakravarty (University of New South Wales)
• Push-down control-flow analysis of higher-order programs. Matthew Might (University of Utah)
• Slicing It: indexed containers in Haskell. Conor McBride (University of Strathclyde)
• Daan Leijen (Microsoft Research)
• Koen Claessen (Chalmers University of Technology)
• Taking the monad laws seriously. Andrzej Filinski (University of Copenhagen)
• A compiler front-end for Mini-ML and its Coq proof of correctness. Xavier Leroy (INRIA Paris-Rocquencourt)

Idris is a dependently typed language that looks pretty much like Haskell with depedent types.

Its creator, Edwin Brady will be in town this Friday, and says he can give an impromptu talk or demo on some of his latest work in the language.

Come get your copy of the Idris compiler autographed!

TOPIC: Large Scale Monadic Refinement - Tales from L4.verified

SPEAKER: Thomas Sewell, NICTA

DATE: Wednesday , August 27th, 10.30am

LOCATION: Galois, Inc. 421 SW 6th Ave. Suite 300 (3rd floor of the Commonwealth Building) Portland, Oregon

ABSTRACT: Components of operating systems have emerged as an attractive target for formal analysis, thanks to the key importance of operating system correctness in establishing the security of a range of applications. These systems present a number of unique challenges for analysis, including their low level implementation and their detailed view of the system state. This talk will address none of these, instead focusing on the challenges of reasoning about (relatively) large, non-modular, inherently imperative software artefacts.

The talk will describe the formalisation of the seL4 microkernel using a state monad with nondeterminism and exceptions, present a refinement and Hoare calculus, and discuss the impact of this chosen approach on the effectiveness of the overall verification effort.

BIOGRAPHICAL DETAILS: Thomas Sewell is a software engineer with an interest in pure mathematics. He obtained his BE & BSc from UNSW in 2006, and has been working as a proof engineer for NICTA's L4.verified project for two and a half years.

ABOUT THE GALOIS TECH TALKS. Galois (http://galois.com) has been holding weekly technical seminars for several years on topics from functional programming, formal methods, compiler and language design, to cryptography, and operating system construction, with talks by many figures from the programming language and formal methods communities.

The talks are open and free. If you're planning to attend, dropping a note to [email protected] is appreciated, but not required. If you're interested in giving a talk, we're always looking for new speakers.

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

Portland Functional Programming Meetup: http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

Portland Functional Programming Meetup: http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

We'll discuss Chapter 3 of Pearls of Functional Algorithm Design. Please read it beforehand. You may wish to try running the code examples from the book. At the meeting anyone will be able to present and contribute to the discussion.

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc

Info at https://www.meetup.com/Portland-Functional-Programming-Study-Group/

PDXFunc is a study/user group exploring functional programming in Portland, Oregon. The group welcomes programmers with any level of experience or interest in any functional language, including Haskell, Lisp, OCaml, Scala, Idris, Agda, as well as using functional techniques in not explicitly functional languages.

We have two kinds of meetings: theory and practice, that each meet twice a month.

Please sign up for the mailing list for more announcements, discussions, meeting notes, etc.:

http://groups.google.com/pdxfunc