4. TLCA 1999:
L'Aquila,
Italy
Jean-Yves Girard (Ed.):
Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings.
Lecture Notes in Computer Science 1581 Springer 1999, ISBN 3-540-65763-0 BibTeX
@proceedings{DBLP:conf/tlca/1999,
editor = {Jean-Yves Girard},
title = {Typed Lambda Calculi and Applications, 4th International Conference,
TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings},
booktitle = {TLCA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1581},
year = {1999},
isbn = {3-540-65763-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited demonstrations
Contributions
- V. Michele Abrusci:
Modules in Non-communicative Logic.
14-24
Electronic Edition (Springer LINK) BibTeX
- Patrick Baillot, Marco Pedicini:
Elementary Complexity and Geometry of Interaction.
25-39
Electronic Edition (Springer LINK) BibTeX
- Nuno Barreiro, Thomas Ehrhard:
Quantitative Semantics Revisited.
40-53
Electronic Edition (Springer LINK) BibTeX
- Stefano Berardi, Ugo de'Liguoro:
Total Functionals and Well-Founded Strategies.
54-68
Electronic Edition (Springer LINK) BibTeX
- Sabine Broda, Luís Damas:
Counting a Type's Principal Inhabitants.
69-82
Electronic Edition (Springer LINK) BibTeX
- Ferruccio Damiani:
Useless-Code Detection and Elimination for PCF with Algebraic Data types.
83-97
Electronic Edition (Springer LINK) BibTeX
- René David:
Every Unsolvable lambda Term has a Decoration.
98-113
Electronic Edition (Springer LINK) BibTeX
- Pietro Di Gianantonio, Gianluca Franco, Furio Honsell:
Game Semantics for Untyped lambda beta eta-Calculus.
114-128
Electronic Edition (Springer LINK) BibTeX
- Peter Dybjer, Anton Setzer:
A Finite Axiomatization of Inductive-Recursive Definitions.
129-146
Electronic Edition (Springer LINK) BibTeX
- Marcelo P. Fiore, Alex K. Simpson:
Lambda Definability with Sums via Grothendieck Logical Relations.
147-161
Electronic Edition (Springer LINK) BibTeX
- Ken-etsu Fujita:
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value.
162-176
Electronic Edition (Springer LINK) BibTeX
- Healfdene Goguen:
Soundness of the Logical Framework for Its Typed Operational Semantics.
177-197
Electronic Edition (Springer LINK) BibTeX
- Masahito Hasegawa:
Logical Predicates for Intuitionistic Linear Type Theories.
198-212
Electronic Edition (Springer LINK) BibTeX
- Olivier Laurent:
Polarized Proof-Nets: Proof-Nets for LC.
213-227
Electronic Edition (Springer LINK) BibTeX
- Paul Blain Levy:
Call-by-Push-Value: A Subsuming Paradigm.
228-242
Electronic Edition (Springer LINK) BibTeX
- Seikoh Mikami, Yohji Akama:
A Study of Abramsky's Linear Chemical Abstract Machine.
243-257
Electronic Edition (Springer LINK) BibTeX
- Peter W. O'Hearn:
Resource Interpretations, Bunched Implications and the alpha lambda-Calculus.
258-279
Electronic Edition (Springer LINK) BibTeX
- Atsushi Ohori:
A Curry-Howard Isomorphism for Compilation and Program Execution.
280-294
Electronic Edition (Springer LINK) BibTeX
- Jeff Polakow, Frank Pfenning:
Natural Deduction for Intuitionistic Non-communicative Linear Logic.
295-309
Electronic Edition (Springer LINK) BibTeX
- Erik Poll, Jan Zwanenburg:
A Logic for Abstract Data Types as Existential Types.
310-324
Electronic Edition (Springer LINK) BibTeX
- Eike Ritter:
Characterising Explicit Substitutions which Preserve Termination.
325-339
Electronic Edition (Springer LINK) BibTeX
- Masahiko Sato, Takafumi Sakurai, Rod M. Burstall:
Explicit Environments.
340-354
Electronic Edition (Springer LINK) BibTeX
- Richard Statman:
Consequences of Jacopini's Theorem: Consistent Equalities and Equations.
355-364
Electronic Edition (Springer LINK) BibTeX
- Christian Urban, Gavin M. Bierman:
Strong Normalisation of Cut-Elimination in Classical Logic.
365-380
Electronic Edition (Springer LINK) BibTeX
- Jan Zwanenburg:
Pure Type Systems with Subtyping.
381-396
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:43:49 2009
by Michael Ley (ley@uni-trier.de)