A New Type Theory for Representing Logics
暂无分享,去创建一个
[1] H. Geuvers. The Church-Rosser property for βη-reduction in typed λ-calculi , 1992, LICS 1992.
[2] M. Gordon. HOL: A Proof Generating System for Higher-Order Logic , 1988 .
[3] Furio Honsell,et al. A framework for defining logics , 1993, JACM.
[4] D. Prawitz. Natural Deduction: A Proof-Theoretical Study , 1965 .
[5] Gopalan Nadathur,et al. Higher-Order Logic Programming , 1986, ICLP.
[6] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[7] David J. Pym,et al. A Unification Algorithm for the lambda-Pi-Calculus , 1992, Int. J. Found. Comput. Sci..
[8] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..
[9] Robert Paré,et al. Abstract families and the adjoint functor theorems , 1978 .
[10] Thierry Coquand,et al. The Calculus of Constructions , 1988, Inf. Comput..
[11] Arnon Avron,et al. Simple Consequence Relations , 1988, Inf. Comput..
[12] Jean Benabou,et al. Fibered categories and the foundations of naive category theory , 1985, Journal of Symbolic Logic.
[13] Alex Simpson. Kripke Semantics for a Logical Framework , 1993 .
[14] Robert Harper,et al. Structure and representation in LF , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[15] J. Michael Dunn,et al. Relevance Logic and Entailment , 1986 .
[16] Philippa Gardner,et al. Representing logics in type theory , 1992 .
[17] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .
[18] de Ng Dick Bruijn,et al. A survey of the project Automath , 1980 .