ns Co-Chair: Alex Potanin (Victoria University of Wellington, New
Zealand)
Publicity Chair: Lindsey Kuper (UC Santa Cruz, USA)
Student Research Competition Chair: Ravi Chugh (University of Chicago, USA)
Student Volunteer Co-Captain: Jakub Zalewski (University of Edinburgh, UK)
Student Volunteer Co-Ca
CALL FOR TUTORIAL PROPOSALS
ICFP 2018
23rd ACM SIGPLAN International Conference on Functional Programming
September 23-29, 2018
St. Louis, Missouri, United States
http://conf.researchr.org/home/ic
dler (Northwestern University, USA)
Artifact Evaluation Co-Chairs: Simon Marlow (Facebook, UK)
Ryan R. Newton (Indiana University, USA)
Industrial Relations Chair: Alan Jeffrey (Mozilla Research, USA)
Programming Contest Organiser: Matthew Fluet (Rochester Institute of
Tec
dler (Northwestern University, USA)
Artifact Evaluation Co-Chairs: Simon Marlow (Facebook, UK)
Ryan R. Newton (Indiana University, USA)
Industrial Relations Chair: Alan Jeffrey (Mozilla Research, USA)
Programming Contest Organiser: Matthew Fluet (Rochester Institute of
Tec
Ryan R. Newton (Indiana University, USA)
Industrial Relations Chair: Alan Jeffrey (Mozilla Research, USA)
Programming Contest Organiser: Matthew Fluet (Rochester Institute of
Technology, USA)
Publicity and Web Chair: Lindsey Kuper (Intel Labs, USA)
Student
ICFP 2018
The 23rd ACM SIGPLAN International Conference on Functional Programming
https://icfp18.sigplan.org
Call for Sponsorships
Web version of this call for sponsorships:
https://icfp18.sigplan.org/attending/supporting-
[ Please disregard previous version sent with the wrong subject line. ]
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2018
23rd ACM SIGPLAN International Conference on Functional Programming
September 23-29, 2018
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2018
23rd ACM SIGPLAN International Conference on Functional Programming
September 23-29, 2018
St. Louis, Missouri, United States
http://conf.researchr.
/
## Workshop Organization
Co-chairs:
* Lindsey Kuper (lind...@composition.al), Intel Labs
* Eric Walkingshaw (eric.walkings...@oregonstate.edu), Oregon State
University
Follow us on Twitter at https://twitter.com/wsdsldi
Program committee:
* Nada Amin (EPFL/University of Cambridge)
* Eric Holk
Organization
Co-chairs:
* Lindsey Kuper (lind...@composition.al), Intel Labs
* Eric Walkingshaw (eric.walkings...@oregonstate.edu), Oregon State
University
Follow us on Twitter at https://twitter.com/wsdsldi
Program committee:
* Nada Amin (EPFL/University of Cambridge)
* Eric Holk (Google)
* Gabriele
(University of Cambridge, UK)
PLMW Co-Chair: Dan Licata (Wesleyan University, USA)
PLMW Co-Chair: Brigitte Pientka (McGill University, Canada)
Programming Contest Organiser: Sam Lindley (University of Edinburgh, UK)
Publicity and Web Chair: Lindsey Kuper (Intel Labs, USA)
Student Research Competition
Organization
Co-chairs:
* Lindsey Kuper (lind...@composition.al), Intel Labs
* Eric Walkingshaw (eric.walkings...@oregonstate.edu), Oregon State University
Follow us on Twitter at https://twitter.com/wsdsldi
Program committee:
* Nada Amin (EPFL/University of Cambridge)
* Eric Holk (Google)
* Gabriele
d relevance. The program chair will be happy to advise on
any concerns about which category to submit to.
### Organizers
General Chair: Jeremy Gibbons (University of Oxford, UK)
Program Chair: Mark Jones (Portland State University, USA)
Artifact Evaluation Chair: Ryan R. Newton (Indiana Univers
aluation Chair: Ryan R. Newton (Indiana University, USA)
Industrial Relations Chair: Ryan Trinkle (Obsidian Systems LLC, USA)
Programming Contest Organiser: Sam Lindley (University of Edinburgh, UK)
Publicity and Web Chair: Lindsey Kuper (Intel Labs, USA)
Student Research Competition Chair: Ilya Sergey
dustrial Relations Chair: Ryan Trinkle (Obsidian Systems LLC, USA)
Programming Contest Organiser: Sam Lindley (University of Edinburgh, UK)
Publicity and Web Chair: Lindsey Kuper (Intel Labs, USA)
Student Research Competition Chair: Ilya Sergey (University College London, UK)
Video Chair: Jose C
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2017
22nd ACM SIGPLAN International Conference on Functional Programming
September 3-9, 2017
Oxford, United Kingdom
http://conf.researchr.org/home/i
, Northeastern University
Robby Findler, Northwestern University
Atsushi Igarashi, Kyoto Universty
Publicity Chair:
Lindsey Kuper, Intel Labs
Video Chair:
Iavor Diatchki, Galois
Jose Calderon, Galois
Student Volunteer Co-Chairs:
Yosuke Fukuda, Kyoto University
Yuki Nishida
==
CALL FOR SUBMISSIONS
SRC at ICFP 2016
Nara, Japan
18-24 September 2016
http://conf.researchr.org/info/icfp-2016/student-
The 2016 Commercial Users of Functional Programming (CUFP) call for
tutorials have passed the initial deadlines, but we have more seat for
tutors.
CUFP tutorial is a good opportunity if you have some idea you want to
spread to the real world, say, your favorite programming language
(Clojure, Erlan
SIGPLAN Programming Languages Mentoring Workshop @ ICFP
Nara, Japan (co-located with ICFP 2016)
Sunday, September 18th, 2016
http://conf.researchr.org/track/icfp-2016/PLMW-ICFP-2016/
We are pleased to invite students interested in functional programming
research to the programming languages mento
On Mon, Jun 3, 2013 at 11:29 PM, Robby Findler
wrote:
> I've written three little examples [...]
Thanks, Robby, this is an enormous help. I'll play with these and see
what can be done.
Lindsey
Racket Users list:
http://lists.racket-lang.org/users
Hi, Racketeers,
On Thu, Apr 4, 2013 at 9:32 PM, Robby Findler
wrote:
> One thing to watch out for, tho, is that redex uses source location
> information to typeset grammars and when macros are involved, the source
> locations (naturally) get mixed up. Since a macro can do arbitrary
> computation
On Thu, Apr 4, 2013 at 6:32 PM, Lindsey Kuper wrote:
> On Thu, Apr 4, 2013 at 11:15 AM, Matthias Felleisen
> wrote:
>> So, I think that you could use _Racket_'s syntax system to compute
>> the grammar. This is quite different from extending a base grammar
>> with
On Thu, Apr 4, 2013 at 11:19 AM, David Van Horn wrote:
> On 4/4/13 11:15 AM, Matthias Felleisen wrote:
>> On an unrelated note, you may wish to experiment with lambdaLVar
>> as a #lang so that you can write programs. Since you seem to be
>> designing a PL, I consider the practical evaluation as at
On Thu, Apr 4, 2013 at 11:15 AM, Matthias Felleisen
wrote:
>
> Lindsey, in your case, I believe the 'rabbit hole' can be avoided.
>
> From what I understand each family in lambdaLVar is (almost) uniformly
> generated from a grammar 'functor' that receives a lattice (let's say
> one for now), compu
On Wed, Apr 3, 2013 at 7:08 PM, David Van Horn wrote:
> This is a recurring issue with no current solution (as far as I know).
>
> http://lists.racket-lang.org/users/archive/2012-December/055488.html
Okay, thanks for the answers, David and Robby. It sounds like
transitive reinterpretation, as Da
I have a rather involved Redex question that I was originally going to
send to this list, but it got long enough that it was crying out for
hyperlinks and code formatting. So, here it is on Stack Overflow:
http://stackoverflow.com/questions/15800167/plt-redex-parameterizing-a-language-definition
On Mon, Jul 9, 2012 at 12:11 PM, Ryan Newton wrote:
> We felt it was necessary to include simultaneous steps (Matthias's [A]
> scenario) to model real parallel machines and force us to deal with
> potentially incompatible simultaneous updates to the store.
>
> Lindsey had a slightly awkward time s
On Sun, Jul 8, 2012 at 11:06 AM, David Van Horn wrote:
> I doubt that this helps, but just in case... another notion of parallel
> reduction is the one used in simple proofs of Church-Rosser, e.g.
>
>Masako Takahashi "Parallel Reductions in λ-Calculus", Information
>and Computation 118(1),
On Sun, Jul 8, 2012 at 9:30 AM, Robby Findler
wrote:
> Are there places where one side might do some effect that should be
> visible by the other one? If so, then I guess that you must have some
> way to identify those points so you make sure you cover all of the
> possible interleavings?
Yes. S
On Sat, Jul 7, 2012 at 8:04 PM, Robby Findler
wrote:
> No, there is no way to do that in Redex.
>
> Are you trying to model parallelism?
Yep. We could have just used single-hole contexts "E ::= (E e) | (e
E) | ... " that allow for the two expressions in (e1 e2) to be
evaluated in arbitrary order
Hi,
I have a Redex model for a language witih an explicitly parallel
reduction semantics, where an application (e1 e2) can step to (e1'
e2') -- that is, where both the operator and the operand can step at
once. Because we wanted to explicitly model this parallel reduction,
we first thought of usi
32 matches
Mail list logo
