FINAL CALL FOR PAPERS
Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM 2016)
St. Petersburg, Florida, January 18 - 19, 2016
http://conf.researchr.org/track/POPL-2016/pepm-2016-main
The 2016 PEPM workshop will be based on a broad interpretation of
semantics-based program
CALL FOR PAPERS
Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM 2016)
St. Petersburg, Florida, January 18 - 19, 2016
http://conf.researchr.org/track/POPL-2016/pepm-2016-main
The 2016 PEPM workshop will be based on a broad interpretation of
semantics-based program manipulation and
of Minnesota, USA
Program co-chairs:
Martin Erwig, Oregon State University, USA
Richard Paige, University of York, UK
Keynote speaker:
Don Batory, University of Austin, USA
http://planet-sl.org/sle2013
of Minnesota, USA
Program co-chairs:
Martin Erwig, Oregon State University, USA
Richard Paige, University of York, UK
Keynote speaker:
Don Batory, University of Austin, USA
http://planet-sl.org/sle2013
All the previous solutions seem to assume that the list of numbers is already
sorted. In cases where this assumption cannot be made, an alternative solution
is to simply insert the numbers into a diet.
eecs.oregonstate.edu/~erwig/papers/abstracts.html#JFP98
One of my students has worked on scripting approach in Haskell:
http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html#SLE09
--
Martin
On May 3, 2010, at 9:51 AM, Limestraël wrote:
Hello Café,
I don't know if you know conky. It's a well-known open-source system monitor
On May 3, 2010, at 3:45 PM, Limestraël wrote:
Thank you all, that's very interesting.
Martin, I've started reading the paper, I like the way you think about what a
scripting language should provide (traceability, error handling and a type
system).
But, hold me if I'm wrong, but at no
of the faculty working in these areas (Martin Erwig,
Margaret Burnett, Carlos Jensen and colleagues). Several faculty
colleagues also have openings in these areas that are recent, and have
not yet been announced.
The positions can start as early as Spring term, but no later than
Fall term of 2009
Heads up, ACM members!
As fans of functional programming, you can provide input on the future
of the CS curriculum guidance provided by ACM. In particular, you
could support the SIGPLAN alternate proposal for the programming
language part
On Apr 3, 2007, at 12:06 AM, Jacob Atzen wrote:
On Mon, Mar 26, 2007 at 03:41:10PM +0200, Jacob Atzen wrote:
This lead me to the question: Are there any scientific empirical
studies
of the values of static / stronger type systems as found in
Haskell, C#
or Java in real world settings? Or
FGL - A Functional Graph Library, Version: April 2007
=
A new release of the Functional Graph Library for Haskell
is available at:
http://eecs.oregonstate.edu/~erwig/fgl/haskell/
This release fixes some bugs in the implementation of
several
On Jul 26, 2006, at 6:59 AM, Robert Dockins wrote:
On Jul 26, 2006, at 12:44 AM, Sukit Tretriluxana wrote:
Dear expert Haskellers,
I am a newbie to Haskell and try to write several algorithms with
it. One of them is the string permutation which generates all
possible permutations using
FGL - A Functional Graph Library, Version: June 2006
A new release of the Functional Graph Library for Haskell
is available at:
http://eecs.oregonstate.edu/~erwig/fgl/haskell/
This release mainly fixes some bugs and improves a few
function
On Apr 11, 2006, at 11:18 AM, Paul Johnson wrote:
In the recent discussion on Haskell as a disruptive technology I
predicted that MS would incorporate functional programming into its
languages.
MS does this already, for quite some time. The product is called ...
Excel.
Any spreadsheet
On Dec 12, 2005, at 12:06 PM, Tomasz Zielonka wrote:
On Sun, Dec 11, 2005 at 11:14:46PM +, Paul Johnson wrote:
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
FGL - A Functional Graph Library, Version: February 2005
I am happy to announce a new release of the Functional Graph Library
for Haskell, a collection of graph algorithms and tools.
Changes since the last release (from January 2004):
*
On Feb 3, 2005, at 2:13 AM, Simon Marlow wrote:
Prelude Data.Graph.Inductive.Example.clr486
GHCi runtime linker: fatal error: I found a duplicate definition
for symbol
_DataziGraphziInductiveziInternalziFiniteMap_Empty_closure
whilst processing object file
On Feb 3, 2005, at 8:21 AM, Simon Marlow wrote:
On 03 February 2005 16:11, Martin Erwig wrote:
On Feb 3, 2005, at 2:13 AM, Simon Marlow wrote:
Prelude Data.Graph.Inductive.Example.clr486
GHCi runtime linker: fatal error: I found a duplicate definition
for symbol
I encountered the following problem while loading a package,
and ghci (version 6.2) told me to report it to this list.
Loading package fgl ... linking ...
/usr/local/lib/ghc-6.2/HSfgl.o: unknown symbol
`_DataziTree_flatten_entry'
ghc-6.2: panic! (the `impossible' happened, GHC version 6.2):
, because it overlaps with every
arity-2 type constructor.
In particular, it overlaps with Eq (a,b)
I'm copying Martin Erwig, who is, I think the maintainer of the
fgl/ package, because
it seems to me that it should be fixed.
I will probably have some time in January 2005 to work
FGL - A Functional Graph Library, Version: January 2004
===
I am happy to announce a new release of the Functional Graph Library
for Haskell, a collection of graph algorithms and tools.
New in this release:
* bug fix for nearestNode
Marcin 'Qrczak' Kowalczyk writes:
W li¶cie z ¶ro, 12-11-2003, godz. 11:06, Graham Klyne pisze:
I've sometimes thought that a functional language would be the ideal
platform to usher in a purely graphical style of programming;
I don't understand why so many people talk about graphical
FGL - A Functional Graph Library, Version: September 2002
=
I am happy to announce a new release of the Functional Graph
Library for Haskell, a collection of graph algorithms and tools.
New in this release:
* Introduction of graph
A new version of the Functional Graph Library for Haskell
is available at:
www.informatik.fernuni-hagen.de/pi4/erwig/fgl/haskell/
(Changes since the last version: User Guide available,
several new and changed functions)
--
Martin
Frank A. Christoph writes:
I have a humble wish for the Wish List.
I wish this function was in the Prelude or standard library:
concatSep :: [a] - [[a]] - [a]
with semantics
concatSep _ [] = []
concatSep _ [xs] = [xs]
concatSep sep (xs:xss) = xs ++ sep ++ concatSep sep
25 matches
Mail list logo
