Author:
Altenkirch Thorsten,Uustalu Tarmo
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Altenkirch, T., Dybjer, P., Hofmann, M., Scott, P.: Normalization by evaluation for typed lambda calculus with coproducts. In: Proc. of 16th Annual IEEE Symposium on Logic in Computer Science, pp. 303–310. IEEE CS Press, Los Alamitos (2001)
2. Lecture Notes in Computer Science;T. Altenkirch,1995
3. Altenkirch, T., Hofmann, M., Streicher, T.: Reduction-free normalisation for a polymorphic system. In: Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pp. 98–106. IEEE CS Press, Los Alamitos (1996)
4. Altenkirch, T., Hofmann, M., Streicher, T.: Reduction-free normalisation for system F (1997) (unpublished), available on WWW at http://www.cs.nott.ac.uk/~txa/publ/f97.pdf
5. Balat, V.: Une étude des sommes fortes: isomorphismes et formes normales. PhD thesis, Université Denis Diderot (2002)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Normalization by Evaluation for the Lambek Calculus;Electronic Proceedings in Theoretical Computer Science;2022-04-14
2. Exponential Elimination for Bicartesian Closed Categorical Combinators;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07
3. Analytic Tableaux for Higher-Order Logic with Choice;Journal of Automated Reasoning;2011-07-09
4. Generic Programming with Dependent Types;Datatype-Generic Programming;2007