Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Bellegarde, F., Hook, J.: Subsitution: A formal methods case study using monads and transformations. Sci. Comput. Program. 23, 287–311 (1994)
2. Lecture Notes in Computer Science;T. Altenkirch,1999
3. Bird, R.S., Paterson, R.: de Bruijn notation as a nested datatype. J. Functional Programming 9, 77–91 (1999)
4. Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. II. Oxford University Press, Oxford (1992)
5. van Benthem Jutting, L.S.: Typing in pure type systems. Information and Computation 105, 30–41 (1993)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions;Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019;2019
2. Binder aware recursion over well-scoped de Bruijn syntax;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs;2018-01-08
3. Binder aware recursion over well-scoped de Bruijn syntax;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018;2018
4. Equivalence of system F and λ2 in Coq based on context morphism lemmas;Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs;2017-01-16
5. Tower Induction and Up-to Techniques for CCS with Fixed Points;Relational and Algebraic Methods in Computer Science;2017