On Continuous Normalization
暂无分享,去创建一个
[1] Thierry Coquand,et al. Infinite Objects in Type Theory , 1994, TYPES.
[2] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .
[3] David Turner,et al. Ensuring Streams Flow , 1997, AMAST.
[4] G. Mints,et al. Finite investigations of transfinite derivations , 1978 .
[5] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[6] S. G. Simpson,et al. The use of abstract language in elementary metamathematics: Some pedagogic examples , 1975 .
[7] Gordon D. Plotkin,et al. Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[8] Felix Joachimski. Confluence of the coinductive [lambda]-calculus , 2004, Theor. Comput. Sci..
[9] Corrado Böhm,et al. General Recursion on Second Order Term Algebras , 2001, RTA.
[10] Wilfried Buchholz,et al. Notation systems for infinitary derivations , 1991, Arch. Math. Log..
[11] Grigori Mints,et al. Selected papers in proof theory , 1992 .
[12] Helmut Schwichtenberg. Finite Notations for Infinite Terms , 1998, Ann. Pure Appl. Log..
[13] Daniele Turi,et al. Abstract Syntax and Variable Binding (Extended Abstract) , 2003 .
[14] Felix Joachimski,et al. Reduction Properties of IE-Systems , 2001 .
[15] Eduardo Giménez,et al. Codifying Guarded Definitions with Recursive Schemes , 1994, TYPES.