Publisher
Springer International Publishing
Reference22 articles.
1. Abel, A.: Type-based termination: a polymorphic lambda-calculus with sized higher-order types. Ph.D. thesis, Ludwig Maximilians University Munich (2007)
2. Abel, A., Chapman, J.: Normalization by evaluation in the delay monad: a case study for coinduction via copatterns and sized types. In: Levy, P., Krishnaswami, N. (eds.) Workshop on Mathematically Structured Functional Programming 2014, vol. 153 of EPTCS, pp. 51–67 (2014)
3. Abel, A., Pientka, B., Thibodeau, D., Setzer, A.: Copatterns: programming infinite structures by observations. In: Giacobazzi, R., Cousot, R. (eds.) ACM Symposium on Principles of Programming Languages, POPL 2013, ACM, pp. 27–38 (2013)
4. Lecture Notes in Computer Science;T Altenkirch,2010
5. Lecture Notes in Computer Science;T Altenkirch,1999
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Martin-Löf à la Coq;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09
2. PureCake: A Verified Compiler for a Lazy Functional Language;Proceedings of the ACM on Programming Languages;2023-06-06
3. Reasonable Agda is correct Haskell: writing verified Haskell using agda2hs;Proceedings of the 15th ACM SIGPLAN International Haskell Symposium;2022-09-06
4. Program adverbs and Tlön embeddings;Proceedings of the ACM on Programming Languages;2022-08-29
5. Formal reasoning about layered monadic interpreters;Proceedings of the ACM on Programming Languages;2022-08-29