Typed Lambda Calculi and Applications: 8th International Conference, Tlca 2007, Paris, France, June 26-28, 2007, Proceedings

ISBN-13: 9783540732273 / Angielski / Miękka / 2007 / 400 str.

Simona Ronchi Della Rocca

Opis

Constitutes the refereed proceedings of the 8th International Conference on Typed Lambda Calculi and Applications, TLCA 2007, France in June 2007 in conjunction with RTA 2007, the 18th International Conference on Rewriting Techniques and Applications as part of RDP 2007, the 4th International Conference on Rewriting, Deduction, and Programming.

Spis treści

On a Logical Foundation for Explicit Substitutions.- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.- Strong Normalization and Equi-(Co)Inductive Types.- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves.- The Safe Lambda Calculus.- Intuitionistic Refinement Calculus.- Computation by Prophecy.- An Arithmetical Proof of the Strong Normalization for the ?-Calculus with Recursive Equations on Types.- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo.- Completing Herbelin’s Programme.- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.- Ludics is a Model for the Finitary Linear Pi-Calculus.- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic.- The Omega Rule is -Complete in the ??-Calculus.- Weakly Distributive Domains.- Initial Algebra Semantics Is Enough!.- A Substructural Type System for Delimited Continuations.- The Inhabitation Problem for Rank Two Intersection Types.- Extensional Rewriting with Sums.- Higher-Order Logic Programming Languages with Constraints: A Semantics.- Predicative Analysis of Feasibility and Diagonalization.- Edifices and Full Abstraction for the Symmetric Interaction Combinators.- Two Session Typing Systems for Higher-Order Mobile Processes.- An Isomorphism Between Cut-Elimination Procedure and Proof Reduction.- Polynomial Size Analysis of First-Order Functions.- Simple Saturated Sets for Disjunction and Second-Order Existential Quantification.- Convolution -Calculus.