Primitive recursion for higher-order abstract syntax-Reference-Cited by-同舟云学术

Primitive recursion for higher-order abstract syntax

Published:1997 Issue: Volume: Page:147-163
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Despeyroux Joëlle,Pfenning Frank,Schürmann Carsten

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-62688-3_34.pdf

Reference22 articles.

1. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.

2. Thierry Coquand, Bengt Nordström, Jan M. Smith, and Björn von Sydow. Type theory and programming. Bulletin of the European Association for Theoretical Computer Science, 52:203–228, February 1994.

3. Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Jr. Guy Steele, editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258–270, St. Petersburg Beach, Florida, January 1996. ACM Press.

4. LNCS 902;J. Despeyroux,1995

5. LNAI 822;J. Despeyroux,1994

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Programming Inductive Proofs;Verification, Induction, Termination Analysis;2010

2. Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions;Electronic Notes in Theoretical Computer Science;2007-06

3. Intensional analysis of quantified types;ACM Transactions on Programming Languages and Systems;2003-03

4. Chapter 4. Basic Category Theory for Models of Syntax;Generic Programming;2003

5. Higher-Order Intensional Type Analysis;Programming Languages and Systems;2002