Author:
Ferreira Francisco,Pientka Brigitte
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;L Augustsson,1985
2. Benton, N., Hur, C.K., Kennedy, A.J., McBride, C.: Strongly typed term representations in Coq. J. Autom. Reasoning 49(2), 141–159 (2012)
3. Cave, A., Pientka, B.: Programming with binders and indexed data-types. In: 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012), pp. 413–424. ACM Press (2012)
4. Cheney, J., Hinze, R.: First-class phantom types. Technical Report CUCIS TR2003-1901, Cornell University (2003)
5. Chlipala, A.J.: Parametric higher-order abstract syntax for mechanized semantics. In: Hook, J., Thiemann, P. (eds.) 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), pp. 143–156. ACM (2008)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nominal Recursors as Epi-Recursors;Proceedings of the ACM on Programming Languages;2024-01-05
2. Embedding by Unembedding;Proceedings of the ACM on Programming Languages;2023-08-30
3. Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version;Journal of Automated Reasoning;2023-07-05
4. Rensets and Renaming-Based Recursion for Syntax with Bindings;Automated Reasoning;2022
5. Functional programming with λ-tree syntax;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07