论文信息 - A Proof of Weak Termination of Typed lambda-sigma-Calculi

A Proof of Weak Termination of Typed lambda-sigma-Calculi

The invention relates to a device for reading a quantity of electric charges then injecting in a charge-transfer device a quantity of charges which depends on the quantity previously read. This device comprises a reading grid connected to the source of an MOS charge-injection transistor operating in saturation and formed from two diodes and a control grid.

Jean Goubault-Larrecq

[1] Pierre Lescanne,et al. From λσ to λν: a journey through calculi of explicit substitutions , 1994, POPL '94.

[2] César A. Muñoz,et al. Confluence and preservation of strong normalisation in an explicit substitutions calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[3] C. Muñoz,et al. Meta-theoretical Properties of : a Left-linear Variant of Meta-theoretical Properties of : a Left-linear Variant Of , 1997 .

[4] A. Rios. Contributions a l'etude des lambda-calculs avec substitutions explicites , 1993 .

[5] J. Krivine. Lambda-calcul : types et modèles , 1990 .

[6] Hans Zantema,et al. Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[7] Roberto Di Cosmo,et al. Strong normalization of explicit substitutions via cut elimination in proof nets , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[8] Paul-André Melliès. Typed lambda-calculi with explicit substitutions may not terminate , 1995, TLCA.

[9] César A. Muñoz,et al. Dependent Types with Explicit Substitutiuons: A Meta-theoretical development , 1996, TYPES.

[10] Martín Abadi,et al. Explicit substitutions , 1989, POPL '90.

[11] J. Gallier. On Girard's "Candidats de Reductibilité" , 1989 .

[12] C. Kirchner,et al. Higher-order unification via explicit substitutions Extended Abstract , 1995, LICS 1995.