Un modello di λ-calcolo fortemente equivalente agli schemi ricorsivi

This paper is oriented toward the strong equivalence between programs. We examine the procednre calls in theCuch (the language defined by merging Church's λ-calculus and Curry's combinators). We known that theCuch with the Gross variant, we can model all kinds of procednre calls. Moreover, we show that also any computation rule, defined for the recursive procedure calls, can be strongly embedded into theCuch.     

基于两级di/dt检测IGBT模块短路策略

为了解决传统V~(CE)在检测大功率绝缘栅双极型晶体管(IGBT)模块的短路故障时存在的问题,在分析了IGBT短路特性的基础上,提出了一种基于两级电流变化率(di/dt)检测IGBT两类短路故障的策略。该策略可以使驱动器更早地采取保护措施,限制IGBT的短路电流和短路功耗,减小关断尖峰电压。基于3300 V/1200 A IGBT模块的短路实验结果证明了该策略的有效性和可行性。     

Analiticità e quasi analiticità dedotte dal comportamento dei coefficienti di Lauguerre-Fourier

L ^∞(R ₊) estimates for all derivatives of the eigenfunctions of the operator have been stated (§ 2). Consequently conditions for analyticity and quasi-analyticity have been found and a theorem of Kotake-Narasimhan type have been proved (§ 3).

---

---

Dedicato al Professor Aldo Ghizzetti in occasione del suo settantacinquesimo compleanno