Oliver Bandel | 27 Jul 22:39 2014

Ocaml / Gtk+ / Tk / lablgtk / labltk / clist / tableview


I want to have a Widget with a Gtk+ clist
(or TK-enhancement's tableview) with some buttons (or radioboxes)
left side oriented of each of the rows.

I first tried to use lablgtk and there the clist,
and add some buttons in front (leftsided) of the rows.
I found no way to make the buttons of same height
as the clist-rows (other by tring to make the
rows-height as the seemingly default of the buttons).
(What if the defaults of heights change after a new version, then the  
GUI looks broken.)

So I thought about switching to Tk / labltk.
The GUI usage of Tk seemed much easier to me then.
But there is no aeuqivalent to Gtk+'s clist (GList.clist in labltk).
But there seems to be a tableview-widget, which could help me,
but which is *not* part of the official Tk-core.

But there is a library that can be used, so adding it would be fine.

But there seem to be no OCaml-binding for it.

So I may switch back and try it again in lablgtk?

I heard there is a more general version of the clist,
that also allows adding *any* button in the list/table,
not just text-entries.
Which widget to use for this?
(Continue reading)

Jacob Johannsen | 27 Jul 15:00 2014

PPDP 2014: Program and 2nd Call for Participation



			      PPDP 2014
		   16th International Symposium on
	  Principles and Practice of Declarative Programming
		Canterbury, Kent, September 8-10, 2014
                           co-located with

			     LOPSTR 2014
		   24th International Symposium on
	   Logic-Based Program Synthesis and Transformation
		Canterbury, Kent, September 9-11, 2014


Two weeks left for early registration (until August 8):

A significant discount is available when registering to both events,
especially as a student (until August 8).

PPDP 2014 features
* an invited talk by Roberto Giacobazzi, shared with LOPSTR:
   "Obscuring Code -- Unveiling and Veiling Information in Programs"
* no fewer than 4 distilled tutorials by
(Continue reading)

GRLMC | 26 Jul 15:57 2014

LATA 2015: 1st call for papers

*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*



LATA 2015

Nice, France

March 2-6, 2015

Organized by:

CNRS, I3S, UMR 7271
Nice Sophia Antipolis University

Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University




LATA is a conference series on theoretical computer science and its applications. Following the
tradition of the diverse PhD training events in the field developed at Rovira i Virgili University in
Tarragona since 2002, LATA 2015 will reserve significant room for young scholars at the beginning of
their career. It will aim at attracting contributions from classical theory fields as well as
(Continue reading)

MICAI 2014 | 25 Jul 13:50 2014

CFP: MICAI 2014: keynotes Vapnik (SVM), Sowa (conceptual graphs), Liu (opinion mining), Castillo (fuzzy logic)

        MICAI-2014: 13th Mexican International Conference on 

        One-week draft abstracts deadline reminder

        EXCELLENT KEYNOTES: Vapnik, Sowa, Liu, Castillo

        Excellent touristic program

        - 7th Intelligent Learning Environments
        - 1st Recognizing Textual Entailment and Question Answering
        - 7th Hybrid Intelligent Systems

        - John Sowa: Conceptual graphs and knowledge representation
        - Bing Liu: Opinion mining and sentiment analysis
        - Oscar Castillo: Fuzzy logic
        and more

        November 16 to 22, 2014 - Tuxtla Gutierrez, Chiapas, Mexico
        Publication: Springer LNAI (EI, ISI), IEEE CPS, journals
        Submission: July 31 draft abstract / Aug 6 full text 
        (late submissions can be considered)


Topics: all areas of Artificial Intelligence, research or applications.
Workshops. Tutorials. Doctoral Consortium. Best papers awards.

(Continue reading)

Pascal Hitzler | 25 Jul 20:10 2014

CfP:Linked Dataset descriptions. Special call of the Semantic Web journal

Special Call of the Semantic Web journal for


Linked Data is a key enabler for the Semantic Web vision and one of the 
steps towards a truly "Semantic Web".

The Semantic Web journal calls for brief papers (usually about 5-8 
pages) containing a concise description of a Linked Dataset. The paper 
shall describe in concise and clear terms key characteristics of the 
dataset as a guide to its usage for various (possibly unforeseen) 
purposes. In particular, such a paper shall typically give information, 
amongst others, on the following aspects of the dataset (if applicable).

     Name, URL, versioning, licensing, availability
     Topic coverage, source for the data
     Purpose of the Linked Dataset, e.g. demonstrated by relevant 
queries or inferences over it
     Applications using the dataset and other metrics of use
     Creation, maintenance and update mechanisms as well as policies to 
ensure sustainability and stability
     Quality, quantity and purpose of links to other datasets
     Domain modeling and use of established vocabularies
     Examples and critical discussion of typical knowledge modeling 
patterns used
     Known shortcomings of the dataset
     A discussion of the dataset in the context of the Five Stars of 
Linked Data Vocabulary Use, 

(Continue reading)

Jost Berthold | 25 Jul 20:01 2014

Call for participation: Functional High-Performance Computing (FHPC) 2014

The 3rd ACM SIGPLAN Workshop on Functional High Performance Computing 
(FHPC 2014) will be held in Gothenburg on September 4 (immediately after 

FHPC features exciting talks about a range of topics: optimizing 
compilation, GPU computing, computing on heterogeneous platforms, as 
well as parallel applications and programming patterns.
It will be a very enjoyable workshop so please consider attending.

The full workshop programme is available at

Registration for FHPC is done using the ICFP registration site.

Online registration for both ICFP and FHPC starts here:

Note that the last day for early registration at ICFP and associated 
workshops is August 3!

With best wishes
Mary Sheeran, Ryan Newton, and Jost Berthold


Caml-list mailing list.  Subscription management and archives:
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

(Continue reading)

Maurizio Proietti | 24 Jul 22:44 2014

LOPSTR 2014: Call for Participation

===================== CALL FOR PARTICIPATION =============================

                                               24th International Symposium on
                               Logic-Based Program Synthesis and Transformation
                                                             LOPSTR 2014

                          University of Kent, Canterbury, UK, September 9-11, 2014

                  Co-located with the 16th International ACM SIGPLAN Symposium on 
                    Principles and Practice of Declarative Programming (PPDP 2014)

Early registration by August 8, 2014

Invited Speakers:
     Roberto Giacobazzi (University of Verona, Italy)
"Obscuring Code -- Unveiling and Veiling Information in Programs"
     Viktor Kuncak (EPFL, Switzerland)
Title to be announced

Accepted papers
- Nikita Danilenko
Functional Kleene Closures
- Amer Tahat and Ali Ebnenasir
A Hybrid Method for the Verification and Synthesis of Parameterized Self-Stabilizing Protocols
- German Vidal
Concolic Execution and Test-Case Generation in Prolog
- Henning Christiansen and Maja Kirkeby
Confluence Modulo Equivalence in Constraint Handling Rules
- Remis Balaniuk
Drill & Join: A method for inductive program synthesis
- Minoru Kinoshita, Kohei Suenaga and Atsushi Igarashi
Automatic Synthesis of Combiners in the MapReduce Framework - An Approach with Right Inverse
- Daniel De Schreye, Vincent Nys and Colin Nicholson
Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction
- Daniel Gall and Thom Frühwirth
A Formal Semantics for the Cognitive Architecture ACT-R
- J. Robert M. Cornish, Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard and Peter J. Stuckey
Analyzing array manipulating programs by program transformation
- Nada Sharaf, Slim Abdennadher and Thom Frühwirth
A Visualization Tool for Constraint Handling Rules
- Salvador Lucas, Jose Meseguer and Raúl Gutiérrez
Extending the 2D DP Framework for CTRSs
- Ahmed Nagah, Amira Zaki and Slim Abdennadher
Exhaustive Execution of CHR through Source-to-Source Transformation
- Sandra Alves, Anatoli Degtyarev and Maribel Fernandez
Access control and obligations in the category-based metamodel: A rewrite-based semantics
- James Lipton, Emilio Jesús Gallego Arias and Julio Mariño
A Declarative Compilation of Constraint Logic Programming
- Jose F. Morales and Manuel V. Hermenegildo
Pre-indexed Terms for Prolog
- Norbert Preining, Kokichi Futatsugi and Kazuhiro Ogata
Liveness properties in CafeOBJ - a case study for meta-level specifications
- Wlodzimierz Drabent
On completeness of logic programs
- Ranjeet Singh and Andy King
Partial Evaluation for Java Malware Detection
- Raul Gutierrez and Salvador Lucas
Below Frozen Positions
- Md Solimul Chowdhury, Jia-Huai You, Wu Chen, Arash Karimi and Fangfang Liu
Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies

Program Co-Chairs:
     Maurizio Proietti, IASI-CNR, Italy (maurizio.proietti <at> iasi.cnr.it)
     Hirohisa Seki, Nagoya Institute of Technology, Japan (seki <at> nitech.ac.jp)

Symposium Co-Chairs:
     Olaf Chitil and Andy King
     School of Computing, University of Kent, UK 

Organizing Committee:
     Emanuele De Angelis, University of Chieti-Pescara and IASI-CNR, Italy 
     Fabrizio Smith, IASI-CNR, Italy
Jacques Carette | 24 Jul 22:52 2014


                      C A L L   F O R   P A P E R S

                      ======= PEPM 2015 ===========

Tue-Wed, January 13-14, 2015, Mumbai, India, co-located with POPL'15


Sponsored by ACM SIGPLAN


The PEPM Symposium/Workshop series aims at bringing together
researchers and practitioners working in the areas of program
manipulation, partial evaluation, and program generation.  PEPM
focuses on techniques, theory, tools, and applications of analysis
and manipulation of programs.

The 2015 PEPM workshop will be based on a broad interpretation of
semantics-based program manipulation and continue last years'
successful effort to expand the scope of PEPM significantly beyond the
traditionally covered areas of partial evaluation and specialization
and include practical applications of program transformations such as
refactoring tools, and practical implementation techniques such as
rule-based transformation systems.  In addition, the scope of PEPM
covers manipulation and transformations of program and system
representations such as structural and semantic models that occur in
the context of model-driven development.  In order to reach out to
practitioners, a separate category of tool demonstration papers will
be solicited.

Topics of interest for PEPM'15 include, but are not limited to:

* Program and model manipulation techniques such as: supercompilation,
   partial evaluation, fusion, on-the-fly program adaptation, active
   libraries, program inversion, slicing, symbolic execution,
   refactoring, decompilation, and obfuscation.

* Program analysis techniques that are used to drive program/model
   manipulation  such as: abstract interpretation, termination
   checking, binding-time analysis, constraint solving, type systems,
   automated testing and test case generation.

* Techniques that treat programs/models as data objects including
   metaprogramming, generative programming, embedded domain-specific
   languages, program synthesis by sketching and inductive programming,
   staged computation, and model-driven program generation and

* Application of the above techniques including case studies of
   program manipulation in real-world (industrial, open-source)
   projects and software development processes, descriptions of robust
   tools capable of effectively handling realistic applications,
   benchmarking.  Examples of application domains include legacy
   program understanding and transformation, DSL implementations,
   visual languages and end-user programming, scientific computing,
   middleware frameworks and infrastructure needed for distributed and
   web-based applications, resource-limited computation, and security.

To maintain the dynamic and interactive nature of PEPM, we will
continue the category of `short papers' for tool demonstrations and
for presentations of exciting if not fully polished research, and of
interesting academic, industrial and open-source applications that are
new or unfamiliar.

Student participants with accepted papers can apply for a SIGPLAN PAC
grant to help cover travel expenses and other support. PAC also offers
other support, such as for child-care expenses during the meeting or
for travel costs for companions of SIGPLAN members with physical
disabilities, as well as for travel from locations outside of North
America and Europe. For details on the PAC programme, see its web page
at: http://www.sigplan.org/PAC.htm.

All accepted papers, short papers included, will appear in formal
proceedings published by ACM Press.  Accepted papers will be included
in the ACM Digital Library.  Following the practice of recent PEPMs,
A special issue for Science of Computer Programming is planned with
recommended papers from PEPM'15.

PEPM has also established a Best Paper award.  The winner will be
announced at the workshop.


Regular Research Papers must not exceed 12 pages in ACM Proceedings
style (including appendix).  Tool demonstration papers and short papers
must not exceed 6 pages in ACM Proceedings style (including appendix).
At least one author of each accepted contribution must attend the
workshop and present the work.  In the case of tool demonstration
papers, a live demonstration of the described tool is expected.
Suggested topics, evaluation criteria, and writing guidelines for both
research tool demonstration papers will be made available on the
PEPM'15 Web-site soon.  Papers should be submitted electronically via
the workshop web site.

Authors using LaTeX to prepare their submissions should use the new
improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template)
available at: http://www.sigplan.org/Resources/Author.


     Abstract submission: Tue, September 9, 2014
     Paper submission: Fri, September 12, 2014 (*FIRM*)
     Author notification: Mon, October 13, 2014
     Workshop: Tue, January 13 and Wed, January 14, 2015

Note: The paper submission deadline is firm.  Because the VISA
application to India can take a long time, all the schedule is set
earlier than previous years.  The above schedule is tight: we have
absolutely no time to wait for late submissions and we will have no
deadline extension.  So, please plan ahead.


     to be announced


     Kenichi Asai (Ochanomizu University, Japan)
     Kostis Sagonas (Uppsala University, Sweden / NTUA, Greece)


     Andreas Abel (Chalmers and Gothenburg University, Sweden)
     Elvira Albert (Complutense University of Madrid, Spain)
     Malgorzata Biernacka (University of Wroclaw, Poland)
     Matthias Blume (Google, USA)
     Cristiano Calcagno (Facebook, UK)
     Jacques Carette (McMaster University, Canada)
     Jeremy Gibbons (University of Oxford, UK)
     Nao Hirokawa (Japan Advanced Institute of Science and Technology, Japan)
     Atsushi Igarashi (Kyoto University, Japan)
     Andrei Klimov (Russian Academy of Sciences, Russia)
     Michael Leuschel (University of Dusseldorf, Germany)
     Sam Lindley (University of Edinburgh, UK)
     Michal Moskal (Microsoft Research, USA)
     Keiko Nakata (Tallinn University of Technology, Estonia)
     Jeremy Siek (Indiana University, USA)
     Peter Thiemann (University of Freiburg, Germany)
     Janis Voigtlaender (University of Bonn, Germany)
     Kwangkeun Yi (Seoul National University, South Korea)
     Tetsuo Yokoyama (Nanzan University, Japan)


Caml-list mailing list.  Subscription management and archives:
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

Jeremy Yallop | 24 Jul 19:44 2014

OCaml tutorial in Sweden

Dear all,

Leo White and I will be giving an OCaml tutorial at this year's CUFP in Sweden.

Where: Gothenburg, Sweden (affiliated with ICFP 2014)
When: September 05, 2014 9:00 AM - 12:30 PM

The tutorial is aimed at people with programming experience, but no
prior knowledge of OCaml is needed.  We'll introduce the basics of
OCaml and then show how to use some of the latest OCaml tools such as
OPAM and IOCaml to build OCaml programs, focusing on the construction
of a simple game.

You can find more details on the CUFP site:


You can register here:


Note the deadline for (discounted) early registration: 3rd August 2014.

Hope to see you there!



Caml-list mailing list.  Subscription management and archives:
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

Raoul Duke | 24 Jul 19:37 2014

meta-gc (Re: concurrent gc?)

> I agree with Malcolm's experience, and my situation might be similar to
> yours: games -- a lot of allocations at high framerate. I'm guessing this
> from how evil you consider pauses to be. ;)

yes, interactive apps.

> allocators -- you still need to use dynamic allocations wisely. Here, I
> think the biggest problem is when you have a GC, you lose awareness of the
> allocations you're triggering.

yes, those are nice down to earth wise words that need to be said more
often in every class :-)

to kick the question up a meta-level: Does anybody have thoughts on
how to best orthogonalize actual memory allocation from where the
application says it wants it? I mean if I write a stupid loop that
makes a zillion particles in the middle of each frame render then yes
I'm an idiot, sure... but what things can be done to actually allow
such idiocy to squeak by?

Maybe that's a horrible thing to suggest as it just panders. But I
like to think of it more along the lines of trying to tease things
apart as much as possible, and then some more (to corrupt an infamous

[In some sense that is what GC purported to be when it was being sold
like snake oil :-) and for a long time "regular" programmers knew
better and would make fun of e.g. lisp programmers.]


Caml-list mailing list.  Subscription management and archives:
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

Hongseok Yang | 24 Jul 18:45 2014

HOPE 2014 Call for Participation (with Workshop Program)


                      CALL FOR PARTICIPATION

                           HOPE 2014

                The 3rd ACM SIGPLAN Workshop on
              Higher-Order Programming with Effects

                        August 31, 2014
                      Gothenburg, Sweden
                   (the day before ICFP 2014)


HOPE 2014 aims at bringing together researchers interested in the design, 
semantics, implementation, and verification of higher-order effectful 
programs. It will be *informal*, consisting of invited talks, contributed 
talks on work in progress, and open-ended discussion sessions. 


Deadline for early registration: 3 August 2014

This is the registration site for ICFP 2014 and all the affiliated
workshops including HOPE 2014.

Invited Talk

Title: Verifying Security Properties of SES Programs
Speaker: Philippa Gardner, Imperial College London

List of Accepted Talks

(1) Stevan Andjelkovic. Towards indexed algebraic effects and handlers

(2) Kwok Cheung. Separating Entangled State

(3) Filip Sieczkowski and Lars Birkedal. ModuRes: a Coq Library for Reasoning about Concurrent Higher-Order Imperative Programming Languages

(4) Ohad Kammar. Graphical algebraic foundations for monad stacks

(5) Paul Downen and Zena M. Ariola. Delimited control with multiple prompts in theory and practice

(6) Carter Schonwald. A Type Directed model of Memory Locality and the design of High Performance Array APIs

(7) Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Derek Dreyer and Viktor Vafeiadis. Compositional Compiler Verification via Parametric Simulation

(8) Danel Ahman and Tarmo Uustalu. From stateful to stackful computation

Goals of the Workshop

A recurring theme in many papers at ICFP, and in the research of many
ICFP attendees, is the interaction of higher-order programming with
various kinds of effects: storage effects, I/O, control effects,
concurrency, etc. While effects are of critical importance in many
applications, they also make it hard to build, maintain, and reason
about one's code. Higher-order languages (both functional and
object-oriented) provide a variety of abstraction mechanisms to help
"tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types,
typestate, first-class events, transactions, Hoare Type Theory,
session types, substructural and region-based type systems), and a
number of different semantic models and verification technologies have
been developed in order to codify and exploit the benefits of this
encapsulation (e.g. bisimulations, step-indexed Kripke logical
relations, higher-order separation logic, game semantics, various
modal logics). But there remain many open problems, and the field is
highly active.

The goal of the HOPE workshop is to bring researchers from a variety
of different backgrounds and perspectives together to exchange new and
exciting ideas concerning the design, semantics, implementation, and
verification of higher-order effectful programs.

We want HOPE to be as informal and interactive as possible. The
program will thus involve a combination of invited talks, contributed
talks about work in progress, and open-ended discussion
sessions. There will be no published proceedings, but participants
will be invited to submit working documents, talk slides, etc. to be
posted on this website.

Workshop Organization

Program Co-Chairs:

Neel Krishnaswami (University of Birmingham)
Hongseok Yang (University of Oxford)

Program Committee:

Zena Ariola (University of Oregon)
Ohad Kammar (University of Cambridge)
Ioannis Kassios (ETH Zurich)
Naoki Kobayashi (University of Tokyo)
Paul Blain Levy (University of Birmingham)
Aleks Nanevski (IMDEA)
Scott Owens (University of Kent)
Sam Staton (Radboud University Nijmegen)
Steve Zdancewic (University of Pennsylvania)