Basic Category Theory for Models of Syntax
暂无分享,去创建一个
[1] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[2] Paul Taylor,et al. Practical Foundations of Mathematics , 1999, Cambridge studies in advanced mathematics.
[3] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .
[4] Jim Alves-Foss,et al. Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings , 1995 .
[5] Andrew M. Pitts,et al. Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.
[6] Colin McLarty,et al. Elementary categories, elementary toposes , 1992 .
[7] S. Lane. Categories for the Working Mathematician , 1971 .
[8] Furio Honsell,et al. An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS , 2001, ICALP.
[9] Benjamin C. Pierce,et al. Basic category theory for computer scientists , 1991, Foundations of computing.
[10] Martin Hofmann. Semantical analysis of higher-order abstract syntax , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[11] Axel Poigné,et al. Basic category theory , 1993, LICS 1993.
[12] I. Moerdijk,et al. Sheaves in geometry and logic: a first introduction to topos theory , 1992 .
[13] A. Pitts. INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7) , 1987 .
[14] Gordon D. Plotkin,et al. The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[15] R. F. C. Walters,et al. Categories and computer science , 1992, Cambridge computer science texts.
[16] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[17] Andrew M. Pitts,et al. A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[18] M. Barr,et al. Toposes, Triples and Theories , 1984 .
[19] Roy L. Crole,et al. Categories for Types , 1994, Cambridge mathematical textbooks.
[20] S. Maclane,et al. Categories for the Working Mathematician , 1971 .
[21] Roland Carl Backhouse,et al. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction , 2000, Lecture Notes in Computer Science.
[22] Frank Pfenning,et al. Primitive recursion for higher-order abstract syntax , 1997, Theoretical Computer Science.
[23] 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 .
[24] Amy P. Felty,et al. Higher-Order Abstract Syntax in Coq , 1995, TLCA.
[25] Andre Scedrov,et al. Categories, allegories , 1990, North-Holland mathematical library.
[26] Benjamin C. Pierce,et al. Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.
[27] Roy L. Crole,et al. Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction , 2002, TPHOLs.
[28] Michael Barr,et al. Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.
[29] Frank Pfenning,et al. Higher-order abstract syntax , 1988, PLDI '88.
[30] Gordon D. Plotkin,et al. Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[31] Dale Miller,et al. Reasoning with higher-order abstract syntax in a logical framework , 2000, TOCL.
[32] Bart Jacobs,et al. Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.
[33] Andrew D. Gordon,et al. A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion , 1993, HUG.
[34] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[35] Andrew D. Gordon,et al. Five Axioms of Alpha-Conversion , 1996, TPHOLs.