暂无分享,去创建一个
[1] Thomas Ehrhard,et al. Uniformity and the Taylor expansion of ordinary lambda-terms , 2008, Theor. Comput. Sci..
[2] François Lamarche,et al. Quantitative Domains and Infinitary Algebras , 1992, Theor. Comput. Sci..
[3] Mariangiola Dezani-Ciancaglini,et al. A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.
[4] Michele Pagani,et al. Visible acyclic differential nets, Part I: Semantics , 2012, Ann. Pure Appl. Log..
[5] Michele Pagani,et al. The Cut-Elimination Theorem for Differential Nets with Promotion , 2009, TLCA.
[6] Thomas Ehrhard. A Finiteness Structure on Resource Terms , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.
[7] Laurent Regnier,et al. The differential lambda-calculus , 2003, Theor. Comput. Sci..
[8] Thomas Ehrhard,et al. Finiteness spaces , 2005, Mathematical Structures in Computer Science.
[9] Giulio Manzonetto,et al. Weighted Relational Models of Typed Lambda-Calculi , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[10] Steffen van Bakel,et al. Complete Restrictions of the Intersection Type Discipline , 1992, Theor. Comput. Sci..
[11] Thomas Ehrhard,et al. Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms , 2006, CiE.
[12] Jean-Louis Krivine,et al. Lambda-calculus, types and models , 1993, Ellis Horwood series in computers and their applications.