Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Bainbridge, E.S., Freyd, P.J., Scedrov, A., Scott, P.J.: Functorial polymorphism. Theoretical Computer Science 70, 35–64 (1990)
2. van Bakel, S., Liquori, L., Ronchi Della Rocca, S., Urzyczyn, P.: Comparing Cubes of Typed and Type Assignment Systems. Ann. Pure Appl. Logic 86(3), 267–303 (1997)
3. Studies in Logic and the Foundations of Mathematics;H. Barendregt,1981
4. Barendregt, H., Geuvers, H.: Proof Assistants using Dependent Type Systems. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch.18, vol. 2, pp. 1149–1238. Elsevier, Amsterdam (2001)
5. Barendregt, H.: Lambda Calculi with Types. In: Abramsky, Gabbay, Maibaum (eds.) Handbook of Logic in Computer Science, vol. 1. Clarendon (1992)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Using the Lean interactive theorem prover in undergraduate mathematics;International Journal of Mathematical Education in Science and Technology;2023-07-04
2. A symbolic transformation language and its application to a multiscale method;Journal of Symbolic Computation;2014-11
3. TheλμT-calculus;Annals of Pure and Applied Logic;2013-06