Skip to main content
SpringerLink
Log in

Primitive recursion for higher-order abstract syntax

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1210))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  4. Joëlle Despeyroux, Amy Felty, and André Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 124–138, Edinburgh, Scotland, April 1995. Springer-Verlag LNCS 902.

    Google Scholar 

  5. Joëlle Despeyroux and André Hirschowitz. Higher-order abstract syntax with induction in Coq. In Frank Pfenning, editor, Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning, pages 159–173, Kiev, Ukraine, July 1994. Springer-Verlag LNAI 822.

    Google Scholar 

  6. Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. Technical Report CMU-CS-96-172, Carnegie Mellon University, September 1996.

    Google Scholar 

  7. Thierry Despeyroux and André Hirschowitz. Some theory for abstract syntax and induction. Draft manuscript.

    Google Scholar 

  8. Leonidas Fegaras and Tim Sheard. Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space). In Proceedings of 23rd Annual Symposium on Principles of Programming Languages, pages 284–294, St. Petersburg Beach, Florida, January 1996. ACM Press.

    Google Scholar 

  9. Kurt Gödel. On an extension of finitary mathematics which has not yet been used. In Solomon Feferman et al., editors, Kurt Gödel, Collected Works, Volume II, pages 271–280. Oxford University Press, 1990.

    Google Scholar 

  10. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143–184, January 1993.

    Google Scholar 

  11. Jean-Pierre Jouannaud and Mitsuhiro Okada. A computation model for executable higher-order algebraic specification languages. In Gilles Kahn, editor, Proceedings of the 6th Annual Symposium on Logic in Computer Science, pages 350–361, Amsterdam, The Netherlands, July 1991. IEEE Computer Society Press.

    Google Scholar 

  12. Lena Magnusson. The Implementation of ALF—A Proof Editor Based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Chalmers University of Technology and Göteborg University, January 1995.

    Google Scholar 

  13. Raymond McDowell and Dale Miller. A logic for reasoning about logic specifications. Draft manuscript, July 1996.

    Google Scholar 

  14. Erik Meijer and Graham Hutton. Bananas in space: Extending fold and unfold to exponential types. In Proceedings of the 7th Conference on Functional Programming Languages and Computer Architecture, La Jolla, California, June 1995.

    Google Scholar 

  15. Dale Miller. An extension to ML to handle bound variables in data structures: Preliminary report. In Proceedings of the Logical Frameworks BRA Workshop, Nice, France, May 1990.

    Google Scholar 

  16. Dale Miller. Unification of simply typed lambda-terms as logic programming. In Koichi Furukawa, editor, Eighth International Logic Programming Conference, pages 255–269, Paris, France, June 1991. MIT Press.

    Google Scholar 

  17. Dale Miller. Abstract syntax and logic programming. In Proceedings of the First and Second Russian Conferences on Logic Programming, pages 322–337, Irkutsk and St. Petersburg, Russia, 1992. Springer-Verlag LNAI 592.

    Google Scholar 

  18. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin-Löf's Type Theory: An Introduction, volume 7 of International Series of Monographs on Computer Science. Oxford University Press, 1990.

    Google Scholar 

  19. Martin Odersky. A functional theory of local names. In Proceedings of the 21st Annual Symposium on Principles of Programming Languages, pages 48–59, Portland, Oregon, January 1994. ACM Press.

    Google Scholar 

  20. Christine Paulin-Mohring. Inductive definitions in the system Coq: Rules and properties. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 328–345, Utrecht, The Netherlands, March 1993. Springer-Verlag LNCS 664.

    Google Scholar 

  21. Frank Pfenning. Logic programming in the LF logical framework. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149–181. Cambridge University Press, 1991.

    Google Scholar 

  22. Frank Pfenning and Hao-Chi Wong. On a modal λ-calculus for S4. In S. Brookes and M. Main, editors, Proceedings of the Eleventh Conference on Mathematical Foundations of Programming Sematics, New Orleans, Louisiana, March 1995. To appear in Electronic Notes in Theoretical Computer Science, Volume 1, Elsevier.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, F-06902, Sophia-Antipolis Cedex, France

    Joëlle Despeyroux

  2. Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Frank Pfenning & Carsten Schürmann

Authors
  1. Joëlle Despeyroux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Pfenning
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carsten Schürmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Philippe de Groote J. Roger Hindley

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Despeyroux, J., Pfenning, F., Schürmann, C. (1997). Primitive recursion for higher-order abstract syntax. In: de Groote, P., Roger Hindley, J. (eds) Typed Lambda Calculi and Applications. TLCA 1997. Lecture Notes in Computer Science, vol 1210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62688-3_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-62688-3_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62688-6

  • Online ISBN: 978-3-540-68438-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation