Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem;de Bruijn;Indag. Math.,1972
2. HOL-lambda-sigma: an intentional first-order expression of higher-order logic;Dowek;Math. Structures Comput. Sci.,2001
3. Theorem proving modulo;Dowek;J. Automat. Reason.,2003
4. G. Dowek, Y. Jiang, Eigenvariables, Bracketing and the Decidability of Positive Minimal Intuitionistic Logic, Electronic Notes in Theoretical Computer Science, Vol. 85, no. 7, 2003.
5. Contraction-free sequent calculi for intuitionistic logic;Dyckhoff;J. Symbolic Logic,1992
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献