[Caml-list] TLCA: 1st CALL for PAPERS

[Caml-list] TLCA: 1st CALL for PAPERS

[Luca]

			FIRST CALL FOR PAPERS
		Thirteenth International Conference on
	  TYPED LAMBDA CALCULI AND APPLICATIONS (TLCA 2015)

		 1 July - 3 July 2015, Warsaw, Poland
	    (co-located with RTA 2015 as part of RDP 2015)
		      http://rdp15.mimuw.edu.pl/

The 13th International Conference on Typed Lambda Calculi
and Applications (TLCA 2015) is a forum for original
research in the theory and applications of typed lambda
calculus, broadly construed.
Suggested, but not exclusive, list of topics for submission are:

- Proof-theory: natural deduction, sequent calculi, cut elimination
   and normalization, propositions as types, linear logic and proof
   nets, type-theoretic aspects of computational complexity
- Semantics: denotational semantics, game semantics, realisability,
    domain theory, categorical models, higher order semantics of
    natural language
- Types: subtypes, dependent types, polymorphism, inductive,
    coinductive and recursive types, intersection types and related
    approaches, type inference and type checking, types in program
    analysis and verification, types in proof assistants, homotopy type
    theory
- Programming: foundational aspects of functional programming,
    object-oriented programming and other programming paradigms,
    calculi for higher order concurrency (e.g. pi-calculus),
    flow analysis of higher-type computation, program equivalence,
    program transformation and optimization
- Typed lambda calculi in education, proof systems based on lambda
    calculus to teach mathematics, lambda calculi as a unified notation
    in scientific education

SUBMISSION GUIDELINES

We solicit submissions of research papers, which must:
- be in English and not exceed 15 pages (including figures and
   bibliography). Additional material intended for the reviewers
   but not for publication in the final version - for example
   details of proofs - may be placed in a clearly marked appendix
   that is not included in the page limit. Reviewers will be told
   that they may choose to ignore the appendix.
- present original research which is unpublished and not submitted
    elsewhere (conferences, journals, books, etc.)
- use LIPIcs latex style
   http://www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren/
- be submitted electronically in PDF via theEasyChair TLCA
   2015 Submission Webpage (will open nearer the deadline).

Submissions deviating from these instructions may be rejected without
review. A condition of submission is that, if accepted, one of the
authors must attend the conference to give the presentation.  The
proceedings will be published as an electronic volume in the Leibniz
International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl.
Note that LIPIcs is open access and hence publications automatically
satisfy the requirements many research councils impose on
publications.

Any questions regarding the submission guidelines should be directed
to the Programme Committee Chair prior to submitting.

COLOCATED EVENTS

TLCA 2015 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2015), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2015) and several related events. Details on
workshops affiliated with RDP 2015 will be available at the web
site in due course.

IMPORTANT DATES
Abstract Deadline:		30 January 2015
Submission Deadline:	6 February 2015
Notification:		  	2 April 2015
Camera-Ready:		17 April 2015

PROGRAMME CHAIR

Thorsten Altenkirch (U Nottingham)
tlca2015@easychair.orgtlca2015@easychair.org

PROGRAMME COMMITTEE

Steve Awodey				(Carnegie Mellon U)
Stefano Berardi 			(U Torino)
James Chapman 			(TU Tallinn)
Gilles Dowek				(INRIA)
Peter Dybjer 				(Chalmers U)
Silvia Ghilezan 			(U Novi Sad)
Mauro Jaskelioff 			(U Rosario)
Chantal Keller 				(MSR Cambridge)
Paul Levy 				(U Birmingham)
Ralph Matthes 			(IRIT, CNRS  U Toulouse)
Keiko Nakata 				(TU Tallinn)
Damian Niwinski			(U Warsaw)
Valeria de Paiva			(Nuance Communications)
Matthieu Sozeau 			(INRIA)
Wouter Swierstra 			(U Utrecht)

CONFERENCE CHAIR

Aleksy Schubert (U Warsaw)

TLCA STEERING COMMITTEE

Sandra Alves (U Porto)
Steve Awodey, (CMU)
Pierre-Louis Curien (CNRS/U Paris Diderot)
Ugo Dal Lago (U Bologna)
Gilles Dowek (INRIA)
Masahito Hasegawa (U Kyoto)
Hugo Herbelin (U Denis Diderot)
Martin Hofmann (LMU Munchen)
Luke Ong (U Oxford)
Michele Pagani (U Denis Diderot)
Jens Palsberg  (UCLA)
Jakob Rehof (U Dortmund)
Pawel Urzyczyn (U Warsaw), chair
Philip Wadler (U Edinburgh)

TLCA HONORARY ADVISOR

Samson Abramsky (U Oxford)
Henk Barendregt (U Nijmegen)
Mariangiola Dezani (U Torino)
  Roger Hindley (Swansea U)
Simona Ronchi Della Rocca (U Torino)

TLCA PUBLICITY CHAIR

Luca Paolini (U Torino)

[Caml-list] TLCA: FINAL CALL FOR PAPERS

[Luca]

                        FINAL CALL FOR PAPERS
                 Thirteenth International Conference on
           TYPED LAMBDA CALCULI AND APPLICATIONS (TLCA 2015)

                  1 July - 3 July 2015, Warsaw, Poland
             (co-located with RTA 2015 as part of RDP 2015)
                       http://rdp15.mimuw.edu.pl/

The 13th International Conference on Typed Lambda Calculi
and Applications (TLCA 2015) is a forum for original
research in the theory and applications of typed lambda
calculus, broadly construed.
Suggested, but not exclusive, list of topics for submission are:

- Proof-theory: natural deduction, sequent calculi, cut elimination
   and normalization, propositions as types, linear logic and proof
   nets, type-theoretic aspects of computational complexity
- Semantics: denotational semantics, game semantics, realisability,
    domain theory, categorical models, higher order semantics of
    natural language
- Types: subtypes, dependent types, polymorphism, inductive,
    coinductive and recursive types, intersection types and related
    approaches, type inference and type checking, types in program
    analysis and verification, types in proof assistants, homotopy type
    theory
- Programming: foundational aspects of functional programming,
    object-oriented programming and other programming paradigms,
    calculi for higher order concurrency (e.g. pi-calculus),
    flow analysis of higher-type computation, program equivalence,
    program transformation and optimization
- Typed lambda calculi in education, proof systems based on lambda
    calculus to teach mathematics, lambda calculi as a unified notation
    in scientific education

SUBMISSION GUIDELINES

We solicit submissions of research papers, which must:
- be in English and not exceed 15 pages (including figures and
   bibliography). Additional material intended for the reviewers
   but not for publication in the final version - for example
   details of proofs - may be placed in a clearly marked appendix
   that is not included in the page limit. Reviewers will be told
   that they may choose to ignore the appendix.
- present original research which is unpublished and not submitted
    elsewhere (conferences, journals, books, etc.)
- use LIPIcs latex style
   http://www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren/
- be submitted electronically in PDF via theEasyChair TLCA
   2015 Submission Webpage : 
https://www.easychair.org/conferences/?conf=tlca2015

Submissions deviating from these instructions may be rejected without
review. A condition of submission is that, if accepted, one of the
authors must attend the conference to give the presentation.  The
proceedings will be published as an electronic volume in the Leibniz
International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl.
Note that LIPIcs is open access and hence publications automatically
satisfy the requirements many research councils impose on
publications.

Any questions regarding the submission guidelines should be directed
to the Programme Committee Chair prior to submitting.

INVITED SPEAKERS

Herman Geuvers
Martin Hofmann
Hélène Kirchner (joint TLCA and RTA speaker)

COLOCATED EVENTS

TLCA 2015 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2015), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2015) and several related events. Details on
workshops affiliated with RDP 2015 will be available at the web
site in due course.

IMPORTANT DATES
Abstract Deadline:         30 January 2015
Submission Deadline:       6 February 2015
Notification:              2 April 2015
Camera-Ready:              17 April 2015

PROGRAMME CHAIR

Thorsten Altenkirch (U Nottingham)
tlca2015@easychair.org

PROGRAMME COMMITTEE

Steve Awodey			(Carnegie Mellon U)
Stefano Berardi 		(U Torino)
James Chapman 		        (TU Tallinn)
Gilles Dowek			(INRIA)
Peter Dybjer 			(Chalmers U)
Silvia Ghilezan 		(U Novi Sad)
Mauro Jaskelioff 		(U Rosario)
Chantal Keller 			(MSR Cambridge)
Paul Levy 			(U Birmingham)
Ralph Matthes 		        (IRIT, CNRS  U Toulouse)
Keiko Nakata 		       	(FireEye Dresden)
Damian Niwinski 		(U Warsaw)
Valeria de Paiva 		(Nuance Communications)
Matthieu Sozeau 		(INRIA)
Wouter Swierstra 		(U Utrecht)

CONFERENCE CHAIR

Aleksy Schubert (U Warsaw)

TLCA STEERING COMMITTEE

Sandra Alves (U Porto)
Steve Awodey, (CMU)
Pierre-Louis Curien (CNRS/U Paris Diderot)
Ugo Dal Lago (U Bologna)
Gilles Dowek (INRIA)
Masahito Hasegawa (U Kyoto)
Hugo Herbelin (U Paris Diderot)
Martin Hofmann (LMU Munchen)
Luke Ong (U Oxford)
Michele Pagani (U Paris Diderot)
Jens Palsberg  (UCLA)
Jakob Rehof (U Dortmund)
Pawel Urzyczyn (U Warsaw), chair
Philip Wadler (U Edinburgh)

TLCA HONORARY ADVISOR

Samson Abramsky (U Oxford)
Henk Barendregt (U Nijmegen)
Mariangiola Dezani (U Torino)
Roger Hindley (Swansea U)
Simona Ronchi Della Rocca (U Torino)

TLCA PUBLICITY CHAIR

Luca Paolini (U Torino)

[Caml-list] New conference replacing RTA-TLCA

[Luca Paolini]

Dear Everyone,

As requested by the participants of the RTA-TLCA conference
in Vienna 2014, the united Steering Committees of Rewriting
Techniques and Applications (RTA) and Typed Lambda Calculi and
Applications (TLCA) have prepared the attached proposal to replace
our existing two conferences by a new one of a broader scope.

As we embark on this exciting journey, we invite all members of the
computer science community to provide comments, remarks, and
suggestions for the new conference. All input will be passed on to the
steering committee of the new conference after its constitutional
general meeting on July 1st, 2015.

Sincerely,
    Kristoffer Rose and Pawe³ Urzyczyn
for the unanimous steering committees of RTA and TLCA.


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


                               It is our thesis that formal elegance is
                            a prerequisite to efficient implementation.
                                                      -- Gérard Huet[4]

We, the communities behind the RTA[1] and TLCA[2] conferences, believe
that our field has evolved and developed richer connections with many
both practical and theoretical aspects of computer science and logic
research since the inception of RTA in 1983 and TLCA in 1993. In
particular, the scope of the two original conferences widened to
include a significant overlap, and in fact the conferences have
already collaborated by having most of our meetings since 2003 as the
joint RDP[3] conference.

We have therefore decided to propose a new conference,

         Formal Structures for Computation and Deduction (FSCD)

which not only combines our scope but further extends it to cover all
the inter-related formal areas that researchers in formal structures
for computation and deduction engage in.

The name of the new conference comes from an unpublished but important
book by Gérard Huet[4] that was a strong influence on many researchers
in our area. We are grateful to Gérard for allowing us to reuse the
name.

The extended scope of the conference will include all research related
to formal structures for computation and deduction, in particular all
areas/categories included in the attached non-exhaustive list of
topics.

We look very much forward to serve the scientific community with this
new conference, which inherits as well as updates and modernizes the
scope of the conferences it replaces.

References.
[1]http://rewriting.loria.fr/rta/
[2]http://www.mimuw.edu.pl/tlca/
[3]http://users.dsic.upv.es/~rdp03/
[4]http://pauillac.inria.fr/~huet/PUBLIC/Formal_Structures.ps.gz


FSCD initial non-exhaustive list of topics (intended to extend the
current RTA and TLCA scope, and expected to evolve over time):


1. Calculi
      a. Lambda-calculus
      b. Rewriting formats (string, term, higher-order, graph, 
conditional, ...)
      c. Proof theory (natural deduction, sequent calculi, proof nets, ...)
      d. Strategies in computation and deduction

2. Type Theory and Logical Frameworks
      a. Type systems (recursive, intersection types, polymorphism, ...)
      b. Dependent types and homotopy type theory
      c. Linear logic and other constructive logics
      d. Implicit complexity

3. Fundamentals of Functional and Declarative Programming
      a. Unification and narrowing
      b. Tree automata
      c. Continuations and control operators
      d. Coinduction and infinitary systems

4. Semantics
      a. Abstract machines
      b. Categorical semantics
      c. Denotational and game semantics
      d. Quantitative models (timing, probabilities)

5. Algorithmic Analysis of Formal Systems
      a. Type inference and type checking
      b. Complexity analysis
      c. Checking termination, confluence, and related properties
      d. Formalisation and certification

6. Tools and Applications
      a. Proof assistants and interactive theorem proving
      b. Automated deduction (completion, constraints, equational logic...)
      c. Symbolic computation
      d. Implementation techniques for formal systems
      e. Case studies and applications based on formal systems