Typed lambda calculi and applications. Third international conference on typed lambda calculi and applications, TLCA '97, Nancy, France, April 2--4, 1997. Proceedings.
The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0813.68040). Indexed articles: \textit{Akama, Yohji}, A \(\lambda\)-to-CL translation for strong normalization, 1-10 [Zbl 1063.03506] \textit{Bellè, Gianna; Moggi, Eugenio}, Typed intermediate languages for shape analysis, 11-29 [Zbl 1063.68561] \textit{Berardi, S.; Boerio, L.}, Minimum information code in a pure functional language with data types, 30-45 [Zbl 1063.68548] \textit{Bono, Viviana; Bugliesi, Michele}, Matching constraints for the lambda calculus of objects, 46-62 [Zbl 1063.68549] \textit{Brandt, Michael; Henglein, Fritz}, Coinductive axiomatization of recursive type equality and subtyping, 63-81 [Zbl 1063.03510] \textit{Braüner, Torben}, A simple adequate categorical model for PCF, 82-98 [Zbl 1063.68597] \textit{Bucciarelli, Antonio}, Logical reconstruction of bi-domains, 99-111 [Zbl 1063.68598] \textit{Courant, Judicaël}, A module calculus for pure type systems, 112-128 [Zbl 1063.68648] \textit{Damiani, Ferruccio; Giannini, Paola}, An inference algorithm for strictness, 129-146 [Zbl 1063.68553] \textit{Despeyroux, Joëlle; Pfenning, Frank; Schürmann, Carsten}, Primitive recursion for higher-order abstract syntax, 147-163 [Zbl 1063.03511] \textit{Ghani, Neil}, Eta-expansions in dependent type theory -- the calculus of constructions, 164-180 [Zbl 1063.03514] \textit{Guerrini, S.; Martini, S.; Masini, A.}, Proof nets, garbage, and computations, 181-195 [Zbl 1063.03535] \textit{Hasegawa, Masahito}, Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi, 196-213 [Zbl 1063.68599] \textit{Herbelin, Hugo}, Games and weak-head reduction for classical PCF, 214-230 [Zbl 1063.68563] \textit{Kurata, Toshihiko}, A type theoretical view of Böhm-trees, 231-247 [Zbl 1063.03518] \textit{Lenisa, Marina}, Semantic techniques for deriving coinductive characterizations of observational equivalences for \(\lambda\)-calculi, 248-266 [Zbl 1063.03520] \textit{Małolepszy, Jan; Moczurad, Małgorzata; Zaionc, Marek}, Schwichtenberg-style lambda definability is undecidable, 267-283 [Zbl 1063.03521] \textit{van Raamsdonk, Femke}, Outermost-fair rewriting, 284-299 [Zbl 1063.68593] \textit{Retoré, Christian}, Pomset logic: a non-commutative extension of classical linear logic, 300-318 [Zbl 1063.03536] \textit{Rueß, Harald}, Computational reflection in the calculus of constructions and its application to theorem proving, 319-335 [Zbl 1063.03504] \textit{Stark, Ian}, Names, equations, relations: practical ways to reason about \textit{new}, 336-353 [Zbl 1063.03526] \textit{Takeuti, Izumi}, An axiomatic system of parametricity, 354-372 [Zbl 1063.03500] \textit{Urzyczyn, Paweł}, Inhabitation in typed lambda-calculi (a syntactic approach), 373-389 [Zbl 1063.03527] \textit{Xi, Hongwei}, Weak and strong beta normalisations in typed \(\lambda\)-calculi, 390-404 [Zbl 1063.03528]
scientific article; zbMATH DE number 2103808