Simple types in type theory: Deep and shallow encodings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4732 LNCS, Issue , 2007, Pages 368-382

  Garillot, François ^a,b   Werner, Benjamin ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; SEMANTICS;

DECOMPILATION FUNCTION; SHALLOW ENCODINGS;

ENCODING (SYMBOLS);

EID: 38049010882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74591-4_27     Document Type: Conference Paper

References (17)

1. Altenkirch, T., Dybjer, P., Hofmann, M., Scott, P.J.: Normalization by evaluation for typed lambda calculus with coproducts. In: LICS, pp. 303-310 (2001)
2. Berger, U.: Program extraction from normalization proofs. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 91-106. Springer, Heidelberg (1993)
3. Berger, U., Berghofer, S., Letouzey, P., Schwichtenberg, H.: Program extraction from normalization proofs. Studia Logica 82(1), 25-49 (2006)
4. Berger, U., Eberl, M., Schwichtenberg, H.: Normalisation by evaluation. In: Möller, B., Tucker, J.V. (eds.) Prospects for Hardware Foundations. LNCS, vol. 1546, pp. 117-137. Springer, Heidelberg (1998)
5. Berger, U., Eberl, M., Schwichtenberg, H.: Term rewriting for normalization by evaluation. Inf. Comput. 183(1), 19-42 (2003)
6. Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed lambda-calculus. In: LICS, pp. 203-211. IEEE Computer Society Press, Los Alamitos (1991)
7. Capretta, V., Felty, A.: Combining de bruijn indices and higher-order abstract syntax in coq. In: Altenkirch, T., McBride, C. (eds.) Proceedings of TYPES 2006. LNCS, Springer, Heidelberg (2007)
8. Coquand, C.: From semantics to rules: A machine assisted analysis. In: Meinke, K., Borger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 91-105. Springer, Heidelberg (1994)
9. Coquand, C.: A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions. Higher-Order and Symbolic Computation 15(1), 57-90 (2002)
10. Danvy, O., Rhiger, M., Rose, K.H.: Normalization by evaluation with typed abstract syntax. J. Funct. Program. 11(6), 673-680 (2001)
11. Despeyroux, J., Pfenning, F., Schürmann, C.: Primitive recursion for higher-order abstract syntax. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 147-163. Springer, Heidelberg (1997)
12. Gonthier, G.: A computer-checked proof of the four colour theorem (2005), available on http://research.microsoft.com/~gonthier/
13. Gonthier, G.: Notations of the four colour theorem proof (2005), available on http://research.microsoft.com/~gonthier/
14. Krivine, J.-L.: Une preuve formelle et intuitionniste du théorème de complétude de la logique classique. Bulletin of Symbolic Logic 2(4), 405-421 (1996)
15. Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: PLDI, pp. 199-208 (1988)
16. Schürmann, C., Despeyroux, J., Pfenning, F.: Primitive recursion for higher-order abstract syntax. Theor. Comput. Sci. 266(1-2), 1-57 (2001)
17. Stoughton, A.: Substitution revisited. Theor. Comput. Sci. 59, 317-325 (1988)