Abstract is missing.
- The Coordination Language Facility and ApplicationsJean-Marc Andreoli. 1-5 [doi]
- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 ProblemPeter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte. 6-13 [doi]
- Modules in Non-communicative LogicV. Michele Abrusci. 14-24 [doi]
- Elementary Complexity and Geometry of InteractionPatrick Baillot, Marco Pedicini. 25-39 [doi]
- Quantitative Semantics RevisitedNuno Barreiro, Thomas Ehrhard. 40-53 [doi]
- Total Functionals and Well-Founded StrategiesStefano Berardi, Ugo de Liguoro. 54-68 [doi]
- Counting a Type s Principal InhabitantsSabine Broda, Luís Damas. 69-82 [doi]
- Useless-Code Detection and Elimination for PCF with Algebraic Data typesFerruccio Damiani. 83-97 [doi]
- Every Unsolvable ::::lambda:::: Term has a DecorationRené David. 98-113 [doi]
- Game Semantics for Untyped ::::lambda beta eta::::-CalculusPietro Di Gianantonio, Gianluca Franco, Furio Honsell. 114-128 [doi]
- A Finite Axiomatization of Inductive-Recursive DefinitionsPeter Dybjer, Anton Setzer. 129-146 [doi]
- Lambda Definability with Sums via Grothendieck Logical RelationsMarcelo P. Fiore, Alex K. Simpson. 147-161 [doi]
- Explicitly Typed ::::lambda µ::::-Calculus for Polymorphism an Call-by-ValueKen-etsu Fujita. 162-176 [doi]
- Soundness of the Logical Framework for Its Typed Operational SemanticsHealfdene Goguen. 177-197 [doi]
- Logical Predicates for Intuitionistic Linear Type TheoriesMasahito Hasegawa. 198-212 [doi]
- Polarized Proof-Nets: Proof-Nets for LCOlivier Laurent. 213-227 [doi]
- Call-by-Push-Value: A Subsuming ParadigmPaul Blain Levy. 228-242 [doi]
- A Study of Abramsky s Linear Chemical Abstract MachineSeikoh Mikami, Yohji Akama. 243-257 [doi]
- Resource Interpretations, Bunched Implications and the ::::alpha lambda::::-CalculusPeter W. O Hearn. 258-279 [doi]
- A Curry-Howard Isomorphism for Compilation and Program ExecutionAtsushi Ohori. 280-294 [doi]
- Natural Deduction for Intuitionistic Non-communicative Linear LogicJeff Polakow, Frank Pfenning. 295-309 [doi]
- A Logic for Abstract Data Types as Existential TypesErik Poll, Jan Zwanenburg. 310-324 [doi]
- Characterising Explicit Substitutions which Preserve TerminationEike Ritter. 325-339 [doi]
- Explicit EnvironmentsMasahiko Sato, Takafumi Sakurai, Rod M. Burstall. 340-354 [doi]
- Consequences of Jacopini s Theorem: Consistent Equalities and EquationsRichard Statman. 355-364 [doi]
- Strong Normalisation of Cut-Elimination in Classical LogicChristian Urban, Gavin M. Bierman. 365-380 [doi]
- Pure Type Systems with SubtypingJan Zwanenburg. 381-396 [doi]