Term rewriting for normalization by evaluation
暂无分享,去创建一个
[1] Ulrich Berger,et al. An inverse of the evaluation functional for typed lambda -calculus , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[2] Zuber,et al. Proof Theory at Work: Program Development in the Minlog System , 1998 .
[3] Ulrich Berger,et al. Continuous Functionals of Dependent and Transfinite Types , 1999 .
[4] de Ng Dick Bruijn,et al. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[5] Roy L. Crole,et al. Categories for Types , 1994, Cambridge mathematical textbooks.
[6] Martin Hofmann,et al. Categorical Reconstruction of a Reduction Free Normalization Proof , 1995, Category Theory and Computer Science.
[7] Thierry Coquand,et al. Intuitionistic model constructions and normalization proofs , 1997, Mathematical Structures in Computer Science.
[8] Andrzej Filinski,et al. A Semantic Account of Type-Directed Partial Evaluation , 1999, PPDP.
[9] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.
[10] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[11] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .
[12] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[13] Olivier Danvy,et al. Pragmatics of Type-Directed Partial Evaluation , 1996, Dagstuhl Seminar on Partial Evaluation.
[14] Robert Glück,et al. Partial evaluation : International Seminar, Dagstuhl Castle, Germany, February 12-16, 1996 : selected papers , 1996 .
[15] Helmut Schwichtenberg,et al. Normalisation by Evaluation , 1998, Prospects for Hardware Foundations.