Abstract is missing.
- Many Happy ReturnsOlivier Danvy. 1 [doi]
- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space BehaviourMartin Hofmann. 2-3 [doi]
- Definability of Total Objects in PCF and Related CalculiDag Normann. 4-5 [doi]
- Categorical Semantics of ControlPeter Selinger. 6-7 [doi]
- Representations of First Order Function Types as Terminal CoalgebrasThorsten Altenkirch. 8-21 [doi]
- A Finitary Subsystem of the Polymorphic lambda-CalculusThorsten Altenkirch, Thierry Coquand. 22-28 [doi]
- Sequentiality and the pi-CalculusMartin Berger, Kohei Honda, Nobuko Yoshida. 29-45 [doi]
- Logical Properties of Name RestrictionLuca Cardelli, Andrew D. Gordon. 46-60 [doi]
- Subtyping Recursive GamesJuliusz Chroboczek. 61-75 [doi]
- Typing Lambda Terms in Elementary Logic with Linear ConstraintsPaolo Coppola, Simone Martini. 76-90 [doi]
- Ramified Recurrence with Dependent TypesNorman Danner. 91-105 [doi]
- Game Semantics for the Pure Lazy lambda-calculusPietro Di Gianantonio. 106-120 [doi]
- Reductions, Intersection Types, and Explicit SubstitutionsDaniel J. Dougherty, Pierre Lescanne. 121-135 [doi]
- The Stratified Foundations as a Theory ModuloGilles Dowek. 136-150 [doi]
- Normalization by Evaluation for the Computational Lambda-CalculusAndrzej Filinski. 151-165 [doi]
- Induction Is Not Derivable in Second Order Dependent Type TheoryHerman Geuvers. 166-181 [doi]
- Strong Normalization of Classical Natural Deduction with DisjunctionPhilippe de Groote. 182-196 [doi]
- Partially Additive Categories and Fully Complete Models of Linear LogicEsfandiar Haghverdi. 197-216 [doi]
- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial TypesC. Barry Jay. 217-239 [doi]
- The Finitely Generated Types of the lambda-CalculusThierry Joly. 240-252 [doi]
- Deciding Monadic Theories of Hyperalgebraic TreesTeodor Knapik, Damian Niwinski, Pawel Urzyczyn. 253-267 [doi]
- A Deconstruction of Non-deterministic Classical Cut EliminationJames Laird. 268-282 [doi]
- A Token Machine for Full Geometry of InteractionOlivier Laurent. 283-297 [doi]
- Second-Order Pre-Logical Relations and Representation IndependenceHans Leiß. 298-314 [doi]
- Characterizing Convergent Terms in Object Calculi via Intersection TypesUgo de Liguoro. 315-328 [doi]
- Parigot s Second Order lambda-mu-Calculus and Inductive TypesRalph Matthes. 329-343 [doi]
- The Implicit Calculus of ConstructionsAlexandre Miquel. 344-359 [doi]
- Evolving Games and Essential Nets for Affine PolymorphismAndrzej S. Murawski, C.-H. Luke Ong. 360-375 [doi]
- Retracts in Simple TypesVincent Padovani. 376-384 [doi]
- Parallel Implementation Models for the lambda-Calculus Using the Geometry of InteractionJorge Sousa Pinto. 385-399 [doi]
- The Complexity of beta-Reduction in Low OrdersAleksy Schubert. 400-414 [doi]
- Strong Normalisation for a Gentzen-like Cut-Elimination ProcedureChristian Urban. 415-430 [doi]