• Presentation
• Venue
• Accomodation
• Programme
• List of participants

Presentation

The workshop CLA 2015 takes place in Lyon and gather around twenty people interested in questions related to quantitative mathematical logic and functional programming.  Among the topics to be addressed are:

•    counting terms, propositions and trees,
•    generating terms, propositions and trees,
•    generating functions  and asymptotic evaluation of term size and  proposition size,
•    random generation and Boltzmann samplers,
•    testing and optimizing compilers of functional programming.

Venue

The workshop will be help at École normale supérieure de Lyon, site Jacques Monod (how to come to ENS de Lyon).

• On Monday March 23, salle des thèses (PhD defense room) (floor 0),
• On Tuesday March 24, room 116 (floor 1)

Accomodation

• Séjours & Affaires Park Avenue - LYON
• Bed in city 
• Hotel Ibis Gerland rue Mérieux
• Hotel Ibis Budget Lyon Gerland
• hotel F1 Lyon Vénissieux Etats Unis (4km) (possibly by bike)
  

Programme

• Monday March 23 (Salle des thèses)

  • 9h50: Bernhard Gittenberger Enumeration of lambda terms with bounded unary height
• 
  
• 
  
• 
  
• 
  
•            Zbigniew Goł ebiewski:  Enumerating (restricted) λ-terms
• 
  

                10h50: Pierre Lescanne Bijections between lambda terms and other combinatorial objects

                                                      paper

                11h50: Pause

             12h : Maciej Bendkowski Asymptotic densities in combinatory logic

                13h: Lunch

                14h10: Michał Pałka Different approaches to generating random simply-typed lambda terms

                                                 paper

                15h10:  Discussion: asymptotic densities of terms

                16h10: Pause

                16h40: Lukasz Lachowski, Agnieszka Lupinska: PhD presentations

              17h30: Visit of the house of mathematics and informatics

              19h45: Dinner at Jols Restaurant  283 avenue Jean-Jaures

    Tuesday March 24 (Room 116)

                9h: Noam Zeilberger A correspondence between rooted planar maps and normal planar lambda terms

                10h: Alain Giorgetti Lambda terms and  maps, formally

                11h: Pause

              11h30: Katarzyna Grygiel Counting Terms in the Binary Lambda Calculus

                                                            paper

                 12h30: Lunch

                14h: Antoine Genitrini  Quantitative Analysis of Concurrent Systems and Application to Random Generation.

                                                    paper: The Combinatorics of Non-determinism. O. Bodini, A. Genitrini and F. Peschanski. In proc. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), Leibniz International Proceedings in Informatics, pp 425-436, 2013.

Enumeration and Random Generation of Concurrent Computations. O. Bodini, A. Genitrini and F. Peschanski. In proc. 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'12), Discrete Mathematics and Theoretical Computer Science, pp 83-96, 2012.

                15h: Matthieu Dien Concurrent Systems: from Tree Processes to Synchronized Processes

                                                      paper

16h: Pause

                16h30:  Discussion on asymptotics and generation

List of participants

• List of participants