[Caml-list] Joint 25th RTA & 12th TLCA: CALL FOR PAPERS

[Caml-list] Joint 25th RTA & 12th TLCA: CALL FOR PAPERS

[Luca Paolini]

Joint 25th International Conference on
REWRITING TECHNIQUES AND APPLICATIONS
and 12th International Conference on
TYPED LAMBDA CALCULI AND APPLICATIONS

   July 14–17, 2014, Vienna, Austria
   http://vsl2014.at/rta-tlca


======================================
IMPORTANT DATES
Abstract submission: January 28, 2014
Notification: April 9, 2014
Paper submission: February 4, 2014
Final version: April 29, 2014
Rebuttal period: March 19–21, 2014
======================================


SUBMISSION and PUBLICATION
---------------------------
Submissions presenting original work are expected at
      https://www.easychair.org/conferences/?conf=rtatlca2014.

They should be at most 15 pages (10 for system descriptions) and follow
      http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.

The proceedings will be published in the LNCS Advanced Research in
Computing and Software Science series of Springer. One author of each
accepted paper is expected to present it at the conference.


Topics
------
This joint RTA and TLCA conference is the major forum for the 
presentation of research on all aspects of rewriting and typed 
lambda-calculi. Areas of interest include but are not limited to:
- Foundations: string rewriting; term rewriting; graph rewriting; 
lambdacalculi; higher-order rewriting; binding techniques; constrained 
rewriting and deduction; categorical and infinitary rewriting; 
stochastic rewriting; net rewriting; Petri nets; higher-dimensional 
rewriting; process calculi; explicit substitution; tree automata; 
confluence; termination; complexity; modularity.
- Algorithmic aspects and implementation: strategies; matching; 
unification; anti-unification; narrowing; constraint solving; theorem 
proving; completion techniques; implementation techniques; parallel 
execution; certification of rewriting properties; abstract machines; 
automated (non)termination and confluence provers; automated complexity 
analysis; SMT solving; system descriptions.
- Logic: proof theory; natural deduction; sequent calculi; proof 
assistants; cut elimination and normalization; propositions as types; 
linear logic and proof nets; equational logic; rewriting logic; 
rewriting calculi; proof checking; reasoning about programming languages 
and logics; homotopy type theory;
type-theoretic aspects of complexity; implicit computational complexity.
- Types: dependent types; polymorphism; intersection types and related 
approaches; subtyping; type inference and type checking; types in databases.
- Semantics: denotational semantics; operational semantics; game 
semantics; realisability; domain theory; categorical models; universal 
algebra.
- Programming: foundational aspects of functional programming, object 
oriented programming, and other programming paradigms; flow analysis
of higher-type computation; program equivalence; program transformation;
program optimization; program refactoring; rewriting models of programs;
rule-based (functional and logic) programming; control operators; 
symbolic and algebraic computation; system synthesis and verification; 
XML queries and transformations; types in program analysis and 
verification; analysis of cryptographic protocols; systems biology; 
linguistics.

Programme Committee
--------------------
Andreas Abel (Gothenburg)
Beniamino Accattoli (Bologna)
Zena Ariola (Oregon)
Steffen van Bakel (Imperial College)
Pierre Clairambault (CNRS)
Ugo Dal Lago (Bologna)
Gilles Dowek (Inria)
Santiago Escobar (Valencia)
Amy Felty (Ottawa)
Maribel Fernandez (King’s college)
Adria Gascon (SRI International)
Jeroen Ketema (Imperial College)
Christopher Lynch (Clarkson)
Masahito Hasegawa (Kyoto)
Olivier Hermant (MINES ParisTech)
Paul-Andre Mellies (CNRS)
Alexandre Miquel (UdelaR)
Cesar Munoz (NASA)
Vivek Nigam (Paraıba)
Luke Ong (Oxford)
Brigitte Pientka (McGill)
Femke van Raamsdonk (Amsterdam)
Jakob Rehof (Dortmund)
David Sabel (Frankfurt)
Gernot Salzer (Wien)
Sylvain Salvati (Inria)
Aleksy Schubert (Warszawa)
Peter Selinger (Dalhousie)
Paula Severi (Leicester)
Christian Sternagel (JAIST)
Kazushige Terui (Kyoto)
Mateu Villaret (Girona)
Fer-Jan de Vries (Leicester)
Harald Zankl (Innsbruck)

Programme Chair
---------------
Gilles Dowek

Conference Chair
----------------
Gernot Salzer

===============================================================


Luca Paolini, Sophie Tison RTA & TLCA publicity chairs

[Caml-list] 1st CFP, Intersection Types and Related Systems 2014

[Luca]

*******************************************************************************
INTERSECTION TYPES AND RELATED SYSTEMS (ITRS)
at the Vienna Summer of Logic 2014
http://vsl2014.at/itrs/

Deadline: March 31st, 2014
*******************************************************************************

ITRS 2014 (the Seventh Workshop on Intersection Types and Related 
Systems) will be affiliated with TLCA (Typed Lambda Calculi and 
Applications, to be held jointly with RTA) as part of FLoC 2014 (the 
Sixth Federated Logic Conference) and will take place in Vienna on July 
18th 2014.
FLoC 2014 will be part of the Vienna Summer of Logic (VSL), the largest 
logic event in history, with over 2000 expected participants. FLoC 2014 
will host eight conferences and many workshops.

ITRS 2014 workshop aims to bring together researchers working on both 
the theory and practical applications of systems based on intersection 
types and related approaches.
(More details at the workshop website http://vsl2014.at/itrs/).

SUBMISSION AND PUBLICATION

(1) Before the workshop, authors are invited to submit an extended 
abstract (max. 10 pages) in PDF format.
(2) Accepted papers will be included on the general VSL'14 Proceedings 
USB-stick
(3) After the workshop, authors of accepted papers will be invited to 
submit full versions (we foresee inclusion in EPTCS).

TOPICS

Possible topics for submitted papers include, but are not limited to:
- Formal properties of systems with intersection types.
- Results for related systems, such as union types, refinement types, or 
singleton types.
- Applications to lambda calculus and similar systems.
- Applications to pi-calculus and similar systems.
- Applications for programming languages.
- Applications for other areas, such as database query languages and 
program extraction from proofs.
- Related approaches using behavioural/intensional types to characterize 
computational properties.

DATES

Abstract submission: 28.03.2014
Paper submission: 31.03.2014
Author notification: 28.04.2014
Final version: 29.05.2014

PROGRAM COMMITTEE

    Moritz Martens (Technical University of Dortmund)
    Luca Paolini (University of Torino)
    Frank Pfenning (Carnegie Mellon University)
    Jakob Rehof (Technical University of Dortmund) - chair
    Takeshi Tsukada (Tohoku University and Oxford University)
    Pawel Urzyczyn (University of Warsaw, Institute of Informatics)
    Joe Wells (Heriot-Watt University)
    Zhiwu Xu (PPS, Paris 7 and SKLCS, ISCAS)

INFORMATION

For further information, please contact Jakob Rehof
Email: jakob.rehof AT cs DOT tu-dortmund DOT de

[Caml-list] Joint 25th RTA & 12th TLCA: Final CALL FOR PAPERS

[Luca Paolini]

Joint 25th International Conference on
REWRITING TECHNIQUES AND APPLICATIONS
and 12th International Conference on
TYPED LAMBDA CALCULI AND APPLICATIONS

   July 14–17, 2014, Vienna, Austria
   http://vsl2014.at/rta-tlca


======================================
IMPORTANT DATES
Abstract submission: January 28, 2014
Paper submission: February 4, 2014
Notification: April 9, 2014
Final version: April 29, 2014
Rebuttal period: March 19–21, 2014
======================================

More info at:
https://who.rocq.inria.fr/Gilles.Dowek/rta-tlca.html

SUBMISSION and PUBLICATION
---------------------------
Submissions presenting original work are expected at
      https://www.easychair.org/conferences/?conf=rtatlca2014.

They should be at most 15 pages (10 for system descriptions) and follow
      http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.

The proceedings will be published in the LNCS Advanced Research in
Computing and Software Science series of Springer. One author of each
accepted paper is expected to present it at the conference.


Topics
------
This joint RTA and TLCA conference is the major forum for the 
presentation of research on all aspects of rewriting and typed 
lambda-calculi. Areas of interest include but are not limited to:
- Foundations: string rewriting; term rewriting; graph rewriting; 
lambdacalculi; higher-order rewriting; binding techniques; constrained 
rewriting and deduction; categorical and infinitary rewriting; 
stochastic rewriting; net rewriting; Petri nets; higher-dimensional 
rewriting; process calculi; explicit substitution; tree automata; 
confluence; termination; complexity; modularity.
- Algorithmic aspects and implementation: strategies; matching; 
unification; anti-unification; narrowing; constraint solving; theorem 
proving; completion techniques; implementation techniques; parallel 
execution; certification of rewriting properties; abstract machines; 
automated (non)termination and confluence provers; automated complexity 
analysis; SMT solving; system descriptions.
- Logic: proof theory; natural deduction; sequent calculi; proof 
assistants; cut elimination and normalization; propositions as types; 
linear logic and proof nets; equational logic; rewriting logic; 
rewriting calculi; proof checking; reasoning about programming languages 
and logics; homotopy type theory;
type-theoretic aspects of complexity; implicit computational complexity.
- Types: dependent types; polymorphism; intersection types and related 
approaches; subtyping; type inference and type checking; types in databases.
- Semantics: denotational semantics; operational semantics; game 
semantics; realisability; domain theory; categorical models; universal 
algebra.
- Programming: foundational aspects of functional programming, object 
oriented programming, and other programming paradigms; flow analysis
of higher-type computation; program equivalence; program transformation;
program optimization; program refactoring; rewriting models of programs;
rule-based (functional and logic) programming; control operators; 
symbolic and algebraic computation; system synthesis and verification; 
XML queries and transformations; types in program analysis and 
verification; analysis of cryptographic protocols; systems biology; 
linguistics.

Programme Committee
--------------------
Andreas Abel (Gothenburg)
Beniamino Accattoli (Bologna)
Zena Ariola (Oregon)
Steffen van Bakel (Imperial College)
Pierre Clairambault (CNRS)
Ugo Dal Lago (Bologna)
Gilles Dowek (Inria)
Santiago Escobar (Valencia)
Amy Felty (Ottawa)
Maribel Fernandez (King’s college)
Adria Gascon (SRI International)
Jeroen Ketema (Imperial College)
Christopher Lynch (Clarkson)
Masahito Hasegawa (Kyoto)
Olivier Hermant (MINES ParisTech)
Paul-Andre Mellies (CNRS)
Alexandre Miquel (UdelaR)
Cesar Munoz (NASA)
Vivek Nigam (Paraıba)
Luke Ong (Oxford)
Brigitte Pientka (McGill)
Femke van Raamsdonk (Amsterdam)
Jakob Rehof (Dortmund)
David Sabel (Frankfurt)
Gernot Salzer (Wien)
Sylvain Salvati (Inria)
Aleksy Schubert (Warszawa)
Peter Selinger (Dalhousie)
Paula Severi (Leicester)
Christian Sternagel (JAIST)
Kazushige Terui (Kyoto)
Mateu Villaret (Girona)
Fer-Jan de Vries (Leicester)
Harald Zankl (Innsbruck)

Programme Chair
---------------
Gilles Dowek

Conference Chair
----------------
Gernot Salzer

===============================================================


Luca Paolini, Sophie Tison RTA & TLCA publicity chairs

[Caml-list] Joint 25th RTA & 12th TLCA: Last reminder

[Luca]

Joint 25th International Conference on
REWRITING TECHNIQUES AND APPLICATIONS
and 12th International Conference on
TYPED LAMBDA CALCULI AND APPLICATIONS

   July 14–17, 2014, Vienna, Austria
   http://vsl2014.at/rta-tlca


======================================
IMPORTANT DATES
Abstract submission: January 28, 2014
Paper submission: February 4, 2014
Notification: April 9, 2014
Final version: April 29, 2014
Rebuttal period: March 19–21, 2014
======================================

More info at:
https://who.rocq.inria.fr/Gilles.Dowek/rta-tlca.html

SUBMISSION and PUBLICATION
---------------------------
Submissions presenting original work are expected at
      https://www.easychair.org/conferences/?conf=rtatlca2014.

They should be at most 15 pages (10 for system descriptions) and follow
      http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.

The proceedings will be published in the LNCS Advanced Research in
Computing and Software Science series of Springer. One author of each
accepted paper is expected to present it at the conference.


Topics
------
This joint RTA and TLCA conference is the major forum for the 
presentation of research on all aspects of rewriting and typed 
lambda-calculi. Areas of interest include but are not limited to:
- Foundations: string rewriting; term rewriting; graph rewriting; 
lambdacalculi; higher-order rewriting; binding techniques; constrained 
rewriting and deduction; categorical and infinitary rewriting; 
stochastic rewriting; net rewriting; Petri nets; higher-dimensional 
rewriting; process calculi; explicit substitution; tree automata; 
confluence; termination; complexity; modularity.
- Algorithmic aspects and implementation: strategies; matching; 
unification; anti-unification; narrowing; constraint solving; theorem 
proving; completion techniques; implementation techniques; parallel 
execution; certification of rewriting properties; abstract machines; 
automated (non)termination and confluence provers; automated complexity 
analysis; SMT solving; system descriptions.
- Logic: proof theory; natural deduction; sequent calculi; proof 
assistants; cut elimination and normalization; propositions as types; 
linear logic and proof nets; equational logic; rewriting logic; 
rewriting calculi; proof checking; reasoning about programming languages 
and logics; homotopy type theory;
type-theoretic aspects of complexity; implicit computational complexity.
- Types: dependent types; polymorphism; intersection types and related 
approaches; subtyping; type inference and type checking; types in databases.
- Semantics: denotational semantics; operational semantics; game 
semantics; realisability; domain theory; categorical models; universal 
algebra.
- Programming: foundational aspects of functional programming, object 
oriented programming, and other programming paradigms; flow analysis
of higher-type computation; program equivalence; program transformation;
program optimization; program refactoring; rewriting models of programs;
rule-based (functional and logic) programming; control operators; 
symbolic and algebraic computation; system synthesis and verification; 
XML queries and transformations; types in program analysis and 
verification; analysis of cryptographic protocols; systems biology; 
linguistics.

Programme Committee
--------------------
Andreas Abel (Gothenburg)
Beniamino Accattoli (Bologna)
Zena Ariola (Oregon)
Steffen van Bakel (Imperial College)
Pierre Clairambault (CNRS)
Ugo Dal Lago (Bologna)
Gilles Dowek (Inria)
Santiago Escobar (Valencia)
Amy Felty (Ottawa)
Maribel Fernandez (King’s college)
Adria Gascon (SRI International)
Jeroen Ketema (Imperial College)
Christopher Lynch (Clarkson)
Masahito Hasegawa (Kyoto)
Olivier Hermant (MINES ParisTech)
Paul-Andre Mellies (CNRS)
Alexandre Miquel (UdelaR)
Cesar Munoz (NASA)
Vivek Nigam (Paraıba)
Luke Ong (Oxford)
Brigitte Pientka (McGill)
Femke van Raamsdonk (Amsterdam)
Jakob Rehof (Dortmund)
David Sabel (Frankfurt)
Gernot Salzer (Wien)
Sylvain Salvati (Inria)
Aleksy Schubert (Warszawa)
Peter Selinger (Dalhousie)
Paula Severi (Leicester)
Christian Sternagel (JAIST)
Kazushige Terui (Kyoto)
Mateu Villaret (Girona)
Fer-Jan de Vries (Leicester)
Harald Zankl (Innsbruck)

Programme Chair
---------------
Gilles Dowek

Conference Chair
----------------
Gernot Salzer

===============================================================


Luca Paolini, Sophie Tison RTA & TLCA publicity chairs

[Caml-list] Joint 25th RTA & 12th TLCA: Deadline extension

[Luca]

Joint 25th International Conference on
REWRITING TECHNIQUES AND APPLICATIONS
and 12th International Conference on
TYPED LAMBDA CALCULI AND APPLICATIONS

   July 14–17, 2014, Vienna, Austria
   http://vsl2014.at/rta-tlca


==============================================
IMPORTANT DATES
----------------------------------------------
EXTENDED Abstract submission: February 4, 2014
EXTENDED Paper submission: February 11, 2014
----------------------------------------------
Notification: April 9, 2014
Final version: April 29, 2014
Rebuttal period: March 19–21, 2014
=============================================

More info at:
https://who.rocq.inria.fr/Gilles.Dowek/rta-tlca.html

SUBMISSION and PUBLICATION
---------------------------
Submissions presenting original work are expected at
      https://www.easychair.org/conferences/?conf=rtatlca2014.

They should be at most 15 pages (10 for system descriptions) and follow
      http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.

The proceedings will be published in the LNCS Advanced Research in
Computing and Software Science series of Springer. One author of each
accepted paper is expected to present it at the conference.


Topics
------
This joint RTA and TLCA conference is the major forum for the 
presentation of research on all aspects of rewriting and typed 
lambda-calculi. Areas of interest include but are not limited to:
- Foundations: string rewriting; term rewriting; graph rewriting; 
lambdacalculi; higher-order rewriting; binding techniques; constrained 
rewriting and deduction; categorical and infinitary rewriting; 
stochastic rewriting; net rewriting; Petri nets; higher-dimensional 
rewriting; process calculi; explicit substitution; tree automata; 
confluence; termination; complexity; modularity.
- Algorithmic aspects and implementation: strategies; matching; 
unification; anti-unification; narrowing; constraint solving; theorem 
proving; completion techniques; implementation techniques; parallel 
execution; certification of rewriting properties; abstract machines; 
automated (non)termination and confluence provers; automated complexity 
analysis; SMT solving; system descriptions.
- Logic: proof theory; natural deduction; sequent calculi; proof 
assistants; cut elimination and normalization; propositions as types; 
linear logic and proof nets; equational logic; rewriting logic; 
rewriting calculi; proof checking; reasoning about programming languages 
and logics; homotopy type theory;
type-theoretic aspects of complexity; implicit computational complexity.
- Types: dependent types; polymorphism; intersection types and related 
approaches; subtyping; type inference and type checking; types in databases.
- Semantics: denotational semantics; operational semantics; game 
semantics; realisability; domain theory; categorical models; universal 
algebra.
- Programming: foundational aspects of functional programming, object 
oriented programming, and other programming paradigms; flow analysis
of higher-type computation; program equivalence; program transformation;
program optimization; program refactoring; rewriting models of programs;
rule-based (functional and logic) programming; control operators; 
symbolic and algebraic computation; system synthesis and verification; 
XML queries and transformations; types in program analysis and 
verification; analysis of cryptographic protocols; systems biology; 
linguistics.

Programme Committee
--------------------
Andreas Abel (Gothenburg)
Beniamino Accattoli (Bologna)
Zena Ariola (Oregon)
Steffen van Bakel (Imperial College)
Pierre Clairambault (CNRS)
Ugo Dal Lago (Bologna)
Gilles Dowek (Inria)
Santiago Escobar (Valencia)
Amy Felty (Ottawa)
Maribel Fernandez (King’s college)
Adria Gascon (SRI International)
Jeroen Ketema (Imperial College)
Christopher Lynch (Clarkson)
Masahito Hasegawa (Kyoto)
Olivier Hermant (MINES ParisTech)
Paul-Andre Mellies (CNRS)
Alexandre Miquel (UdelaR)
Cesar Munoz (NASA)
Vivek Nigam (Paraıba)
Luke Ong (Oxford)
Brigitte Pientka (McGill)
Femke van Raamsdonk (Amsterdam)
Jakob Rehof (Dortmund)
David Sabel (Frankfurt)
Gernot Salzer (Wien)
Sylvain Salvati (Inria)
Aleksy Schubert (Warszawa)
Peter Selinger (Dalhousie)
Paula Severi (Leicester)
Christian Sternagel (JAIST)
Kazushige Terui (Kyoto)
Mateu Villaret (Girona)
Fer-Jan de Vries (Leicester)
Harald Zankl (Innsbruck)

Programme Chair
---------------
Gilles Dowek

Conference Chair
----------------
Gernot Salzer

===============================================================


Luca Paolini, Sophie Tison RTA & TLCA publicity chairs

[Caml-list] ITRS 2014 - DEADLINE EXTENSION

[Luca]

*******************************************************************************
DEADLINE EXTENSION
INTERSECTION TYPES AND RELATED SYSTEMS (ITRS)

at the Vienna Summer of Logic 2014 http://vsl2014.at/itrs/

New deadline: April 14, 2014
*******************************************************************************
Due to multiple requests, we have decided to extend the submission 
deadline for ITRS 2014. Details of the new submission deadline are given 
below.

ITRS 2014 (the Seventh Workshop on Intersection Types and Related 
Systems) will be affiliated with TLCA (Typed Lambda Calculi and 
Applications, to be held jointly with RTA) as part of FLoC 2014 (the 
Sixth Federated Logic Conference) and will take place in Vienna on July 
18th 2014.

FLoC 2014 will be part of the Vienna Summer of Logic (VSL), the largest 
logic event in history, with over 2000 expected participants. FLoC 2014 
will host eight conferences and many workshops.

ITRS 2014 workshop aims to bring together researchers working on both 
the theory and practical applications of systems based on intersection 
types and related approaches.
(More details at the workshop website http://vsl2014.at/itrs/).


SUBMISSION AND PUBLICATION

(1) Before the workshop, authors are invited to submit an extended 
abstract (max. 10 pages) in PDF format.
(2) Accepted papers will be included on the general VSL'14 Proceedings 
USB-stick.
(3) After the workshop, authors of accepted papers will be invited to 
submit full versions (we foresee inclusion in EPTCS).


TOPICS

Possible topics for submitted papers include, but are not limited to:
- Formal properties of systems with intersection types.
- Results for related systems, such as union types, refinement types, or 
singleton types.
- Applications to lambda calculus and similar systems.
- Applications to pi-calculus and similar systems.
- Applications for programming languages.
- Applications for other areas, such as database query languages and 
program extraction from proofs.
- Related approaches using behavioural/intensional types to characterize 
computational properties.

DATES
Abstract submission: 11.04.2014
Paper submission: 14.04.2014
Author notification: 28.04.2014
Final version: 29.05.2014


PROGRAM COMMITTEE
     Moritz Martens (Technical University of Dortmund)
     Luca Paolini (University of Torino)
     Frank Pfenning (Carnegie Mellon University)
     Jakob Rehof (Technical University of Dortmund) - chair
     Takeshi Tsukada (Tohoku University and Oxford University)
     Pawel Urzyczyn (University of Warsaw, Institute of Informatics)
     Joe Wells (Heriot-Watt University)
     Zhiwu Xu (PPS, Paris 7 and SKLCS, ISCAS)


INFORMATION
For further information, please contact Jakob Rehof
Email: jakob.rehof AT cs DOT tu-dortmund DOT de

[Caml-list] LINEARITY 2014: Second Call for Papers

[Luca]

[We apologize if you have received multiple copies of this message]

==============================================================================

            Second Call for Papers

   Third International Workshop on Linearity

          http://vsl2014.at/linearity/

                July 13, 2014
               Vienna, Austria

Submission deadline: April 13, 2014

An associated event of  the Joint meeting of the 23rd EACSL Annual
Conference on Computer Science Logic (CSL) and the 29th ACM/IEEE 
Symposium on Logic  in Computer Science (LICS), as part   of  the 
Vienna   Summer   of  Logic.
==============================================================================
Aim and Scope
-------------

Ever since the birth of Girard's linear logic, there has been a stream 
of research where linearity is a key issue, covering both theoretical 
topics and applications to several  areas of Computer Science, such as 
work on  proof technology, complexity classes and more recently quantum 
computation, program analysis, expressive operational semantics, linear 
programming languages, and techniques for program   transformation, 
update analysis and efficient implementation.

The aim of this workshop is to bring together researchers who are 
currently developing theory and applications of linear calculi, to 
foster their interaction and provide a forum for presenting new ideas 
and work in progress, and enable newcomers to learn about current 
activities in this area.
Linearity is a key feature in both theoretical and practical approaches 
to computer science, and the goal of this workshop is to present work 
exploring linearity both in theory and practice.

Topics of interest include new results that make central use of 
linearity, ranging from foundational work to applications in any field, 
are welcome. Also welcome are more exploratory presentations, which may 
examine open questions and raise fundamental concerns about existing 
theories and practices.  Specifically, topics of interest include, but 
are not limited to:

  * sub-linear logics
  * linear term calculi
  * linear type systems
  * linear proof-theory
  * linear programming languages
  * applications to concurrency
  * interaction-based systems
  * verification of linear systems
  * quantum models of computation
  * biological and chemical models of computation


Important Dates
---------------
  * April 13, 2014: Submission deadline
  * May   10, 2014: Author notification
  * May   28, 2014: Deadline for final versions of accepted papers
  * July  13, 2014: Workshop


Submission and Publication
--------------------------
Authors are invited to submit an extended abstract (8  pages max) 
describing original ideas and recent results not published nor submitted 
elsewhere, or a 5-page  abstract presenting relevant work that  has been 
or will be published elsewhere, or work in progress. Preliminary 
proceedings will be available at the  workshop. Papers should  be 
written in English, and submitted in PostScript or PDF format, using the 
EPTCS style files. Submission is through the Easychair website:
https://www.easychair.org/conferences/?conf=linearity2014

After the workshop, authors of the extended abstracts will be invited to 
submit a long version of  their work (typically a 15-pages paper) for 
publication in EPTCS. These submission will undergo a second round of 
referring. Furthermore, we envision publication of a special issue of a 
journal
after the event.

Programme Committee
-------------------
  * Sandra Alves (chair)
  * Iliano Cervesato (chair)
  * Kaustuv Chaudhuri
  * Maribel Fernández
  * Mário Florido
  * Simon Gay
  * Simone Martini
  * Luca Paolini
  * Simona Ronchi Della Rocca
  * Carsten Schuermann
  * Robert Simmons
  * Vasco Vasconcelos

Contact
-------
Sandra Alves: sandra@dcc.fc.up.pt
Iliano Cervesato: iliano@cmu.edu

[Caml-list] ITRS 2014, Call for Participation

[Luca Paolini]

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

                       **ITRS 2014**

	7th Workshop on Intersection Types and Related Systems

		Vienna, Austria, July 18th, 2014
           http://vsl2014.at/meetings/ITRS-index.html

			affiliated with RTA-TLCA 2014
			in conjunction with FLoC 2014
			at the Vienna Summer of Logic VSL
				http://vsl2014.at/
========================================================================
ITRS 2014 is a venue for researchers working on
both the theory and practical applications of systems based on
intersection types and related approaches.
You are cordially invited to participate.

REGISTRATION:
http://vsl2014.at/registration/

EARLY REGISTRATION is open and lasts until June 8th.

WORKSHOP PROGRAMME:

Invited Talk:

      * 	Luke Ong (University of Oxford, UK)
	Intersection Types, Game Semantics and Higher-Order Model Checking


Contributed Talks:

*Richard Statman
A Finite Model Property for Intersection Types

*Mario Coppo, Mariangiola Dezani-Ciancaglini, Ines Margaria and 
Maddalena Zacchi
On Isomorphism of "Functional" Intersection and Union Types

*Kentaro Kikuchi
Uniform Proofs of Normalisation and Approximation for Intersection Types

*Charles Grellois and Paul-André Melliès
Indexed linear logic and higher-order model checking

*Marcin Benke, Viviana Bono and Aleksy Schubert
Lucretia — intersection type polymorphism for scripting languages

*Mário Pereira, Sandra Alves and Mário Florido
Liquid Intersection Types

*Ugo De Liguoro and Tzu-Chun Chen
Semantic Types for Classes and Mixins

*Jan Bessai, Boris Düdder, Andrej Dudenhefner and Moritz Martens
Delegation-based Mixin Composition Synthesis


-- 
Jakob Rehof
Department of Computer Science
Technische Universität Dortmund
Lehrstuhl für Software Engineering, Otto-Hahn-Str. 14, 44227 Dortmund 
(Germany)
http://www-seal.cs.tu-dortmund.de/seal/pages/people/rehof/index_en.shtml