Abstract is missing.
- Termination and Productivity Checking with Continuous TypesAndreas Abel. 1-15 [doi]
- Derivatives of ContainersMichael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride. 16-30 [doi]
- Max-Plus Quasi-interpretationsRoberto M. Amadio. 31-45 [doi]
- Inductive Types in the Calculus of Algebraic ConstructionsFrédéric Blanqui. 46-59 [doi]
- On Strong Normalization in the Intersection Type DisciplineGérard Boudol. 60-74 [doi]
- Relative Definability and Models of Unary PCFAntonio Bucciarelli, Benjamin Leperchey, Vincent Padovani. 75-89 [doi]
- Principal Typing in Elementary Affine LogicPaolo Coppola, Simona Ronchi Della Rocca. 90-104 [doi]
- A Logical Framework with Dependently Typed RecordsThierry Coquand, Randy Pollack, Makoto Takeyama. 105-119 [doi]
- A Sound and Complete CPS-Translation for lambda-mu-CalculusKen-etsu Fujita. 120-134 [doi]
- Abstraction Barrier-Observing Relational ParametricityJo Erskine Hannay. 135-152 [doi]
- Encoding of the Halting Problem into the Monster Type & ApplicationsThierry Joly. 153-166 [doi]
- Well-Going Programs Can Be TypedStefan Kahrs. 167-179 [doi]
- Parameterizations and Fixed-Point Operators on Control CategoriesYoshihiko Kakutani, Masahito Hasegawa. 180-194 [doi]
- Functional In-Place Update with Layered Datatype SharingMichal Konecný. 195-210 [doi]
- A Fully Abstract Bidomain Model of Unary ::::FPC::::James Laird. 211-225 [doi]
- On a Semantic Definition of Data Independence Ranko Lazic, David Nowak. 226-240 [doi]
- Nondeterministic Light Logics and NP-TimeFrançois Maurel. 241-255 [doi]
- Polarized Proof Nets with Cycles and Fixpoints SemanticsRaphaël Montelatici. 256-270 [doi]
- Observational Equivalence and Program Extraction in the Coq Proof AssistantNicolas Oury. 271-285 [doi]
- Permutative Conversions in Intuitionistic Multiary Sequent Calculi with CutsJosé Espírito Santo, Luis Pinto. 286-300 [doi]
- A Universal Embedding for the Higher Order Structure of Computational EffectsJohn Power. 301-315 [doi]