Conferences in DBLP
Jean-Marc Andreoli The Coordination Language Facility and Applications. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:1-5 [Conf ] Peter Harry Eidorff , Fritz Henglein , Christian Mossin , Henning Niss , Morten Heine Sørensen , Mads Tofte AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:6-13 [Conf ] V. Michele Abrusci Modules in Non-communicative Logic. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:14-24 [Conf ] Patrick Baillot , Marco Pedicini Elementary Complexity and Geometry of Interaction. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:25-39 [Conf ] Nuno Barreiro , Thomas Ehrhard Quantitative Semantics Revisited. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:40-53 [Conf ] Stefano Berardi , Ugo de'Liguoro Total Functionals and Well-Founded Strategies. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:54-68 [Conf ] Sabine Broda , Luís Damas Counting a Type's Principal Inhabitants. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:69-82 [Conf ] Ferruccio Damiani Useless-Code Detection and Elimination for PCF with Algebraic Data types. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:83-97 [Conf ] René David Every Unsolvable lambda Term has a Decoration. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:98-113 [Conf ] Pietro Di Gianantonio , Gianluca Franco , Furio Honsell Game Semantics for Untyped lambda beta eta -Calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:114-128 [Conf ] Peter Dybjer , Anton Setzer A Finite Axiomatization of Inductive-Recursive Definitions. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:129-146 [Conf ] Marcelo P. Fiore , Alex K. Simpson Lambda Definability with Sums via Grothendieck Logical Relations. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:147-161 [Conf ] Ken-etsu Fujita Explicitly Typed lambda µ -Calculus for Polymorphism an Call-by-Value. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:162-176 [Conf ] Healfdene Goguen Soundness of the Logical Framework for Its Typed Operational Semantics. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:177-197 [Conf ] Masahito Hasegawa Logical Predicates for Intuitionistic Linear Type Theories. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:198-212 [Conf ] Olivier Laurent Polarized Proof-Nets: Proof-Nets for LC. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:213-227 [Conf ] Paul Blain Levy Call-by-Push-Value: A Subsuming Paradigm. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:228-242 [Conf ] Seikoh Mikami , Yohji Akama A Study of Abramsky's Linear Chemical Abstract Machine. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:243-257 [Conf ] Peter W. O'Hearn Resource Interpretations, Bunched Implications and the alpha lambda -Calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:258-279 [Conf ] Atsushi Ohori A Curry-Howard Isomorphism for Compilation and Program Execution. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:280-294 [Conf ] Jeff Polakow , Frank Pfenning Natural Deduction for Intuitionistic Non-communicative Linear Logic. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:295-309 [Conf ] Erik Poll , Jan Zwanenburg A Logic for Abstract Data Types as Existential Types. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:310-324 [Conf ] Eike Ritter Characterising Explicit Substitutions which Preserve Termination. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:325-339 [Conf ] Masahiko Sato , Takafumi Sakurai , Rod M. Burstall Explicit Environments. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:340-354 [Conf ] Richard Statman Consequences of Jacopini's Theorem: Consistent Equalities and Equations. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:355-364 [Conf ] Christian Urban , Gavin M. Bierman Strong Normalisation of Cut-Elimination in Classical Logic. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:365-380 [Conf ] Jan Zwanenburg Pure Type Systems with Subtyping. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:381-396 [Conf ]