Mathematical Structures in Computer Science, Volume 11

Volume 11, Number 1, February 2001

• Delia Kesner: Theory and applications of explicit substitutions: Introduction. 1
• Roel Bloo: Pure type systems with explicit substitution. 3-19
• Gilles Dowek, Thérèse Hardin, Claude Kirchner: HOL-[lambda][sigma]: an intentional first-order expression of higher-order logic. 21-45
• Eduardo Bonelli: Perpetuality in a named lambda calculus with explicit substitutions. 47-90
• César Muñoz: Dependent types and explicit substitutions: a meta-theoretical development. 91-129
• René Vestergaard, J. B. Wells: Cut rules and explicit substitutions. 131-168
• René David, Bruno Guillaume: A lambda-calculus with explicit weakening and explicit substitution. 169-206

Volume 11, Number 2, April 2001

• Peter Selinger: Control categories and duality: on the categorical semantics of the lambda-mu calculus. 207-260
• François Métayer: Implicit exchange in multiplicative proofnets. 261-272
• Giacomo Lenzi: Mu-depth 3 is more than 2: a game-theoretic proof. 273-297

Volume 11, Number 3, June 2001

• Pierre-Louis Curien: Preface to Locus Solum. 299-300
• Jean-Yves Girard: Locus Solum: From the rules of logic to the logic of rules. 301-506

Volume 11, Number 4, August 2001

• Matt Fairtlough, Michael Mendler, Eugenio Moggi: Special issue: Modalities in type theory. 507-509
• Frank Pfenning, Rowan Davies: A judgmental reconstruction of modal logic. 511-540
• Peter Aczel: The Russell-Prawitz modality. 541-554
• Joëlle Despeyroux, Pierre Leleu: Recursion over objects of functional type. 555-572
• Jacob M. Howe: Proof search in Lax Logic. 573-588
• Mauro Ferrari, Camillo Fiorentini, Pierangelo Miglioli: Extracting information from intermediate semiconstructive HA-systems - extended abstract. 589-596

Volume 11, Number 5, October 2001

• Michal Walicki, Magne Haveraaen, Sigurd Meldal: Computation Algebras. 597-636
• Annegret Habel, Jürgen Müller, Detlef Plump: Double-pushout graph transformation revisited. 637-688

Volume 11, Number 6, December 2001

• Max I. Kanovich, Jacqueline Vauzeilles: The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity. 689-716
• Steven Vickers: Strongly algebraic = SFP (topically). 717-742
• Manfred Droste, Dietrich Kuske: Recognizable languages in divisibility monoids. 743-770
• Yasuwo Ikeda, Kohji Tomita, Chiharu Hosono: On the elimination of some higher type quantifiers. 771-779