|
Sixth International Conference on Typed Lambda Calculi and Applications (TLCA '03) Valencia, Spain 10-12 June 2003 Call for Papers |
![]() |
The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive:
Conference Program (download: ps-file or
)
| Tuesday, June 10 | ||
| 08:50 - 09:00 | Opening | |
| 09.00 - 10:00 |
Higher-order beta matching is undecidable (Invited talk) |
|
| 10:00 - 10:30 |
A Fully Abstract Bidomain Model of Unary FPC |
|
| 10:30 - 11:00 | Relative Definability and Models of Unary PCF A. Bucciarelli, B. Leperchey, V. Padovani |
|
| 11:00 - 11:30 | Coffee break 1 | |
| 11:30 - 12:00 |
Principal Typing in elementary Affine Logic |
|
| 12:00 - 12:30 |
Nondeterministic Light Logics and NP-Time |
|
| 12:30 - 13:00 |
Polarized Proof Nets with Cycles and Fixpoint Semantics |
|
| 13:00 - 15:00 |
|
|
| 15:00 - 15:30 |
Max-Plus quasi-interpretations |
|
| 15:30 - 16:00 |
Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts |
|
| 16:00 - 16:30 | Functional In-place Update with Layered Datatype Sharing M. Konečný |
|
| 16:30 - 17:00 |
|
|
| 17:00 - 17:30 |
Parameterizations and Fixed-Point Operators on Control Categories |
|
| 17:30 - 18:00 |
A sound and complete CPS-translation for mu-calculus |
|
| 18:00 - 18:30 |
A Universal Embedding for the Higher Order Structure of Computational Effects |
|
| 18:30 | Business meetings / Relax | |
| Wednesday, June 11 | ||
| 09.00 - 10:00 |
A Logical Algorithm for ML Type Inference (Invited talk) |
|
| 10:00 - 10:30 | Coffee break | |
| 10:30 - 11:00 |
On Strong Normalization in the Intersection Type Discipline |
|
| 11:00 - 11:30 | Well-Going Programs Can be Typed S. Kahrs |
|
| 11:30 - 12:00 |
Termination and Productivity Checking with Continuous Types |
|
| 12:00 - 12:30 |
Derivatives of Containers |
|
| 12:30 - 13:00 |
Inductive types in the Calculus of Algebraic Constructions |
|
| 13:00 |
|
|
| Thursday, june 12 |
||
| 09.00 - 10:00 |
Formalizing the proof of the four-color-theorem (Invited talk) |
|
| 10:00 - 10:30 |
A Logical Framework with Dependently Typed Records |
|
| 10:30 - 11:00 | Observational equivalence and program extraction in the Coq proof assistant N. Oury |
|
| 11:00 - 11:30 |
|
|
| 11:30 - 12:00 |
Encoding of the Halting Problem into the Monster Type & Applications |
|
| 12:00 - 12:30 |
Abstraction Barrier-Observing Relational Parametricity |
|
| 12:30 - 13:00 | On a Semantic Definition of Data Independence R. Lazic, D. Nowak |
|
| 13:00 |
|
PAPERS accepted for presentation.
The Programme Committee consists of:
A. Asperti
(University of Bologna)
T. Coquand
(Chalmers University, Göteborg)
V. Danos
(University Paris VII)
M. Hofmann
(Chair; University of Munich)
P.-A. Mellies
(CNRS, Paris)
J. Palsberg
(Purdue University)
H. Schwichtenberg
(University of Munich)
N. Shankar
(SRI International, Menlo Park)
P. Urzyczyn
(Warsaw University)
TLCA'03 will be held in Valencia, Spain, 10-12 June 2003, and will be colocated with RTA and FTP to form the RDP joint conference.
The TLCA Steering Committee :
S. Abramsky
(Chair; Oxford University)
H. Barendregt
(University of Nijmegen)
M. Dezani-Ciancaglini
(University of Torino)
R. Hindley
(University of Swansea)
TLCA'03 will be held in Valencia, Spain, and will be colocated with RTA and FTP to form the RDP joint conference.
Original contributions: should be sent by E-mail (Postscript files only) to the programme chair:
mhofmann@informatik.uni-muenchen.de and a short abstract should be sent as a separate E-mail; it should use only standard ASCII characters.
Hard copy (6 copies) is also acceptable, to the address
Martin Hofmann
The accepted papers will be published as a volume of Springer Lecture Notes in Computer Science. Information about LNCS can be found at the home page http://www.springer.de/comp/lncs/index.html
More details about the Conference will become available later from the Organising Committee.