On strong stability and higher-order sequentiality

Proposes a definition (by reducibility) of sequentiality for the interpretations of higher-order programs and proves the equivalence between this notion and strong stability.<<ETX>>

[1]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[2]  AbramskySamson,et al.  Games and full completeness for multiplicative linear logic , 1994 .

[3]  Jean Vuillemin.  Syntaxe, sémantique et axiomatique d'un langage de programmation simple , 1975 .

[4]  J. Girard,et al.  Proofs and types , 1989 .

[5]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[6]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[7]  Pierre-Louis Curien.  On the Symmetry of Sequentiality , 1993, MFPS.

[8]  Antonio Bucciarelli,et al.  Sequentiality and strong stability , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[9]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[10]  Andreas Blass,et al.  Degrees of indeterminacy of games , 1972 .

[11]  Thomas Ehrhard.  Hypercoherences: A Strongly Stable Model of Linear Logic , 1993, Math. Struct. Comput. Sci..

[12]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[13]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[14]  Vladimir Yu. Sazonov,et al.  A Construction of Typed Lambda Models Related to Feasible Computability , 1993, Kurt Gödel Colloquium.

[15]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[16]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[17]  Radha Jagadeesan,et al.  Games and full completeness for multiplicative linear logic , 1992, Journal of Symbolic Logic.

[18]  Giuseppe Longo,et al.  The hereditary partial effective functionals and recursion theory in higher types , 1984, Journal of Symbolic Logic.

[19]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..