Author:
Brady Edwin,McBride Conor,McKinna James
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Altenkirch, T., Hofmann, M., Streicher, T.: Categorical reconstruction of a reduction free normalization proof (1996)
2. Augustsson, L.: Compiling pattern matching. In: Jouannaud, J.-P. (ed.) Functional Programming Languages and Computer Architecture, September 1985, pp. 368–381. Springer, Heidelberg (1985)
3. Augustsson, L., Carlsson, M.: An exercise in dependent types: A well-typed interpreter (1999), http://www.cs.chalmers.se/~augustss/cayenne/
4. Berardi, S.: Pruning simply typed lambda terms. Journal of Logic and Computation 6(5), 663–681 (1996)
5. Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed λ-calculus. In: Vemuri, R. (ed.) Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 203–211. IEEE Computer Society Press, Los Alamitos (1991)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Builtin Types Viewed as Inductive Families;Programming Languages and Systems;2023
2. Gradualizing the Calculus of Inductive Constructions;ACM Transactions on Programming Languages and Systems;2022-04-06
3. Extracting functional programs from Coq, in Coq;Journal of Functional Programming;2022
4. Graded Modal Dependent Type Theory;Programming Languages and Systems;2021
5. A dependently typed calculus with pattern matching and erasure inference;Proceedings of the ACM on Programming Languages;2020-08-02